3192 search results - page 367 / 639 » The minimum latency problem |
120
click to vote
ARCS
2006
Springer
15 years 8 months ago
2006
Springer
: Given is the following "creature's exploration problem": n creatures are moving around in an unknown environment in order to visit all cells in shortest time. This...
109
click to vote
GECCO
2006
Springer
15 years 8 months ago
2006
Springer
Optimizing combinations of placements of parts, known as markers, is an important preparatory step in order-based industrial production of clothes. Given a work order in the form ...
135
click to vote
AAAI
2008
15 years 6 months ago
2008
The survey propagation (SP) algorithm has been shown to work well on large instances of the random 3-SAT problem near its phase transition. It was shown that SP estimates marginal...
155
click to vote
APPROX
2008
Springer
15 years 6 months ago
2008
Springer
In the field of robust optimization, the goal is to provide solutions to combinatorial problems that hedge against variations of the numerical parameters. This constitutes an effor...
147
click to vote
ARCS
2008
Springer
15 years 6 months ago
2008
Springer
: The task of the creatures in the "creatures' exploration problem" is to visit all empty cells in an environment with a minimum number of steps. We have analyzed th...