1480 search results - page 74 / 296 » Ants can solve constraint satisfaction problems |
ESA
2006
Springer
15 years 1 months ago
2006
Springer
A popular approach in combinatorial optimization is to model problems as integer linear programs. Ideally, the relaxed linear program would have only integer solutions, which happ...
IJCNN
2000
IEEE
15 years 2 months ago
2000
IEEE
In our recent work, a general method called the stable state analysis technique was developed to determine constraints that the weights in the Hopfield energy function must satisf...
60
Voted
CVPR
2007
IEEE
15 years 11 months ago
2007
IEEE
In this paper, we describe a technique to temporally sort a collection of photos that span many years. By reasoning about persistence of visible structures, we show how this sorti...
GECCO
2004
Springer
15 years 3 months ago
2004
Springer
It is crucial to maximize marketing efficiency and customer satisfaction in personalized marketing. In this paper, we raise the multiple recommendation problem which occurs when pe...
AAAI
1997
14 years 11 months ago
1997
Constraint satisfaction research has focussed on consistency checking using k-consistency and its variations such as arc-consistency, and path-consistency. We define a new form of...