1603 search results - page 84 / 321 » Universal Confidence Sets for Solutions of Optimization Prob... |
164
click to vote
BMCBI
2010
15 years 6 months ago
2010
Background: The protein folding problem remains one of the most challenging open problems in computational biology. Simplified models in terms of lattice structure and energy func...
217
click to vote
EVOW
2007
Springer
16 years 14 days ago
2007
Springer
Abstract. The Traveling Salesman Problem (TSP) is a well-known NPhard combinatorial optimization problem, for which a large variety of evolutionary algorithms are known. However, t...
162
click to vote
ATAL
2006
Springer
15 years 10 months ago
2006
Springer
We model social choice problems in which self interested agents with private utility functions have to agree on values for a set of variables subject to side constraints. The goal...
143
click to vote
COR
2007
15 years 6 months ago
2007
The paper discusses the definition and solution of a bi-objective routing problem, namely the bi-objective covering tour problem. The bi-objective CTP is a generalization of the ...
160
click to vote
HEURISTICS
2010
15 years 1 months ago
2010
The challenge in shift scheduling lies in the construction of a set of work shifts, which are subject to specific regulations, in order to cover fluctuating staff demands. This pro...