3360 search results - page 308 / 672 » An Optimal Distributed Edge-Biconnectivity Algorithm |
180
click to vote
CP
1998
Springer
15 years 11 months ago
1998
Springer
The constraint paradigm provides powerful concepts to represent and solve different kinds of planning problems, e. g. factory scheduling. Factory scheduling is a demanding optimiz...
176
click to vote
CP
2006
Springer
15 years 10 months ago
2006
Springer
Abstract. Machine learning can be utilized to build models that predict the runtime of search algorithms for hard combinatorial problems. Such empirical hardness models have previo...
160
Voted
ALGORITHMICA
2002
15 years 6 months ago
2002
We consider the following one- and two-dimensional bucketing problems: Given a set S of n points in R1 or R2 and a positive integer b, distribute the points of S into b equal-size ...
181
click to vote
APPROX
2005
Springer
16 years 8 days ago
2005
Springer
A large class of stochastic optimization problems can be modeled as minimizing an objective function f that depends on a choice of a vector x ∈ X, as well as on a random external...
168
click to vote
ICMCS
2006
IEEE
16 years 23 days ago
2006
IEEE
Block-matching motion estimation plays an important role in video coding and faster, more robust and more effective search algorithms are needed. Recently, a great number of fast ...