2714 search results - page 228 / 543 » Approximation Schemes for Scheduling |
148
click to vote
FOCS
2004
IEEE
15 years 8 months ago
2004
IEEE
Edit distance has been extensively studied for the past several years. Nevertheless, no linear-time algorithm is known to compute the edit distance between two strings, or even to...
125
click to vote
ICRA
2008
IEEE
15 years 11 months ago
2008
IEEE
Abstract— We propose a new approximate algorithm, LAJIV (Lookahead J-MDP Information Value), to solve Oracular Partially Observable Markov Decision Problems (OPOMDPs), a special ...
160
Voted
ESA
2007
Springer
15 years 10 months ago
2007
Springer
We study the partial capacitated vertex cover problem (pcvc) in which the input consists of a graph G and a covering requirement L. Each edge e in G is associated with a demand (o...
143
Voted
FOCS
2006
IEEE
15 years 10 months ago
2006
IEEE
We advance significantly beyond the recent progress on the algorithmic complexity of Nash equilibria by solving two major open problems in the approximation of Nash equilibria an...
130
Voted
HPDC
2006
IEEE
15 years 10 months ago
2006
IEEE
Trace-driven simulation is an important technique used in the evaluation of computer architecture innovations. However using it for studying parallel computers and applications is...