1331 search results - page 185 / 267 » Complexity bounds for zero-test algorithms |
120
click to vote
GECCO
2006
Springer
15 years 6 months ago
2006
Springer
This paper describes and analyzes sporadic model building, which can be used to enhance the efficiency of the hierarchical Bayesian optimization algorithm (hBOA) and other advance...
128
click to vote
STOC
2004
ACM
16 years 3 months ago
2004
ACM
We present a probabilistic analysis for a large class of combinatorial optimization problems containing, e.g., all binary optimization problems defined by linear constraints and a...
174
click to vote
ICALP
2001
Springer
15 years 7 months ago
2001
Springer
We present a probabilistic algorithm that, given a connected graph G (represented by adjacency lists) of average degree d, with edge weights in the set {1, . . . , w}, and given a ...
115
click to vote
STOC
2001
ACM
16 years 3 months ago
2001
ACM
Optimal program slicing determines for a statement S in a program whether or not S affects a specified set of statements, given that all conditionals in are interpreted as non-d...
114
click to vote
STACS
2007
Springer
15 years 9 months ago
2007
Springer
A coloring of a graph is convex if it induces a partition of the vertices into connected subgraphs. Besides being an interesting property from a theoretical point of view, tests f...