<--- Back to Details
First PageDocument Content
Probabilistic complexity theory / Algorithm / Mathematical logic / Randomized algorithm / Ant colony optimization algorithms / Computer simulation / Genetic algorithm / Shortest path problem / Nondeterministic algorithm / Theoretical computer science / Applied mathematics / Mathematics
Date: 2014-12-18 07:59:00
Probabilistic complexity theory
Algorithm
Mathematical logic
Randomized algorithm
Ant colony optimization algorithms
Computer simulation
Genetic algorithm
Shortest path problem
Nondeterministic algorithm
Theoretical computer science
Applied mathematics
Mathematics

Microsoft Word - Kneidl_EMEVAC_2011_final.docx

Add to Reading List

Source URL: www.cms.bgu.tum.de

Download Document from Source Website

File Size: 631,49 KB

Share Document on Facebook

Similar Documents

Probabilistic complexity theory / Algorithm / Mathematical logic / Randomized algorithm / Ant colony optimization algorithms / Computer simulation / Genetic algorithm / Shortest path problem / Nondeterministic algorithm / Theoretical computer science / Applied mathematics / Mathematics

Microsoft Word - Kneidl_EMEVAC_2011_final.docx

DocID: 19TaM - View Document

Complexity classes / Probabilistic complexity theory / Analysis of algorithms / Randomized algorithm / NL / PP / Algorithm / Monte Carlo method / Scheduling / Theoretical computer science / Computational complexity theory / Applied mathematics

Exact and Approximate Probabilistic Symbolic Execution for Nondeterministic Programs Kasper S. Luckow ˘ areanu ˘

DocID: 18Lth - View Document

Computer science / Applied mathematics / Deterministic finite automaton / Nondeterministic finite automaton / DFA Records / Finite-state machine / Algorithm / Counterexample / Regular expression / Automata theory / Models of computation / Theoretical computer science

A How Can Automatic Feedback Help Students Construct Automata? LORIS D’ANTONI, University of Pennsylvania DILEEP KINI, University of Illinois at Urbana-Champaign RAJEEV ALUR, University of Pennsylvania

DocID: 18891 - View Document

Graph operations / Tree decomposition / Connectivity / Path decomposition / Decomposition method / Nondeterministic algorithm / Connected component / Tree / Graph theory / Theoretical computer science / Mathematics

Tackling the Partner Units Configuration Problem∗ Markus Aschinger, Conrad Drescher, Georg Gottlob, Peter Jeavons, Evgenij Thorstensen Computing Laboratory University of Oxford

DocID: 187DQ - View Document

Models of computation / Applied mathematics / Concurrent computing / Parallel computing / Correctness / Finite-state machine / Linearizability / Thread / Algorithm / Computing / Theoretical computer science / Computer science

Separating Functional and Parallel Correctness using Nondeterministic Sequential Specifications Jacob Burnim, George Necula, and Koushik Sen Department of Computer Science, University of California, Berkeley {jburnim,nec

DocID: 17RzQ - View Document