Sciweavers

27 search results - page 4 / 6
» A new robust optimization approach for scheduling under unce...
Sort
View
ECAI
1998
Springer
13 years 10 months ago
Optimal Scheduling of Dynamic Progressive Processing
Progressive processing allows a system to satisfy a set of requests under time pressure by limiting the amount of processing allocated to each task based on a predefined hierarchic...
Abdel-Illah Mouaddib, Shlomo Zilberstein
AAAI
2006
13 years 7 months ago
Compact, Convex Upper Bound Iteration for Approximate POMDP Planning
Partially observable Markov decision processes (POMDPs) are an intuitive and general way to model sequential decision making problems under uncertainty. Unfortunately, even approx...
Tao Wang, Pascal Poupart, Michael H. Bowling, Dale...
ATAL
2009
Springer
14 years 25 days ago
Computing optimal randomized resource allocations for massive security games
Predictable allocations of security resources such as police officers, canine units, or checkpoints are vulnerable to exploitation by attackers. Recent work has applied game-theo...
Christopher Kiekintveld, Manish Jain, Jason Tsai, ...
AUTOMATICA
2005
115views more  AUTOMATICA 2005»
13 years 6 months ago
Robust constrained predictive control using comparison model
This paper proposes a quadratic programming (QP) approach to robust model predictive control (MPC) for constrained linear systems having both model uncertainties and bounded distu...
Hiroaki Fukushima, Robert R. Bitmead
GECCO
2008
Springer
163views Optimization» more  GECCO 2008»
13 years 7 months ago
Embedded evolutionary multi-objective optimization for worst case robustness
In Multi-Objective Problems (MOPs) involving uncertainty, each solution might be associated with a cluster of performances in the objective space depending on the possible scenari...
Gideon Avigad, Jürgen Branke