Sciweavers

315 search results - page 43 / 63
» A new heuristic to solve the one-warehouse N-retailer proble...
Sort
View
GECCO
2006
Springer
162views Optimization» more  GECCO 2006»
14 years 9 days ago
Indirect co-evolution for understanding belief in an incomplete information dynamic game
This study aims to design a new co-evolution algorithm, Mixture Co-evolution which enables modeling of integration and composition of direct co-evolution and indirect coevolution....
Nanlin Jin
BROADNETS
2005
IEEE
14 years 2 months ago
Optimal path selection for ethernet over SONET under inaccurate link-state information
— Ethernet over SONET (EoS) is a popular approach for interconnecting geographically distant Ethernet segments using a SONET transport infrastructure. It typically uses virtual c...
Satyajeet Ahuja, Marwan Krunz, Turgay Korkmaz
EOR
2006
129views more  EOR 2006»
13 years 8 months ago
Balancing assembly lines with tabu search
Balancing assembly lines is a crucial task for manufacturing companies in order to improve productivity and minimize production costs. Despite some progress in exact methods to so...
Sophie D. Lapierre, Angel B. Ruiz, Patrick Soriano
TCBB
2008
122views more  TCBB 2008»
13 years 8 months ago
Mixed Integer Linear Programming for Maximum-Parsimony Phylogeny Inference
Reconstruction of phylogenetic trees is a fundamental problem in computational biology. While excellent heuristic methods are available for many variants of this problem, new adva...
Srinath Sridhar, Fumei Lam, Guy E. Blelloch, R. Ra...
CIC
2004
118views Communications» more  CIC 2004»
13 years 10 months ago
An Efficient Delay Sensitive Multicast Routing Algorithm
As a key issue in multicast routing with quality of service (QoS) support, constrained minimum Steiner tree (CMST) problem has been a research focus for more than a decade, and ten...
Gang Feng