273 search results - page 47 / 55 » Genetic local search for multi-objective combinatorial optim... |
125
click to vote
RSP
1998
IEEE
15 years 2 months ago
1998
IEEE
One of the major differences in partitioning for codesign is in the way the communication cost is evaluated. Generally the size of the edge cut-set is used. When communication bet...
GECCO
2005
Springer
15 years 4 months ago
2005
Springer
Based on the Antibody Clonal Selection Theory of immunology, we put forward a novel clonal selection algorithm for multiuser detection in Code-division Multiple-access Systems. By...
CP
2006
Springer
15 years 2 months ago
2006
Springer
Abstract. Machine learning can be utilized to build models that predict the runtime of search algorithms for hard combinatorial problems. Such empirical hardness models have previo...
104
click to vote
SODA
2010
ACM
15 years 7 months ago
2010
ACM
The hypergraph matching problem is to find a largest collection of disjoint hyperedges in a hypergraph. This is a well-studied problem in combinatorial optimization and graph theo...
GECCO
2008
Springer
14 years 11 months ago
2008
Springer
In recent years, there has been an increase in research activities on Memetic Algorithm (MA). MA works with memes; a meme being defined as “the basic unit of cultural transmiss...