1480 search results - page 133 / 296 » Ants can solve constraint satisfaction problems |
195
click to vote
ENTCS
2007
15 years 6 months ago
2007
We suggest a formal model to represent and solve the multicast routing problem in multicast networks. To attain this, we model the network adapting it to a weighted and-or graph, ...
192
click to vote
ICCV
2009
IEEE
16 years 11 months ago
2009
IEEE
Clustering performance can often be greatly improved by
leveraging side information. In this paper, we consider constrained
clustering with pairwise constraints, which specify
s...
198
click to vote
EMMCVPR
2001
Springer
15 years 11 months ago
2001
Springer
The interest of graph matching techniques in the pattern recognition field is increasing due to the versatility of representing knowledge in the form of graphs. However, the size ...
194
click to vote
CONSTRAINTS
2007
15 years 6 months ago
2007
In this paper we present Cardinal, a general finite sets constraint solver just made publicly available in ECLiPSe Prolog, suitable for combinatorial problem solving by exploiting ...
220
click to vote
EVOW
2007
Springer
16 years 19 days ago
2007
Springer
Abstract. The Traveling Salesman Problem (TSP) is a well-known NPhard combinatorial optimization problem, for which a large variety of evolutionary algorithms are known. However, t...