Sciweavers

1102 search results - page 69 / 221
» Dynamic Constraint Models for Planning and Scheduling Proble...
Sort
View
SAC
2006
ACM
14 years 3 months ago
Event-driven scheduling for dynamic workload scaling in uniprocessor embedded systems
Many embedded systems are designed to take timely reactions to the occurrences of interested scenarios. Sometimes transient overloads might be experienced due to hardware malfunct...
Li-Pin Chang
CISS
2008
IEEE
14 years 3 months ago
Appropriate control of wireless networks with flow level dynamics
Abstract— We consider the network control problem for wireless networks with flow level dynamics under the general k-hop interference model. In particular, we investigate the co...
Long Le, Ravi R. Mazumdar
ROBOCUP
2007
Springer
99views Robotics» more  ROBOCUP 2007»
14 years 3 months ago
Instance-Based Action Models for Fast Action Planning
Abstract. Two main challenges of robot action planning in real domains are uncertain action effects and dynamic environments. In this paper, an instance-based action model is lear...
Mazda Ahmadi, Peter Stone
CAV
2009
Springer
134views Hardware» more  CAV 2009»
14 years 9 months ago
Predecessor Sets of Dynamic Pushdown Networks with Tree-Regular Constraints
Abstract. Dynamic Pushdown Networks (DPNs) are a model for parallel programs with (recursive) procedures and process creation. The goal of this paper is to develop generic techniqu...
Alexander Wenner, Markus Müller-Olm, Peter La...
APPROX
2006
Springer
124views Algorithms» more  APPROX 2006»
14 years 24 days ago
Combinatorial Algorithms for Data Migration to Minimize Average Completion Time
The data migration problem is to compute an efficient plan for moving data stored on devices in a network from one configuration to another. It is modeled by a transfer graph, wher...
Rajiv Gandhi, Julián Mestre