Sciweavers

CLIMA
2011
12 years 7 months ago
Verifying Team Formation Protocols with Probabilistic Model Checking
Multi-agent systems are an increasingly important software paradigm and in many of its applications agents cooperate to achieve a particular goal. This requires the design of effi...
Taolue Chen, Marta Z. Kwiatkowska, David Parker, A...
ICDE
2011
IEEE
262views Database» more  ICDE 2011»
12 years 10 months ago
Memory-constrained aggregate computation over data streams
— In this paper, we study the problem of efficiently computing multiple aggregation queries over a data stream. In order to share computation, prior proposals have suggested ins...
K. V. M. Naidu, Rajeev Rastogi, Scott Satkin, Anan...
ECCC
2011
190views ECommerce» more  ECCC 2011»
12 years 11 months ago
Optimal heuristic algorithms for the image of an injective function
The existence of optimal algorithms is not known for any decision problem in NP \ P. We consider the problem of testing the membership in the image of an injective function. We co...
Edward A. Hirsch, Dmitry Itsykson, Valeria Nikolae...
WIOPT
2011
IEEE
12 years 11 months ago
LIFO-Backpressure achieves near optimal utility-delay tradeoff
There has been considerable recent work developing a new stochastic network utility maximization framework using Backpressure algorithms, also known as MaxWeight. A key open probl...
Longbo Huang, Scott Moeller, Michael J. Neely, Bha...
STACS
1995
Springer
13 years 11 months ago
Optimal Average Case Sorting on Arrays
Abstract. We present algorithms for sorting and routing on two-dimensional mesh-connected parallel architectures that are optimal on average. If one processor has many packets then...
Manfred Kunde, Rolf Niedermeier, Klaus Reinhardt, ...
IPPS
1998
IEEE
13 years 11 months ago
Nearly Optimal Algorithms for Broadcast on d-Dimensional All-Port and Wormhole-Routed Torus
In this paper, we present nearly optimal algorithms for broadcast on a d-dimensional nn:::n torus that supports all-port communication and wormhole routing. Let Tn denote the numb...
Jyh-Jong Tsay, Wen-Tsong Wang
SWAT
2004
Springer
125views Algorithms» more  SWAT 2004»
14 years 21 days ago
The Optimal Online Algorithms for Minimizing Maximum Lateness
It is well known that the Earliest-Deadline-First (EDF) and the Least-Laxity-First (LLF) algorithms are optimal algorithms for the problem of preemptively scheduling jobs that arr...
Patchrawat Uthaisombut
DATE
2009
IEEE
129views Hardware» more  DATE 2009»
14 years 2 months ago
Energy minimization for real-time systems with non-convex and discrete operation modes
—We present an optimal methodology for dynamic voltage scheduling problem in the presence of realistic assumption such as leakage-power and intra-task overheads. Our contribution...
Foad Dabiri, Alireza Vahdatpour, Miodrag Potkonjak...