133 search results - page 13 / 27 » Approximation bounds for Black Hole Search problems |
103
click to vote
STOC
2006
ACM
16 years 1 hour ago
2006
ACM
Range searching is among the most fundamental problems in computational geometry. An n-element point set in Rd is given along with an assignment of weights to these points from so...
HEURISTICS
2008
14 years 10 months ago
2008
Since their beginning in constraint programming, set solvers have been applied to a wide range of combinatorial search problems, such as bin-packing, set partitioning, circuit desi...
133
click to vote
APPROX
2008
Springer
15 years 1 months ago
2008
Springer
Abstract. We give a (ln n + 1)-approximation for the decision tree (DT) problem. An instance of DT is a set of m binary tests T = (T1, . . . , Tm) and a set of n items X = (X1, . ....
100
click to vote
ALGORITHMICA
2010
14 years 11 months ago
2010
In this paper, we give a lower bound of (n(d-1)/2 ) on the quantum query complexity for finding a fixed point of a discrete Brouwer function over grid [1 : n]d . Our bound is near...
CDC
2008
IEEE
15 years 6 months ago
2008
IEEE
Abstract— We present a systematic method for model reduction of a class of input-quantized systems in the max-plus algebra. We consider a generalization of the flow shop with ï¬...