88 search results - page 16 / 18 » Solving Non-Boolean Satisfiability Problems with Stochastic ... |
AAMAS
2000
Springer
13 years 6 months ago
2000
Springer
When multiple agents are in a shared environment, there usually exist constraints among the possible actions of these agents. A distributed constraint satisfaction problem (distrib...
JAIR
2008
13 years 6 months ago
2008
Partially Observable Markov Decision Processes (POMDPs) provide a rich framework for sequential decision-making under uncertainty in stochastic domains. However, solving a POMDP i...
CP
1999
Springer
13 years 10 months ago
1999
Springer
In this paper we present a Lagrange-multiplier formulation of discrete constrained optimization problems, the associated discrete-space first-order necessary and sufficient condit...
FLAIRS
2008
13 years 8 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...
GECCO
2004
Springer
13 years 11 months ago
2004
Springer
Genetic Programming uses trees to represent chromosomes. The user defines the representation space by defining the set of functions and terminals to label the nodes in the trees....