2252 search results - page 131 / 451 » Lower Bounds for Dynamic Algorithms |
GECCO
2004
Springer
15 years 8 months ago
2004
Springer
Before Multiobjective EvolutionaryAlgorithms (MOEAs) can be used as a widespread tool for solving arbitrary real world problems there are some salient issues which require further ...
87
Voted
GECCO
2003
Springer
15 years 8 months ago
2003
Springer
Following the work of Stephens and coworkers on the coarse-grained dynamics of genetic systems, we work towards a possible generalisation in the context of genetic algorithms, givi...
108
click to vote
AAAI
2007
15 years 5 months ago
2007
We study the behavior of the classical A∗ search algorithm when coupled with a heuristic that provides estimates, accurate to within a small multiplicative factor, of the distan...
104
click to vote
DLOG
2007
15 years 5 months ago
2007
Abstract. Conjunctive query answering is an important DL reasoning task. Although this task is by now quite well-understood, tight complexity bounds for conjunctive query answering...
112
click to vote
COCO
2005
Springer
15 years 9 months ago
2005
Springer
It is well known that the hardest bit of integer multiplication is the middle bit, i.e. MULn−1,n. This paper contains several new results on its complexity. First, the size s of...