5153 search results - page 842 / 1031 » Introduction to Randomized Algorithms |
114
click to vote
PODS
1999
ACM
15 years 7 months ago
1999
ACM
Query optimizers rely on fast, high-quality estimates of result sizes in order to select between various join plans. Selfjoin sizes of relations provide bounds on the join size of...
155
click to vote
ASIAN
2004
Springer
15 years 7 months ago
2004
Springer
This paper presents a line of research in genetic algorithms (GAs), called building-block identification. The building blocks (BBs) are common structures inferred from a set of sol...
137
click to vote
APPROX
2006
Springer
15 years 7 months ago
2006
Springer
Motivated by applications in batch scheduling of jobs in manufacturing systems and distributed computing, we study two related problems. Given is a set of jobs {J1, . . . , Jn}, w...
145
click to vote
COCO
2006
Springer
15 years 7 months ago
2006
Springer
We give an algorithm that learns any monotone Boolean function f : {-1, 1}n {-1, 1} to any constant accuracy, under the uniform distribution, in time polynomial in n and in the de...
132
click to vote
ESA
2008
Springer
15 years 5 months ago
2008
Springer
Abstract. We study two-stage robust variants of combinatorial optimization problems like Steiner tree, Steiner forest, and uncapacitated facility location. The robust optimization ...