Sciweavers

352 search results - page 57 / 71
» On the optimal reachability problem of weighted timed automa...
Sort
View
SIAMCOMP
2010
104views more  SIAMCOMP 2010»
13 years 2 months ago
Server Scheduling to Balance Priorities, Fairness, and Average Quality of Service
Often server systems do not implement the best known algorithms for optimizing average Quality of Service (QoS) out of concern of that these algorithms may be insufficiently fair ...
Nikhil Bansal, Kirk Pruhs
AUTOMATICA
2007
98views more  AUTOMATICA 2007»
13 years 7 months ago
LMI-based sensor fault diagnosis for nonlinear Lipschitz systems
The problem of sensor fault diagnosis in the class of nonlinear Lipschitz systems is considered. A dynamic observer structure is used with the objective to make the residual conve...
A. M. Pertew, H. J. Marquez, Q. Zhao
APPROX
2008
Springer
127views Algorithms» more  APPROX 2008»
13 years 9 months ago
Approximating Single Machine Scheduling with Scenarios
In the field of robust optimization, the goal is to provide solutions to combinatorial problems that hedge against variations of the numerical parameters. This constitutes an effor...
Monaldo Mastrolilli, Nikolaus Mutsanas, Ola Svenss...
WDAG
2005
Springer
90views Algorithms» more  WDAG 2005»
14 years 1 months ago
Proving Atomicity: An Assertional Approach
Atomicity (or linearizability) is a commonly used consistency criterion for distributed services and objects. Although atomic object implementations are abundant, proving that algo...
Gregory Chockler, Nancy A. Lynch, Sayan Mitra, Jos...
GECCO
1999
Springer
133views Optimization» more  GECCO 1999»
13 years 11 months ago
Evolution of Goal-Directed Behavior from Limited Information in a Complex Environment
In this paper, we apply an evolutionary algorithm to learning behavior on a novel, interesting task to explore the general issue of learning e ective behaviors in a complex enviro...
Matthew R. Glickman, Katia P. Sycara