1480 search results - page 44 / 296 » Ants can solve constraint satisfaction problems |
KES
2007
Springer
15 years 3 months ago
2007
Springer
Rich vehicle routing problems try to represent situations that can be found in reality. Starting from a case study, in this paper a rich vehicle routing problem is analyzed. The e...
103
click to vote
MATES
2009
Springer
15 years 4 months ago
2009
Springer
In constraint satisfaction, decomposition is a common technique to split a problem in a number of parts in such a way that the global solution can be efficiently assembled from th...
EVOW
2006
Springer
15 years 1 months ago
2006
Springer
Abstract. Bucket elimination (BE) is an exact technique based on variable elimination, commonly used for solving constraint satisfaction problems. We consider the hybridization of ...
NOMS
2000
IEEE
15 years 2 months ago
2000
IEEE
Communication networks are expected to offer a wide range of services to an increasingly large number of users, with a diverse range of quality of service. This calls for efficien...
QSIC
2005
IEEE
15 years 3 months ago
2005
IEEE
Fault-based testing is a technique where testers anticipate errors in a system under test in order to assess or generate test cases. The idea is to have enough test cases capable ...