192 search results - page 17 / 39 » On-Demand Bound Computation for Best-First Constraint Optimi... |
93
Voted
DAC
1997
ACM
15 years 1 months ago
1997
ACM
We present a system-level approach for power optimization under a set of user specified costs and timing constraints of hard real-time designs. The approach optimizes all three d...
EVOW
2010
Springer
15 years 1 months ago
2010
Springer
Instances of constraint satisfaction problems can be solved efficiently if they are representable as a tree decomposition of small width. Unfortunately, the task of finding a deco...
EDBT
2008
ACM
15 years 9 months ago
2008
ACM
Abstract. Monitoring aggregates on IP traffic data streams is a compelling application for data stream management systems. Often, such streaming aggregation queries involve joining...
ICALP
2004
Springer
15 years 3 months ago
2004
Springer
Consider the classical online scheduling problem where jobs that arrive one by one are assigned to identical parallel machines with the objective of minimizing the makespan. We gen...
TMC
2010
14 years 8 months ago
2010
—This paper proposes a framework to maximize the lifetime the wireless sensor network (WSN) by using a mobile sink when the underlying applications tolerate delayed information d...