39 search results - page 4 / 8 » Solving Probabilistic Combinatorial Games |
AI
2003
Springer
14 years 29 days ago
2003
Springer
Abstract. In this paper, we study the behaviour of the Scaling and Probabilistic Smoothing (SAPS) dynamic local search algorithm on the unweighted MAXSAT problem. MAX-SAT is a conc...
EVOW
2007
Springer
14 years 1 months ago
2007
Springer
The Shortest Common Supersequence Problem (SCSP) is a well-known hard combinatorial optimization problem that formalizes many real world problems. This paper presents a novel rando...
AI
2008
Springer
13 years 7 months ago
2008
Springer
We make a number of contributions to the study of the Quantified Constraint Satisfaction Problem (QCSP). The QCSP is an extension of the constraint satisfaction problem that can b...
TALG
2008
13 years 7 months ago
2008
A cost-sharing scheme is a set of rules defining how to share the cost of a service (often computed by solving a combinatorial optimization problem) amongst serviced customers. A ...
RAS
2007
13 years 7 months ago
2007
We use a decomposition approach to generate cooperative strategies for a class of multi-vehicle control problems. By introducing a set of tasks to be completed by the team of vehi...