Sciweavers

517 search results - page 51 / 104
» Approximation Algorithms for Scheduling with Reservations
Sort
View
SODA
2008
ACM
101views Algorithms» more  SODA 2008»
14 years 11 months ago
Adaptive local ratio
Local ratio is a well-known paradigm for designing approximation algorithms for combinatorial optimization problems. At a very high level, a local-ratio algorithm first decomposes ...
Julián Mestre
RTSS
2005
IEEE
15 years 3 months ago
Voltage Scaling Scheduling for Periodic Real-Time Tasks in Reward Maximization
— This paper is interested in reward maximization of periodic real-time tasks under a given energy constraint, where the reward received depends on how much computation a task ru...
Jian-Jia Chen, Tei-Wei Kuo
EDBT
2008
ACM
135views Database» more  EDBT 2008»
15 years 10 months ago
Minimizing latency and memory in DSMS: a unified approach to quasi-optimal scheduling
Data Stream Management Systems (DSMSs) must support optimized execution scheduling of multiple continuous queries on massive, and frequently bursty, data streams. Previous approac...
Yijian Bai, Carlo Zaniolo
ACCV
2007
Springer
15 years 4 months ago
Task Scheduling in Large Camera Networks
Camera networks are increasingly being deployed for security. In most of these camera networks, video sequences are captured, transmitted and archived continuously from all cameras...
Ser-Nam Lim, Larry S. Davis, Anurag Mittal
ISAAC
2000
Springer
178views Algorithms» more  ISAAC 2000»
15 years 1 months ago
Simple Algorithms for a Weighted Interval Selection Problem
Given a set of jobs, each consisting of a number of weighted intervals on the real line, and a number m of machines, we study the problem of selecting a maximum weight subset of th...
Thomas Erlebach, Frits C. R. Spieksma