3475 search results - page 89 / 695 » Backbones in Optimization and Approximation |
144
click to vote
SIAMCOMP
1998
15 years 2 months ago
1998
Polynomial-time safe and unsafe approximations for intractable sets were introduced by Meyer and Paterson [Technical Report TM-126, Laboratory for Computer Science, MIT, Cambridge,...
100
Voted
GECCO
2004
Springer
15 years 8 months ago
2004
Springer
Abstract. We propose an analytic approach to approximate the survival probabilities of schemata under multi-point crossover and obtain its closed form. It gives a convenient way to...
107
click to vote
CP
2003
Springer
15 years 7 months ago
2003
Springer
Knapsack constraints are a key modeling structure in discrete optimization and form the core of many real-life problem formulations. Only recently, a cost-based filtering algorit...
114
Voted
AAAI
2004
15 years 4 months ago
2004
Knapsack constraints are a key modeling structure in discrete optimization and form the core of many real-life problem formulations. Only recently, a cost-based filtering algorith...
132
Voted
AUTOMATICA
2008
15 years 2 months ago
2008
For a countable-state Markov decision process we introduce an embedding which produces a finite-state Markov decision process. The finite-state embedded process has the same optim...