526 search results - page 10 / 106 » Generalized benchmark generation for dynamic combinatorial p... |
TASE
2008
IEEE
14 years 9 months ago
2008
IEEE
This paper addresses the general single-machine earliness-tardiness problem with distinct release dates, due dates, and unit costs. The aim of this research is to obtain an exact n...
127
click to vote
ISPD
2012
ACM
13 years 5 months ago
2012
ACM
Gate sizing in VLSI design is a widely-used method for power or area recovery subject to timing constraints. Several previous works have proposed gate sizing heuristics for power ...
90
Voted
GECCO
2005
Springer
15 years 3 months ago
2005
Springer
Genetic Algorithms (GAs) can efficiently produce high quality results for hard combinatorial real world problems such as the Vehicle Routing Problem (VRP). Genetic Vehicle Represe...
EVOW
2005
Springer
15 years 3 months ago
2005
Springer
This paper presents the Scatter Search Particle Filter (SSPF) algorithm and its application to the Dynamic Travelling Salesman Problem (DTSP). SSPF combines sequential estimation a...
100
Voted
GECCO
2005
Springer
15 years 3 months ago
2005
Springer
Many non-cooperative settings that could potentially be studied using game theory are characterized by having very large strategy spaces and payoffs that are costly to compute. Be...