Sciweavers

505 search results - page 91 / 101
» On the Minimality and Decomposability of Constraint Networks
Sort
View
AIPS
2009
14 years 10 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...
101
Voted
OSN
2007
185views more  OSN 2007»
14 years 9 months ago
Comparison of ILP formulations for the RWA problem
— We present a review of the various integer linear programming (ILP) formulations that have been proposed for the routing and wavelength assignment problem in WDM optical networ...
Brigitte Jaumard, Christophe Meyer, B. Thiongane
TASE
2012
IEEE
13 years 5 months ago
Discrete-Event Coordination Design for Distributed Agents
— This paper presents new results on the formal design of distributed coordinating agents in a discrete-event framework. In this framework, agents are modeled to be individually ...
Manh Tung Pham, Kiam Tian Seow
106
Voted
ICDCSW
2009
IEEE
15 years 4 months ago
Embedded Virtual Machines for Robust Wireless Control Systems
Embedded wireless networks have largely focused on openloop sensing and monitoring. To address actuation in closedloop wireless control systems there is a strong need to re-think ...
Rahul Mangharam, Miroslav Pajic
IJES
2006
110views more  IJES 2006»
14 years 9 months ago
Partitioning bin-packing algorithms for distributed real-time systems
Embedded real-time systems must satisfy not only logical functional requirements but also para-functional properties such as timeliness, Quality of Service (QoS) and reliability. W...
Dionisio de Niz, Raj Rajkumar