1480 search results - page 90 / 296 » Ants can solve constraint satisfaction problems |
CSCLP
2006
Springer
15 years 1 months ago
2006
Springer
A number of different satisfaction and optimisation combinatorial problems have recently been approached with constraint programming over the domain of finite sets, for increased d...
ECAI
2010
Springer
14 years 11 months ago
2010
Springer
This paper proposes several operational approaches for solving fair allocation problems in the context of multiagent optimization. These problems arise in various contexts such as ...
ANTS
2006
Springer
15 years 1 months ago
2006
Springer
This paper suggests a new building block for cryptographic protocols and gives two instantiations of it. The concept is to generate two descriptions of the same group: a public des...
DATESO
2007
14 years 11 months ago
2007
Boyer-Moore-Horspool (BMH) algorithm is commonly used to solve text searching problems. In this paper is used to solve the constraint subset of XPath queries offering effective alg...
CP
2003
Springer
15 years 3 months ago
2003
Springer
For the last ten years, a significant amount of work in the constraint community has been devoted to the improvement of complete methods for solving soft constraints networks. We ...