The following pages link to G. A. Pérez (Q344559):
Displaying 34 items.
- Reactive synthesis without regret (Q520338) (← links)
- Safe learning for near-optimal scheduling (Q832074) (← links)
- Active learning of sequential transducers with side information about the domain (Q832921) (← links)
- Weak cost register automata are still powerful (Q1622948) (← links)
- Looking at mean payoff through foggy windows (Q1629743) (← links)
- The complexity of graph-based reductions for reachability in Markov decision processes (Q1652999) (← links)
- The impatient may use limited optimism to minimize regret (Q2289068) (← links)
- Partial solvers for generalized parity games (Q2330591) (← links)
- Mean-payoff games with partial observation (Q2636514) (← links)
- When are emptiness and containment decidable for probabilistic automata? (Q2662671) (← links)
- The complexity of reachability in parametric Markov decision processes (Q2662678) (← links)
- Correction to: ``Reactive synthesis without regret'' (Q2675812) (← links)
- Modeling and estimation of parameters in the shape of radiation domains in photons dosimetry (Q2771399) (← links)
- Non-Zero Sum Games for Reactive Synthesis (Q2798706) (← links)
- Mean-Payoff Games with Partial-Observation (Q3447703) (← links)
- Looking at Mean-Payoff Through Foggy Windows (Q3460583) (← links)
- (Q4636592) (← links)
- (Q5002806) (← links)
- Learning-Based Mean-Payoff Optimization in an Unknown MDP under Omega-Regular Constraints (Q5009420) (← links)
- (Q5089305) (← links)
- On the Complexity of Value Iteration (Q5091264) (← links)
- (Q5144642) (← links)
- (Q5275375) (← links)
- Minimizing Regret in Discounted-Sum Games (Q5278417) (← links)
- Reactive Synthesis Without Regret (Q5357698) (← links)
- Weak Cost Register Automata are Still Powerful (Q5859644) (← links)
- On the Complexity of Reachability in Parametric Markov Decision Processes (Q5875375) (← links)
- Continuous One-counter Automata (Q5875944) (← links)
- Validating streaming JSON documents with learned VPAs (Q6535358) (← links)
- Learning realtime one-counter automata (Q6535566) (← links)
- Automata with timers (Q6536426) (← links)
- A framework for the competitive analysis of model predictive controllers (Q6623022) (← links)
- The geometry of reachability in continuous vector addition systems with states (Q6647635) (← links)
- Parikh one-counter automata (Q6647658) (← links)
