315 search results - page 41 / 63 » A new heuristic to solve the one-warehouse N-retailer proble... |
IROS
2007
IEEE
14 years 2 months ago
2007
IEEE
– A problem of searching with multiple searchers and scouts is presented. Unlike most search problems that terminate as soon as the target is found, successful detections by scou...
GECCO
2007
Springer
14 years 2 months ago
2007
Springer
Recent work has provided functions that can be used to prove a principled distinction between the capabilities of mutation-based and crossover-based algorithms. However, prior fun...
ACCV
2010
Springer
13 years 3 months ago
2010
Springer
We present a new approach to robustly solve photometric stereo problems. We cast the problem of recovering surface normals from multiple lighting conditions as a problem of recover...
AIPS
2008
13 years 11 months ago
2008
Enforced hill-climbing is an effective deterministic hillclimbing technique that deals with local optima using breadth-first search (a process called "basin flooding"). ...
ICDCS
1999
IEEE
14 years 28 days ago
1999
IEEE
To provide real-time service or engineer constrained-based paths, networks require the underlying routing algorithm to be able to find low-cost paths that satisfy given Quality-of...