1197 search results - page 123 / 240 » Which Dynamic Constraint Problems Can Be Solved By Ants |
CP
2007
Springer
14 years 2 months ago
2007
Springer
Abstract There has been considerable interest in the identification of structural properties of combinatorial problems that lead to efficient algorithms for solving them. Some of...
CADE
2008
Springer
14 years 8 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...
UAI
1998
13 years 9 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...
WIMOB
2008
IEEE
14 years 2 months ago
2008
IEEE
—In this paper, we propose two robust precoder designs for multiple-input multiple-output (MIMO) broadcast channels with imperfect channel state information (CSI). First, we cons...
ECAI
2004
Springer
14 years 10 hour ago
2004
Springer
Quantified Constraint Satisfaction Problems (QCSPs) are CSPs in which some variables are universally quantified. For each possible value of such variables, we have to find ways to ...