Sciweavers

315 search results - page 60 / 63
» A new heuristic to solve the one-warehouse N-retailer proble...
Sort
View
4OR
2010
148views more  4OR 2010»
13 years 7 months ago
Point-to-point shortest paths on dynamic time-dependent road networks
This a summary of the author's PhD thesis supervised by Leo Liberti, Philippe Baptiste and Daniel Krob and defended on 18 June 2009 at Ecole Polytechnique, Palaiseau, France. ...
Giacomo Nannicini
GECCO
2007
Springer
167views Optimization» more  GECCO 2007»
14 years 2 months ago
An improved restricted growth function genetic algorithm for the consensus clustering of retinal nerve fibre data
This paper describes an extension to the Restricted Growth Function grouping Genetic Algorithm applied to the Consensus Clustering of a retinal nerve fibre layer data-set. Consens...
Stephen Swift, Allan Tucker, Jason Crampton, David...
TON
2008
125views more  TON 2008»
13 years 8 months ago
Two techniques for fast computation of constrained shortest paths
Abstract-- Computing constrained shortest paths is fundamental to some important network functions such as QoS routing, which is to find the cheapest path that satisfies certain co...
Shigang Chen, Meongchul Song, Sartaj Sahni
ICS
2007
Tsinghua U.
14 years 2 months ago
GridRod: a dynamic runtime scheduler for grid workflows
Grid Workflows are emerging as practical programming models for solving large e-scientific problems on the Grid. However, it is typically assumed that the workflow components eith...
Shahaan Ayyub, David Abramson
GECCO
2009
Springer
193views Optimization» more  GECCO 2009»
14 years 1 months ago
Optimization of dynamic memory managers for embedded systems using grammatical evolution
New portable consumer embedded devices must execute multimedia applications (e.g., 3D games, video players and signal processing software, etc.) that demand extensive memory acces...
José L. Risco-Martín, David Atienza,...