4229 search results - page 689 / 846 » On the Optimality of Spiral Search |
178
click to vote
ATAL
2009
Springer
16 years 1 months ago
2009
Springer
Distributed Lagrangian Relaxation Protocol (DisLRP) has been proposed to solve a distributed combinatorial maximization problem called the Generalized Mutual Assignment Problem (G...
185
click to vote
ICDM
2006
IEEE
16 years 16 days ago
2006
IEEE
Clustering is ill-defined. Unlike supervised learning where labels lead to crisp performance criteria such as accuracy and squared error, clustering quality depends on how the cl...
182
click to vote
MM
2006
ACM
16 years 14 days ago
2006
ACM
We present an efficient system for video search that maximizes the use of human bandwidth, while at the same time exploiting the machine’s ability to learn in real-time from use...
187
click to vote
CP
2005
Springer
16 years 1 days ago
2005
Springer
Abstract. Most CSP algorithms are based on refinements and extensions of backtracking, and employ one of two simple “branching schemes”: 2-way branching or d-way branching, fo...
151
click to vote
GECCO
2005
Springer
16 years 22 hour ago
2005
Springer
Edge Assembly Crossover (EAX) is by far the most successful crossover operator in solving the traveling salesman problem (TSP) with Genetic Algorithms (GAs). Various improvements ...