1984 search results - page 178 / 397 » The colourful feasibility problem |
197
click to vote
GECCO
2008
Springer
15 years 7 months ago
2008
Springer
Probabilistic model building methods can render difficult problems feasible by identifying and exploiting dependencies. They build a probabilistic model from the statistical prope...
186
click to vote
EOR
2008
15 years 6 months ago
2008
This paper is a study of the car sequencing problem, when feature spacing constraints are soft and colors of vehicles are taken into account. Both pseudo-polynomial algorithms and ...
181
click to vote
CONSTRAINTS
2006
15 years 6 months ago
2006
Abstract. Constraint Programming (CP) offers a rich modeling language of constraints embedding efficient algorithms to handle complex and heterogeneous combinatorial problems. To s...
190
click to vote
MAGS
2007
15 years 6 months ago
2007
A protein is identified by a finite sequence of amino acids, each of them chosen from a set of 20 elements. The Protein Structure Prediction Problem is the problem of predicting...
170
click to vote
MANSCI
2007
15 years 6 months ago
2007
In this paper, a market-based decomposition method for decomposable linear systems is developed. The solution process iterates between a master problem that solves the market-matc...