Sciweavers

388 search results - page 55 / 78
» A Mixed Closure-CSP Method to Solve Scheduling Problems
Sort
View
WWW
2002
ACM
16 years 14 days ago
Improvements in practical aspects of optimally scheduling web advertising
We addressed two issues concerning the practical aspects of optimally scheduling web advertising proposed by Langheinrich et al. [5], which scheduling maximizes the total number o...
Atsuyoshi Nakamura
GECCO
2006
Springer
152views Optimization» more  GECCO 2006»
15 years 3 months ago
A combinatorial genetic algorithm for the configuration of the 2dF/AAOmega spectrograph at the anglo-Australian observatory
To help unravel the structure of the universe, astronomers have developed systems which observe large clusters of objects at the same time. One such system is the 2-degree field s...
Steven Manos, Geraint Lewis
CPAIOR
2005
Springer
15 years 5 months ago
Group Construction for Airline Cabin Crew: Comparing Constraint Programming with Branch and Price
Producing work schedules for airline crew normally results in individually different schedules. Some airlines do however want to give the same schedule to groups of people. The con...
Jesper Hansen, Tomas Lidén
CEC
2009
IEEE
15 years 6 months ago
Dispatching rules for production scheduling: A hyper-heuristic landscape analysis
— Hyper-heuristics or “heuristics to chose heuristics” are an emergent search methodology that seeks to automate the process of selecting or combining simpler heuristics in o...
Gabriela Ochoa, José Antonio Vázquez...
COR
2007
134views more  COR 2007»
14 years 11 months ago
Portfolio selection using neural networks
In this paper we apply a heuristic method based on artificial neural networks (NN) in order to trace out the efficient frontier associated to the portfolio selection problem. We...
Alberto Fernández, Sergio Gómez