1480 search results - page 134 / 296 » Ants can solve constraint satisfaction problems |
132
click to vote
DISOPT
2008
15 years 6 months ago
2008
Abstract. Let the graph G = (V, E) be a cycle with n + 1 vertices, nonnegative vertex weights and positive edge lengths. The inverse 1-median problem on a cycle consists in changin...
196
click to vote
SOCIALCOM
2010
15 years 1 months ago
2010
Most of the current swarm model studies and applications try to mimic the collective behaviors of social animals, such as birds and ants. The studies seek to solve tasks similar to...
170
click to vote
ICDM
2009
IEEE
15 years 4 months ago
2009
IEEE
Efficient acquisition of constraint networks is a key factor for the applicability of constraint problem solving methods. Current techniques ease knowledge acquisition by generati...
168
click to vote
EAAI
2008
15 years 6 months ago
2008
The criterion of total weighted completion time occurs as a sub-problem of combinatorial optimization problems in such diverse areas as scheduling, container loading and storage a...
278
click to vote
ICICIC
2006
IEEE
16 years 16 days ago
2006
IEEE
In timetable scheduling problems, examination subjects must be slotted to certain times that satisfy several of constraints. They are NP-completeness problems, which usually lead ...