Sciweavers

3563 search results - page 685 / 713
» Scheduling Algorithms for Procrastinators
Sort
View
ESA
2008
Springer
99views Algorithms» more  ESA 2008»
13 years 9 months ago
Robust Kinetic Convex Hulls in 3D
Abstract. Kinetic data structures provide a framework for computing combinatorial properties of continuously moving objects. Although kinetic data structures for many problems have...
Umut A. Acar, Guy E. Blelloch, Kanat Tangwongsan, ...
AAAI
1994
13 years 9 months ago
Solution Reuse in Dynamic Constraint Satisfaction Problems
Many AI problems can be modeled as constraint satisfaction problems (CSP), but many of them are actually dynamic: the set of constraints to consider evolves because of the environ...
Gérard Verfaillie, Thomas Schiex
AIPS
2010
13 years 8 months ago
Incrementally Solving STNs by Enforcing Partial Path Consistency
Efficient management and propagation of temporal constraints is important for temporal planning as well as for scheduling. During plan development, new events and temporal constra...
Léon Planken, Mathijs de Weerdt, Neil Yorke...
EMSOFT
2008
Springer
13 years 8 months ago
On the interplay of dynamic voltage scaling and dynamic power management in real-time embedded applications
Dynamic Voltage Scaling (DVS) and Dynamic Power Management (DPM) are two popular techniques commonly employed to save energy in real-time embedded systems. DVS policies aim at red...
Vinay Devadas, Hakan Aydin
CN
2004
109views more  CN 2004»
13 years 7 months ago
Architectures and protocols for mobile computing applications: a reconfigurable approach
This work deals with reconfigurable control functions and protocols for supporting mobile computing applications in heterogeneous wireless systems like cellular networks and WLANs...
Carla-Fabiana Chiasserini, Francesca Cuomo, Leonar...