1480 search results - page 122 / 296 » Ants can solve constraint satisfaction problems |
148
click to vote
CPAIOR
2008
Springer
15 years 8 months ago
2008
Springer
Abstract. While several powerful methods exist for automatically detecting symmetries in instances of constraint satisfaction problems (CSPs), current methods for detecting symmetr...
181
click to vote
AIR
2004
15 years 6 months ago
2004
Ensuring truthfulness amongst self-interested agents bidding against one another in an auction can be computationally expensive when prices are determined using the Vickrey-Clarke-...
153
click to vote
ECAI
2006
Springer
15 years 10 months ago
2006
Springer
Abstract. We address the problem of representing big sets of binary constraints compactly. Binary constraints in the form of 2literal clauses are ubiquitous in propositional formul...
181
click to vote
COLT
2006
Springer
15 years 10 months ago
2006
Springer
In this paper, we study a sequential decision making problem. The objective is to maximize the total reward while satisfying constraints, which are defined at every time step. The...
158
click to vote
DATE
2000
IEEE
15 years 11 months ago
2000
IEEE
We address the problem of inserting repeaters, selected from a library, at feasible locations in a placed and routed network to meet user-specified delay constraints. We use mini...