17967 search results - page 3250 / 3594 » Functional timing optimization |
157
click to vote
CP
2005
Springer
15 years 10 months ago
2005
Springer
Abstract. Most CSP algorithms are based on refinements and extensions of backtracking, and employ one of two simple “branching schemes”: 2-way branching or d-way branching, fo...
127
click to vote
GECCO
2005
Springer
15 years 10 months ago
2005
Springer
Edge Assembly Crossover (EAX) is by far the most successful crossover operator in solving the traveling salesman problem (TSP) with Genetic Algorithms (GAs). Various improvements ...
140
click to vote
GECCO
2005
Springer
15 years 10 months ago
2005
Springer
Assume a coevolutionary algorithm capable of storing and utilizing all phenotypes discovered during its operation, for as long as it operates on a problem; that is, assume an algo...
143
Voted
ICALP
2005
Springer
15 years 10 months ago
2005
Springer
Abstract. This paper considers the Steiner tree problem in the model of twostage stochastic optimization with recourse. This model, the focus of much recent research [1–4], tries...
167
click to vote
VLDB
2005
ACM
15 years 10 months ago
2005
ACM
Developing cost models for query optimization is significantly harder for XML queries than for traditional relational queries. The reason is that XML query operators are much mor...