69 search results - page 3 / 14 » Generic Incremental Algorithms for Local Search |
AISC
2004
Springer
14 years 1 months ago
2004
Springer
ion Within Partial Deduction for Linear Logic . . . . . . . . . . . . . . . . . 52 P. K¨ungas A Decision Procedure for Equality Logic with Uninterpreted Functions . . . 66 O. Tver...
MOBIHOC
2001
ACM
14 years 8 months ago
2001
ACM
The development of practical, localized algorithms is probably the most needed and most challenging task in wireless ad-hoc sensor networks (WASNs). Localized algorithms are a spe...
CPAIOR
2004
Springer
14 years 1 months ago
2004
Springer
ng Abstractions for Local Search Pascal Van Hentenryck1 and Laurent Michel2 1 Brown University, Box 1910, Providence, RI 02912 2 University of Connecticut, Storrs, CT 06269-3155 Ab...
COCOON
2009
Springer
14 years 3 months ago
2009
Springer
We show that a random walk on a tournament on n vertices finds either a sink or a 3-cycle in expected time O √ n · log n · log∗ n , that is, sublinear both in the size of th...
GECCO
2008
Springer
13 years 9 months ago
2008
Springer
Our previous work has introduced a hyperheuristic (HH) approach based on Genetic Programming (GP). There, GP employs usergiven languages where domain-specific local heuristics ar...