3874 search results - page 179 / 775 » Approximation Algorithms for k-hurdle Problems |
141
click to vote
JCP
2007
15 years 1 months ago
2007
Abstract— We describe a general method to transform a non-Markovian sequential decision problem into a supervised learning problem using a K-bestpaths algorithm. We consider an a...
DAC
2009
ACM
16 years 2 months ago
2009
ACM
Abstract--To reduce chip-scale topography variation in Chemical Mechanical Polishing (CMP) process, dummy fill is widely used to improve the layout density uniformity. Previous res...
112
click to vote
ICDAR
2009
IEEE
14 years 11 months ago
2009
IEEE
Approximate text search is a basic technique to handle recognized text that contains recognition errors. This paper proposes an approximate string search for recognized text using...
159
click to vote
SWAT
2010
Springer
15 years 9 days ago
2010
Springer
We study the problem of minimizing the diameter of a graph by adding k shortcut edges, for speeding up communication in an existing network design. We develop constant-factor appro...
105
click to vote
FOCS
2003
IEEE
15 years 7 months ago
2003
IEEE
We give improved approximation algorithms for a variety of latency minimization problems. In particular, we give a 3.591 -approximation to the minimum latency problem, improving o...