Sciweavers

2974 search results - page 371 / 595
» Model-Driven Constraint Programming
Sort
View
CP
2009
Springer
16 years 1 months ago
Why Cumulative Decomposition Is Not as Bad as It Sounds
Abstract. The global cumulative constraint was proposed for modelling cumulative resources in scheduling problems for finite domain (FD) propagation. Since that time a great deal ...
Andreas Schutt, Thibaut Feydy, Peter J. Stuckey, M...
DATE
2008
IEEE
117views Hardware» more  DATE 2008»
16 years 1 months ago
A Scalable Algorithmic Framework for Row-Based Power-Gating
Leakage power is a serious concern in nanometer CMOS technologies. In this paper we focus on leakage reduction through automatic insertion of sleep transistors for power gating in...
Ashoka Visweswara Sathanur, Antonio Pullini, Luca ...
ICC
2007
IEEE
16 years 26 days ago
Wireless Packet Scheduling With Soft Deadlines
— We address the problem of scheduling multiple traffic streams associated with target profiles on a shared wireless link, arising in real-time applications with soft/flexible...
Aditya Dua, Nicholas Bambos
CPAIOR
2007
Springer
16 years 22 days ago
A Position-Based Propagator for the Open-Shop Problem
The Open-Shop Problem is a hard problem that can be solved using Constraint Programming or Operation Research methods. Existing techniques are efficient at reducing the search tree...
Jean-Noël Monette, Yves Deville, Pierre Dupon...
ICCS
2007
Springer
16 years 21 days ago
Impact of QoS on Replica Placement in Tree Networks
This paper discusses and compares several policies to place replicas in tree networks, subject to server capacity and QoS constraints. The client requests are known beforehand, wh...
Anne Benoit, Veronika Rehn, Yves Robert