1480 search results - page 119 / 296 » Ants can solve constraint satisfaction problems |
153
click to vote
IJCAI
1993
15 years 7 months ago
1993
This paper introduces GSSS (Genetic State-Space Search). The integration of two general search paradigms — genetic search and state-space-search provides a general framework whi...
173
click to vote
CP
2003
Springer
15 years 11 months ago
2003
Springer
Abstract. Local search algorithms have been very successful for solving constraint satisfaction problems (CSP). However, a major weakness has been that local search is unable to de...
167
click to vote
ICIP
2010
IEEE
15 years 4 months ago
2010
IEEE
The 2- 1 compressed sensing minimization problem can be solved efficiently by gradient projection. In imaging applications, the signal of interest corresponds to nonnegative pixel...
187
click to vote
APPROX
2009
Springer
16 years 1 months ago
2009
Springer
Submodular-function maximization is a central problem in combinatorial optimization, generalizing many important NP-hard problems including Max Cut in digraphs, graphs and hypergr...
190
click to vote
ICIP
1999
IEEE
16 years 8 months ago
1999
IEEE
The quadtree data structure is widely used in digital image processing and computer graphics for modeling spatial segmentation of images and surfaces. A quadtree is a tree in whic...