The following pages link to (Q4315289):
Displaying 50 items.
- A uniform framework for modeling nondeterministic, probabilistic, stochastic, or mixed processes and their behavioral equivalences (Q384933) (← links)
- Compositional probabilistic verification through multi-objective model checking (Q386007) (← links)
- A MDP approach to fault-tolerant routing (Q389801) (← links)
- Safety verification for probabilistic hybrid systems (Q389835) (← links)
- Determinacy and optimal strategies in infinite-state stochastic reachability games (Q391114) (← links)
- Hybrid answer set programming (Q392277) (← links)
- Robust adaptive dynamic programming for linear and nonlinear systems: an overview (Q397504) (← links)
- Minimax PAC bounds on the sample complexity of reinforcement learning with a generative model (Q399890) (← links)
- Modular inverse reinforcement learning for visuomotor behavior (Q402339) (← links)
- On real reward testing (Q407446) (← links)
- Markov decision processes with state-dependent discount factors and unbounded rewards/costs (Q408405) (← links)
- Algorithm portfolio selection as a bandit problem with unbounded losses (Q408989) (← links)
- Stochastic relational processes: efficient inference and applications (Q413831) (← links)
- Knows what it knows: a framework for self-aware learning (Q413843) (← links)
- Finding optimal memoryless policies of POMDPs under the expected average reward criterion (Q418072) (← links)
- Decision-theoretic planning with generalized first-order decision diagrams (Q420812) (← links)
- R\&D pipeline management: task interdependencies and risk management (Q420877) (← links)
- Finite horizon semi-Markov decision processes with application to maintenance systems (Q421498) (← links)
- The optimal control of just-in-time-based production and distribution systems and performance comparisons with optimized pull systems (Q421584) (← links)
- Dynamic lot-sizing in sequential online retail auctions (Q421653) (← links)
- A reinforcement learning approach to call admission and call dropping control in links with variable capacity (Q431777) (← links)
- New average optimality conditions for semi-Markov decision processes in Borel spaces (Q438786) (← links)
- Monotone optimal control for a class of Markov decision processes (Q439381) (← links)
- Performance optimization of queueing systems with perturbation realization (Q439492) (← links)
- Optimal maintenance of systems with Markovian mission and deterioration (Q439625) (← links)
- Optimizing a dynamic order-picking process (Q439680) (← links)
- Three-valued abstraction for probabilistic systems (Q444484) (← links)
- Average control of Markov decision processes with Feller transition probabilities and general action spaces (Q450971) (← links)
- Discounted continuous-time Markov decision processes with unbounded rates and randomized history-dependent policies: the dynamic programming approach (Q457293) (← links)
- An exact iterative search algorithm for constrained Markov decision processes (Q458792) (← links)
- Value set iteration for Markov decision processes (Q459022) (← links)
- Depth-based short-sighted stochastic shortest path problems (Q460624) (← links)
- A tutorial on event-based optimization -- a new optimization framework (Q461464) (← links)
- Event-based optimization of admission control in open queueing networks (Q461465) (← links)
- Maximizing the set of recurrent states of an MDP subject to convex constraints (Q462403) (← links)
- Regret bounds for restless Markov bandits (Q465253) (← links)
- Maximizing entropy over Markov processes (Q465487) (← links)
- Markov decision processes on Borel spaces with total cost and random horizon (Q467433) (← links)
- Optimal call admission and call dropping control in links with variable capacity (Q468286) (← links)
- Newton-based stochastic optimization using \(q\)-Gaussian smoothed functional algorithms (Q472587) (← links)
- Profit maximization in flexible serial queueing networks (Q475122) (← links)
- Markov limid processes for representing and solving renewal problems (Q475217) (← links)
- Influence of temporal aggregation on strategic forest management under risk of wind damage (Q475251) (← links)
- Improving active Mealy machine learning for protocol conformance testing (Q479471) (← links)
- A counterexample on sample-path optimality in stable Markov decision chains with the average reward criterion (Q481787) (← links)
- Towards a theory of game-based non-equilibrium control systems (Q488883) (← links)
- Stochastic scheduling: a short history of index policies and new approaches to index generation for dynamic resource allocation (Q490352) (← links)
- Parameterized Markov decision process and its application to service rate control (Q492972) (← links)
- Stochastic finite-state systems in control theory (Q497618) (← links)
- Dynamic mechanism design with interdependent valuations (Q497945) (← links)
