Sciweavers

908 search results - page 95 / 182
» Heuristic Methods for Solving Job-Shop Scheduling Problems
Sort
View
WEA
2010
Springer
250views Algorithms» more  WEA 2010»
15 years 11 months ago
Randomized Rounding for Routing and Covering Problems: Experiments and Improvements
We investigate how the recently developed different approaches to generate randomized roundings satisfying disjoint cardinality constraints behave when used in two classical algori...
Benjamin Doerr, Marvin Künnemann, Magnus Wahl...
COR
2010
155views more  COR 2010»
15 years 6 months ago
A memetic algorithm for the multi-compartment vehicle routing problem with stochastic demands
The Multi-Compartment Vehicle Routing Problem (MC-VRP) consists of designing transportation routes to satisfy the demands of a set of costumers for several products that because o...
Jorge E. Mendoza, Bruno Castanier, Christelle Gu&e...
GECCO
2007
Springer
171views Optimization» more  GECCO 2007»
16 years 10 days ago
Concept-based multi-objective problems and their solution by EC
Recent studies on the support of engineers during conceptual design resulted in a non-traditional type of Multi-Objective Problems (MOPs), namely concept-based ones. In concept-ba...
Amiram Moshaiov, Gideon Avigad
ICCAD
1999
IEEE
153views Hardware» more  ICCAD 1999»
15 years 10 months ago
Cycle time and slack optimization for VLSI-chips
We consider the problem of finding an optimal clock schedule, i.e. optimal arrival times for clock signals at latches of a VLSI chip. We describe a general model which includes al...
Christoph Albrecht, Bernhard Korte, Jürgen Sc...
ATAL
2007
Springer
16 years 11 days ago
Automatic feature extraction for autonomous general game playing agents
The General Game Playing (GGP) problem is concerned with developing systems capable of playing many different games, even games the system has never encountered before. Successful...
David M. Kaiser