202 search results - page 11 / 41 » Complexity of local search for the p-median problem |
ANNS
2010
13 years 2 months ago
2010
Evolving recurrent neural networks for behavior control of robots equipped with larger sets of sensors and actuators is difficult due to the large search spaces that come with the ...
CG
2004
Springer
13 years 11 months ago
2004
Springer
Abstract. There are two complementary approaches to playing sums of combinatorial games. They can be characterized as local analysis and global search. Algorithms from combinatoria...
CVPR
2010
IEEE
14 years 3 months ago
2010
IEEE
We present a region-based active contour detection algorithm for objects that exhibit relatively homogeneous photometric characteristics (e.g. smooth color or gray levels), embedd...
GECCO
2004
Springer
14 years 23 days ago
2004
Springer
We discuss the computational complexity of random 2D Ising spin glasses, which represent an interesting class of constraint satisfaction problems for black box optimization. Two ex...
CVPR
2010
IEEE
13 years 7 months ago
2010
IEEE
Optimum subwindow search for object detection aims to find a subwindow so that the contained subimage is most similar to the query object. This problem can be formulated as a fou...