The following pages link to Games against nature (Q1069296):
Displaying 48 items.
- Moving in a network under random failures: a complexity analysis (Q433350) (← links)
- Constraint-based analysis of concurrent probabilistic hybrid systems: an application to networked automation systems (Q547916) (← links)
- Randomization for robot tasks: using dynamic programming in the space of knowledge states (Q686748) (← links)
- Engineering constraint solvers for automatic analysis of probabilistic hybrid automata (Q710668) (← links)
- Shortest paths without a map (Q809612) (← links)
- Contingent planning under uncertainty via stochastic satisfiability (Q814473) (← links)
- Computation of equilibria in noncooperative games (Q815274) (← links)
- Confidence-based reasoning in stochastic constraint programming (Q896433) (← links)
- Solving multistage quantified linear optimization problems with the alpha-beta nested Benders decomposition (Q904957) (← links)
- Optimal node visitation in acyclic stochastic digraphs with multi-threaded traversals and internal visitation requirements (Q977005) (← links)
- APPSSAT: Approximate probabilistic planning using stochastic satisfiability (Q997058) (← links)
- An application of quantum finite automata to interactive proof systems (Q1015813) (← links)
- Minimum disclosure proofs of knowledge (Q1110348) (← links)
- Interactive foundations of computing (Q1127523) (← links)
- The complexity of stochastic games (Q1187025) (← links)
- Generalizations of Opt P to the polynomial hierarchy (Q1193867) (← links)
- A short certificate of the number of universal optimal strategies for stopping simple stochastic games (Q1350746) (← links)
- On the complexity of partially observed Markov decision processes (Q1351500) (← links)
- Sound and efficient closed-world reasoning for planning (Q1399125) (← links)
- Quantum multi-prover interactive proof systems with limited prior entanglement. (Q1401955) (← links)
- Interactive and probabilistic proof-checking (Q1577488) (← links)
- Decision algorithms for multiplayer noncooperative games of incomplete information (Q1609052) (← links)
- Approximate counting in SMT and value estimation for probabilistic programs (Q1683928) (← links)
- On sabotage games (Q1785757) (← links)
- Endgame problems of Sim-like graph Ramsey avoidance games are PSPACE-complete. (Q1853560) (← links)
- Quantum alternation (Q2361668) (← links)
- Computational complexity of stochastic programming problems (Q2492669) (← links)
- Solving H-horizon, stationary Markov decision problems in time proportional to log (H) (Q2638964) (← links)
- Exact stochastic constraint optimisation with applications in network analysis (Q2667834) (← links)
- The cost of adaptivity in security games on graphs (Q2697875) (← links)
- (Q2741527) (← links)
- Generalized Craig Interpolation for Stochastic Boolean Satisfiability Problems (Q3000643) (← links)
- Scheduling Stochastic Jobs with a Two-Point Distribution on Two Parallel Machines (Q3415915) (← links)
- On the Relationship between Hybrid Probabilistic Logic Programs and Stochastic Satisfiability (Q3534675) (← links)
- De Groot duality and models of choice: angels, demons and nature (Q3559970) (← links)
- From State-of-the-Art Static Fleet Assignment to Flexible Stochastic Planning of the Future (Q3637316) (← links)
- The polynomial hierarchy and a simple model for competitive analysis (Q3716806) (← links)
- Classifying the computational complexity of problems (Q3781088) (← links)
- Generalized Quantum Arthur--Merlin Games (Q4634057) (← links)
- TETRIS IS HARD, EVEN TO APPROXIMATE (Q4818596) (← links)
- Challenges in Constraint-Based Analysis of Hybrid Systems (Q5191406) (← links)
- Stochastic Satisfiability Modulo Theories for Non-linear Arithmetic (Q5387634) (← links)
- Scheduling Two-Point Stochastic Jobs to Minimize the Makespan on Two Parallel Machines (Q5488538) (← links)
- Dot operators (Q5958134) (← links)
- A resolution proof system for dependency stochastic Boolean satisfiability (Q6050766) (← links)
- On counting propositional logic and Wagner's hierarchy (Q6100184) (← links)
- Towards logical foundations for probabilistic computation (Q6560995) (← links)
- Curry and Howard meet Borel (Q6649480) (← links)
