526 search results - page 14 / 106 » Generalized benchmark generation for dynamic combinatorial p... |
169
click to vote
CPAIOR
2008
Springer
15 years 7 months ago
2008
Springer
Theoretical models for the evaluation of quickly improving search strategies, like limited discrepancy search, are based on specific assumptions regarding the probability that a va...
147
click to vote
GECCO
2005
Springer
15 years 11 months ago
2005
Springer
This paper proposes an incremental approach for building solutions using evolutionary computation. It presents a simple evolutionary model called a Transition model in which parti...
167
click to vote
GECCO
2009
Springer
15 years 10 months ago
2009
Springer
The Vehicle Routing Problem can be seen as a fusion of two well known combinatorial problems, the Travelling Salesman Problem and Bin Packing Problem. It has several variants, the...
188
click to vote
GECCO
2007
Springer
15 years 12 months ago
2007
Springer
An Estimation of Distribution Algorithm (EDA) is proposed to approach the Hybrid Flow Shop with Sequence Dependent Setup Times and Uniform Machines in parallel (HFSSDST-UM) proble...
157
click to vote
TIP
2010
15 years 14 days ago
2010
We propose the concept of a generalized assorted pixel (GAP) camera, which enables the user to capture a single image of a scene and, after the fact, control the tradeoff between s...