7106 search results - page 280 / 1422 » Restricted Complexity, General Complexity |
155
click to vote
CADE
2012
Springer
13 years 7 months ago
2012
Springer
Abstract. Reachability and LTL model-checking problems for flat counter systems are known to be decidable but whereas the reachability problem can be shown in NP, the best known c...
111
click to vote
GECCO
2003
Springer
15 years 9 months ago
2003
Springer
It is clear from the study of complex non-linear systems in general, and evolutionary algorithms (EAs) in particular, that there is no single analysis tool or technique capable of ...
132
Voted
COCO
2001
Springer
15 years 9 months ago
2001
Springer
We present several applications of quantum amplitude amplification to finding claws and collisions in ordered or unordered functions. Our algorithms generalize those of Brassard...
154
Voted
CPM
2008
Springer
15 years 6 months ago
2008
Springer
We present an algorithm for computing the edit distance of two RNA structures with arbitrary kinds of pseudoknots. A main benefit of the algorithm is that, despite the problem is N...
108
click to vote
IJCAI
1989
15 years 5 months ago
1989
We describe a general technique for expressing domain knowledge in constraint satisfaction problems, and using it to develop optimized parallel arc consistency algorithms for the ...