Sciweavers

2446 search results - page 205 / 490
» Choiceless Polynomial Time
Sort
View
ICCAD
2006
IEEE
152views Hardware» more  ICCAD 2006»
14 years 5 months ago
System-wide energy minimization for real-time tasks: lower bound and approximation
We present a dynamic voltage scaling (DVS) technique that minimizes system-wide energy consumption for both periodic and sporadic tasks. It is known that a system consists of proc...
Xiliang Zhong, Cheng-Zhong Xu
DATE
2009
IEEE
133views Hardware» more  DATE 2009»
14 years 3 months ago
Energy efficient multiprocessor task scheduling under input-dependent variation
— In this paper, we propose a novel, energy aware scheduling algorithm for applications running on DVS-enabled multiprocessor systems, which exploits variation in execution times...
Jason Cong, Karthik Gururaj
FOCS
2009
IEEE
14 years 3 months ago
On the Power of Randomization in Algorithmic Mechanism Design
In many settings the power of truthful mechanisms is severely bounded. In this paper we use randomization to overcome this problem. In particular, we construct an FPTAS for multi-...
Shahar Dobzinski, Shaddin Dughmi
ICRA
2009
IEEE
141views Robotics» more  ICRA 2009»
14 years 2 months ago
Detecting repeated motion patterns via Dynamic Programming using motion density
— In this paper, we propose a method that detects repeated motion patterns in a long motion sequence efficiently. Repeated motion patterns are the structured information that ca...
Koichi Ogawara, Yasufumi Tanabe, Ryo Kurazume, Tsu...
APPROX
2009
Springer
156views Algorithms» more  APPROX 2009»
14 years 2 months ago
An Analysis of Random-Walk Cuckoo Hashing
In this paper, we provide a polylogarithmic bound that holds with high probability on the insertion time for cuckoo hashing under the random-walk insertion method. Cuckoo hashing ...
Alan M. Frieze, Páll Melsted, Michael Mitze...