698 search results - page 116 / 140 » A Deterministic Algorithm for Solving Imprecise Decision Pro... |
FOCS
2006
IEEE
14 years 3 months ago
2006
IEEE
We study compression that preserves the solution to an instance of a problem rather than preserving the instance itself. Our focus is on the compressibility of NP decision problem...
SODA
2008
ACM
13 years 10 months ago
2008
ACM
This paper considers a general setting for structured procurement and the problem a buyer faces in designing a procurement mechanism to maximize profit. This brings together two a...
CAV
1999
Springer
14 years 1 months ago
1999
Springer
BDDs and their algorithms implement a decision procedure for Quanti ed Propositional Logic. BDDs are a kind of acyclic automata. Unrestricted automata (recognizing unbounded string...
GECCO
2008
Springer
13 years 10 months ago
2008
Springer
Liveness properties in concurrent systems are, informally, those properties that stipulate that something good eventually happens during execution. In order to prove that a given ...
PKDD
2010
Springer
13 years 7 months ago
2010
Springer
Partially observable Markov decision processes (POMDPs) are widely used for planning under uncertainty. In many applications, the huge size of the POMDP state space makes straightf...