Sciweavers

589 search results - page 42 / 118
» Introducing Dynamic Constraints in B
Sort
View
AIPS
2009
13 years 9 months ago
Flexible Execution of Plans with Choice
Dynamic plan execution strategies allow an autonomous agent to respond to uncertainties while improving robustness and reducing the need for an overly conservative plan. Executive...
Patrick R. Conrad, Julie A. Shah, Brian C. William...
B
2007
Springer
14 years 23 hour ago
Security Policy Enforcement Through Refinement Process
Abstract. In the area of networks, a common method to enforce a security policy expressed in a high-level language is based on an ad-hoc and manual rewriting process [24]. We argue...
Nicolas Stouls, Marie-Laure Potet
ECBS
2008
IEEE
86views Hardware» more  ECBS 2008»
14 years 2 months ago
A Formal Model for Network-Wide Security Analysis
Network designers perform challenging tasks with so many configuration options that it is often hard or even impossible for a human to predict all potentially dangerous situation...
Petr Matousek, Jaroslav Ráb, Ondrej Rysavy,...
MSV
2004
13 years 9 months ago
S(b)-Trees: An Optimal Balancing of Variable Length Keys
The paper studies the problem of maintaining external dynamic dictionaries with variable length keys. We introduce a new type of balanced trees, called S(b)-trees, which generaliz...
Konstantin V. Shvachko
CDC
2009
IEEE
166views Control Systems» more  CDC 2009»
13 years 11 months ago
Stable inversion-based robust tracking control in DC-DC nonlinear switched converters
— This article studies the robust tracking control problem in nonminimum phase DC-DC nonlinear switched power converters. The proposed procedure introduces a stable inversion-bas...
Josep M. Olm, Xavier Ros, Yuri B. Shtessel