1480 search results - page 199 / 296 » Ants can solve constraint satisfaction problems |
209
click to vote
MOBICOM
2006
ACM
16 years 12 days ago
2006
ACM
We consider the problem of throughput-optimal scheduling in wireless networks subject to interference constraints. We model the interference using a family of K-hop interference m...
170
click to vote
ASPDAC
2005
ACM
16 years 15 hour ago
2005
ACM
With impressive progress in Boolean Satisfiability (SAT) solving and several extensions to pseudo-Boolean (PB) constraints, many applications that use SAT, such as highperformanc...
183
click to vote
CADE
2008
Springer
16 years 6 months ago
2008
Springer
We propose a procedure for automated implicit inductive theorem proving for equational specifications made of rewrite rules with conditions and constraints. The constraints are int...
156
click to vote
CONSTRAINTS
2008
15 years 6 months ago
2008
Zinc is a new modelling language developed as part of the G12 project. It has four important characteristics. First, Zinc allows speci cation of models using a natural mathematical...
164
click to vote
UAI
1998
15 years 7 months ago
1998
Recent research in decision theoretic planning has focussedon making the solution of Markov decision processes (MDPs) more feasible. We develop a family of algorithms for structur...