3874 search results - page 176 / 775 » Approximation Algorithms for k-hurdle Problems |
128
click to vote
SIGMOD
2010
ACM
15 years 6 months ago
2010
ACM
We consider the problem of computing all-pair correlations in a warehouse containing a large number (e.g., tens of thousands) of time-series (or, signals). The problem arises in a...
109
click to vote
EOR
2010
15 years 2 months ago
2010
This study investigates an optimization-based heuristic for the Robotic Cell Problem. This problem arises in automated cells and is a complex ow shop problem with a single transpo...
103
click to vote
ICCAD
1994
IEEE
15 years 6 months ago
1994
IEEE
We study a new placement problem: the reproducing placement problem (RPP). In each phase a module (or gate) is decomposed into two (or more) simpler modules. The goal is nd a \go...
AAAI
1998
15 years 3 months ago
1998
The typical difficulty of various NP-hard problems varies with simple parameters describing their structure. This behavior is largely independent of the search algorithm, but depe...
124
click to vote
WADS
2005
Springer
15 years 7 months ago
2005
Springer
An instance of the multi-radius cover problem consists of a graph G = (V, E) with edge lengths l : E → R+ . Each vertex u ∈ V represents a transmission station for which a tra...