Sciweavers

370 search results - page 31 / 74
» Bounded modified realizability
Sort
View
AAAI
2010
13 years 8 months ago
Algorithms for Finding Approximate Formations in Games
Many computational problems in game theory, such as finding Nash equilibria, are algorithmically hard to solve. This limitation forces analysts to limit attention to restricted su...
Patrick R. Jordan, Michael P. Wellman
PODC
2010
ACM
13 years 8 months ago
Brief announcement: swarming secrets
We present information-theoretically secure schemes for sharing and modifying secrets among a dynamic swarm of computing devices. The schemes support an unlimited number of change...
Shlomi Dolev, Juan A. Garay, Niv Gilboa, Vladimir ...
EOR
2007
87views more  EOR 2007»
13 years 8 months ago
The TV-Break Packing Problem
Instead of selling advertisement spots one by one, some French satellite channels decided in 2002 to modify their commercial offer in order to sell packages of spots. These new g...
Thierry Benoist, Eric Bourreau, Benoît Rotte...
AUTOMATICA
2004
64views more  AUTOMATICA 2004»
13 years 8 months ago
Linear LMI-based external anti-windup augmentation for stable linear systems
We study linear anti-windup augmentation for linear control systems with saturated linear plants in the special case when the anti-windup compensator can only modify the input and...
Gene Grimm, Andrew R. Teel, Luca Zaccarian
ICRA
2010
IEEE
122views Robotics» more  ICRA 2010»
13 years 7 months ago
Constrained convergent gait regulation for a climbing robot
— The priorities of a climbing legged robot are to maintain a grasp on its climbing surface and to climb efficiently against the force of gravity. These priorities profoundly co...
Salomon Trujillo, Barrett Heyneman, Mark R. Cutkos...