1480 search results - page 148 / 296 » Ants can solve constraint satisfaction problems |
184
click to vote
ATAL
2010
Springer
15 years 6 months ago
2010
Springer
We extend the framework of mixed multi-unit combinatorial auctions to include time constraints, present an expressive bidding language, and show how to solve the winner determinati...
157
click to vote
CDC
2009
IEEE
15 years 11 months ago
2009
IEEE
— This paper presents a control for state-constrained nonlinear systems in strict feedback form to achieve output tracking. To prevent states from violating the constraints, we e...
153
click to vote
CATS
2008
15 years 8 months ago
2008
We study the consistency problem for extended global cardinality (EGC) constraints. An EGC constraint consists of a set X of variables, a set D of values, a domain D(x) D for eac...
164
click to vote
AAAI
1990
15 years 7 months ago
1990
This paper concerns the task of removing redundant information from a given knowledge base, and restructuring it in the form of a tree, so as to admit efficient problem solving ro...
156
click to vote
JAIR
2008
15 years 6 months ago
2008
Asynchronous Partial Overlay (APO) is a search algorithm that uses cooperative mediation to solve Distributed Constraint Satisfaction Problems (DisCSPs). The algorithm partitions ...