Sciweavers

136 search results - page 17 / 28
» GADYM - A Novel Genetic Algorithm in Mechanical Design Probl...
Sort
View
PODC
2011
ACM
12 years 10 months ago
Sustaining collaboration in multicast despite rational collusion
This paper focuses on designing incentive mechanisms for overlay multicast systems. Existing proposals on the problem are no longer able to provide proper incentives when rational...
Haifeng Yu, Phillip B. Gibbons, Chenwei Shi
GECCO
2007
Springer
166views Optimization» more  GECCO 2007»
13 years 11 months ago
Crossover: the divine afflatus in search
The traditional GA theory is pillared on the Building Block Hypothesis (BBH) which states that Genetic Algorithms (GAs) work by discovering, emphasizing and recombining low order ...
David Iclanzan
MFCS
2005
Springer
14 years 26 days ago
Greedy Approximation via Duality for Packing, Combinatorial Auctions and Routing
We study simple greedy approximation algorithms for general class of integer packing problems. We provide a novel analysis based on the duality theory of linear programming. This e...
Piotr Krysta
TREC
2003
13 years 8 months ago
Ranking Function Discovery by Genetic Programming for Robust Retrieval
Ranking functions are instrumental for the success of an information retrieval (search engine) system. However nearly all existing ranking functions are manually designed based on...
Li Wang, Weiguo Fan, Rui Yang, Wensi Xi, Ming Luo,...
CORR
2008
Springer
95views Education» more  CORR 2008»
13 years 7 months ago
Explicit Learning: an Effort towards Human Scheduling Algorithms
Scheduling problems are generally NP-hard combinatorial problems, and a lot of research has been done to solve these problems heuristically. However, most of the previous approach...
Jingpeng Li, Uwe Aickelin