217 search results - page 40 / 44 » An improved dynamic programming algorithm for coalition stru... |
ICCAD
2001
IEEE
14 years 3 months ago
2001
IEEE
Methods based on Boolean satisfiability (SAT) typically use a Conjunctive Normal Form (CNF) representation of the Boolean formula, and exploit the structure of the given problem ...
FLAIRS
2008
13 years 9 months ago
2008
Preferences in constraint problems are common but significant in many real world applications. In this paper, we extend our conditional and composite CSP (CCCSP) framework, managi...
ICS
2009
Tsinghua U.
13 years 11 months ago
2009
Tsinghua U.
Modern GPUs offer much computing power at a very modest cost. Even though CUDA and other related recent developments are accelerating the use of GPUs for general purpose applicati...
NIPS
1996
13 years 8 months ago
1996
Dynamic Programming, Q-learning and other discrete Markov Decision Process solvers can be applied to continuous d-dimensional state-spaces by quantizing the state space into an arr...
CP
2005
Springer
14 years 12 days ago
2005
Springer
Abstract. In recent years, dynamic local search (DLS) clause weighting algorithms have emerged as the local search state-of-the-art for solving propositional satisfiability proble...