Sciweavers

98 search results - page 14 / 20
» Cut-and-solve: An iterative search strategy for combinatoria...
Sort
View
GECCO
2007
Springer
178views Optimization» more  GECCO 2007»
14 years 1 months ago
Transgenetic algorithm: a new evolutionary perspective for heuristics design
Transgenetic algorithms are evolutionary computing techniques based on living processes where cooperation is the main evolutionary strategy. Those processes contain the movement o...
Elizabeth Ferreira Gouvea Goldbarg, Marco Cé...
GECCO
2003
Springer
14 years 21 days ago
Chromosome Reuse in Genetic Algorithms
This paper introduces a novel genetic algorithm strategy based on the reuse of chromosomes from previous generations in the creation of offspring individuals. A number of chromoso...
Adnan Acan, Yüce Tekol
JMLR
2010
149views more  JMLR 2010»
13 years 2 months ago
Learning Bayesian Network Structure using LP Relaxations
We propose to solve the combinatorial problem of finding the highest scoring Bayesian network structure from data. This structure learning problem can be viewed as an inference pr...
Tommi Jaakkola, David Sontag, Amir Globerson, Mari...
LCTRTS
2010
Springer
13 years 5 months ago
Improving both the performance benefits and speed of optimization phase sequence searches
The issues of compiler optimization phase ordering and selection present important challenges to compiler developers in several domains, and in particular to the speed, code size,...
Prasad A. Kulkarni, Michael R. Jantz, David B. Wha...
ICAI
2004
13 years 9 months ago
An Efficient Heuristic Bundle Search Algorithm for Buyers in Electronic Markets
In the age of electronic commerce, with low-cost information access, it has been recognized that a bundle search in a combinatorial trade is very valuable for buyers. Optimal trav...
Linli He, Thomas R. Ioerger