6274 search results - page 257 / 1255 » From query complexity to computational complexity |
117
click to vote
ALIFE
1998
15 years 4 months ago
1998
There have been various attempts to simulate the self-assembly process of lipid aggregates by computers. However, due to the computationally complex nature of the problem, previou...
208
Voted
GECCO
2011
Springer
14 years 8 months ago
2011
Springer
Computing unique input-output sequences (UIOs) from finite state machines (FSMs) is important for conformance testing in software engineering, where evolutionary algorithms (EAs)...
150
click to vote
WDAG
2007
Springer
15 years 11 months ago
2007
Springer
Abstract. We examine the problem of detecting nested temporal predicates given the execution trace of a distributed program. We present a technique that allows efficient detection ...
175
click to vote
PC
2008
15 years 4 months ago
2008
Reconfigurable computing (RC) applications employing both microprocessors and FPGAs have potential for large speedup when compared with traditional (software) parallel application...
135
Voted
SIGMOD
1996
ACM
15 years 9 months ago
1996
ACM
Magic sets rewriting is a well-known optimization heuristic for complex decision-support queries. There can be many variants of this rewriting even for a single query, which diffe...