Sciweavers

10608 search results - page 615 / 2122
» Complexity of O'Hara's Algorithm
Sort
View
CEC
2005
IEEE
16 years 25 days ago
Sequential parameter optimization
Abstract- Sequential parameter optimization is a heuristic that combines classical and modern statistical techniques to improve the performance of search algorithms. To demonstrate...
Thomas Bartz-Beielstein, Christian Lasarczyk, Mike...
STOC
2005
ACM
143views Algorithms» more  STOC 2005»
16 years 23 days ago
On strip packing With rotations
We present an asymptotic fully polynomial time approximation scheme for two-dimensional strip packing with rotations. In this problem, a set of rectangles need to be packed into a...
Klaus Jansen, Rob van Stee
ASM
2005
ASM
16 years 23 days ago
State Exploration with Multiple State Groupings
Abstract. Exploration algorithms are relevant to the industrial practice of gentest cases from an abstract state machine whose runs define the predicted behavior of the software s...
Colin Campbell, Margus Veanes
DIALM
2004
ACM
100views Algorithms» more  DIALM 2004»
16 years 19 days ago
Virtual coordinates for ad hoc and sensor networks
In many applications of wireless ad hoc and sensor networks, position-awareness is of great importance. Often, as in the case of geometric routing, it is sufficient to have virtua...
Thomas Moscibroda, Regina O'Dell, Mirjam Wattenhof...
IPPS
2003
IEEE
16 years 14 days ago
Parallel LAN/WAN Heuristics for Optimization
We present in this work a wide spectrum of results on analyzing the behavior of parallel heuristics for solving optimization problems. We focus on evolutionary algorithms as well ...
Enrique Alba, Gabriel Luque