698 search results - page 31 / 140 » A Deterministic Algorithm for Solving Imprecise Decision Pro... |
COCO
2004
Springer
14 years 1 months ago
2004
Springer
We initiate the study of the computational complexity of the covering radius problem for point lattices, and approximation versions of the problem for both lattices and linear cod...
ISAAC
1995
Springer
14 years 26 days ago
1995
Springer
Ordered Binary-Decision Diagrams (OBDD) are the state-of-the-art data structure for boolean function manipulation and there exist several software packages for OBDD manipulation. ...
AAAI
1997
13 years 10 months ago
1997
Many stochastic planning problems can be represented using Markov Decision Processes (MDPs). A difficulty with using these MDP representations is that the common algorithms for so...
ECAI
2006
Springer
14 years 1 months ago
2006
Springer
Several formalisms exist to express and solve decision problems. Each is designed to capture different kinds of knowledge: utilities expressing preferences, uncertainties on the en...
CORR
2007
Springer
13 years 9 months ago
2007
Springer
Abstract. The Boolean satisfiability problem (SAT) can be solved efficiently with variants of the DPLL algorithm. For industrial SAT problems, DPLL with conflict analysis depend...