Sciweavers

572 search results - page 13 / 115
» Exponential-Time Approximation of Hard Problems
Sort
View
IJCAI
2001
14 years 11 months ago
Backbones in Optimization and Approximation
We study the impact of backbones in optimization and approximation problems. We show that some optimization problems like graph coloring resemble decision problems, with problem h...
John K. Slaney, Toby Walsh
FOCS
2004
IEEE
15 years 1 months ago
The Hardness of Metric Labeling
The Metric Labeling problem is an elegant and powerful mathematical model capturing a wide range of classification problems. The input to the problem consists of a set of labels a...
Julia Chuzhoy, Joseph Naor
UAI
2000
14 years 11 months ago
The Complexity of Decentralized Control of Markov Decision Processes
We consider decentralized control of Markov decision processes and give complexity bounds on the worst-case running time for algorithms that find optimal solutions. Generalization...
Daniel S. Bernstein, Shlomo Zilberstein, Neil Imme...
DATE
2006
IEEE
110views Hardware» more  DATE 2006»
15 years 4 months ago
Multiprocessor synthesis for periodic hard real-time tasks under a given energy constraint
The energy-aware design for electronic systems has been an important issue in hardware and/or software implementations, especially for embedded systems. This paper targets a synth...
Heng-Ruey Hsu, Jian-Jia Chen, Tei-Wei Kuo
APPROX
2010
Springer
154views Algorithms» more  APPROX 2010»
14 years 11 months ago
The Checkpoint Problem
In this paper, we consider the checkpoint problem in which given an undirected graph G, a set of sourcedestinations {(s1, t1), (s1, t1), . . . , (sk, tk)} and a set of fixed paths...
MohammadTaghi Hajiaghayi, Rohit Khandekar, Guy Kor...