2446 search results - page 157 / 490 » Choiceless Polynomial Time |
95
Voted
SAT
2004
Springer
15 years 6 months ago
2004
Springer
Abstract. Recently Schuler [17] presented a randomized algorithm that solves SAT in expected time at most 2n(1−1/ log2(2m)) up to a polynomial factor, where n and m are, respecti...
116
Voted
CAV
2003
Springer
15 years 6 months ago
2003
Springer
We show that the model checking problem for µ-calculus on graphs of bounded tree-width can be solved in time linear in the size of the system. The result is presented by first sh...
GECCO
2003
Springer
15 years 6 months ago
2003
Springer
Abstract. Although evolutionary algorithms (EAs) are often successfully used for the optimization of dynamically changing objective function, there are only very few theoretical re...
128
Voted
HYBRID
2003
Springer
15 years 6 months ago
2003
Springer
Abstract. The use of algorithmic verification and synthesis tools for hybrid systems is currently limited to systems exhibiting simple continuous dynamics such as timed automata o...
114
Voted
LATA
2010
Springer
15 years 6 months ago
2010
Springer
Abstract. Kanazawa ([1]) has studied the learnability of several parameterized families of classes of categorial grammars. These classes were shown to be learnable from text, in th...