Sciweavers

80 search results - page 16 / 16
» A tight lower bound for job scheduling with cancellation
Sort
View
APPROX
2006
Springer
89views Algorithms» more  APPROX 2006»
13 years 9 months ago
Online Algorithms to Minimize Resource Reallocations and Network Communication
Abstract. In this paper, we consider two new online optimization problems (each with several variants), present similar online algorithms for both, and show that one reduces to the...
Sashka Davis, Jeff Edmonds, Russell Impagliazzo
CORR
2010
Springer
176views Education» more  CORR 2010»
13 years 5 months ago
Sequential item pricing for unlimited supply
We investigate the extent to which price updates can increase the revenue of a seller with little prior information on demand. We study prior-free revenue maximization for a selle...
Maria-Florina Balcan, Florin Constantin
ISCA
2003
IEEE
169views Hardware» more  ISCA 2003»
13 years 10 months ago
Virtual Simple Architecture (VISA): Exceeding the Complexity Limit in Safe Real-Time Systems
Meeting deadlines is a key requirement in safe realtime systems. Worst-case execution times (WCET) of tasks are needed for safe planning. Contemporary worst-case timing analysis t...
Aravindh Anantaraman, Kiran Seth, Kaustubh Patil, ...
DSD
2009
IEEE
144views Hardware» more  DSD 2009»
14 years 23 hour ago
Composable Resource Sharing Based on Latency-Rate Servers
Abstract—Verification of application requirements is becoming a bottleneck in system-on-chip design, as the number of applications grows. Traditionally, the verification comple...
Benny Akesson, Andreas Hansson, Kees Goossens
WSNA
2003
ACM
13 years 10 months ago
Analysis on the redundancy of wireless sensor networks
Wireless sensor networks consist of a large number of tiny sensors that have only limited energy supply. One of the major challenges in constructing such networks is to maintain l...
Yong Gao, Kui Wu, Fulu Li