151 search results - page 11 / 31 » A CSP Search Algorithm with Reduced Branching Factor |
AUSAI
2003
Springer
14 years 26 days ago
2003
Springer
The distributed constraint satisfaction problem (CSP) is a general formalisation used to represent problems in distributed multiagent systems. To deal with realistic problems, mult...
ICIP
1998
IEEE
14 years 9 months ago
1998
IEEE
Motion estimation represents the most computationally intensive task for all efficient motion compensated compression standards. This fact, despite the several eflorts aiming at r...
CG
2004
Springer
14 years 1 months ago
2004
Springer
Kriegspiel is a Chess variant similar to wargames, in which players have to deal with uncertainty. Kriegspiel increases the difficulty typical of Chess by hiding from each player h...
CP
2008
Springer
13 years 9 months ago
2008
Springer
We propose new filtering algorithms for the SEQUENCE constraint and some extensions of the SEQUENCE constraint based on network flows. We enforce domain consistency on the SEQUENCE...
ICML
2010
IEEE
13 years 8 months ago
2010
IEEE
This paper formalizes Feature Selection as a Reinforcement Learning problem, leading to a provably optimal though intractable selection policy. As a second contribution, this pape...