Sciweavers

691 search results - page 86 / 139
» Genetic Programming Applied to Mixed Integer Programming
Sort
View
101
Voted
GECCO
2006
Springer
166views Optimization» more  GECCO 2006»
15 years 6 months ago
Comparing genetic robustness in generational vs. steady state evolutionary algorithms
Previous research has shown that evolutionary systems not only try to develop solutions that satisfy a fitness requirement, but indirectly attempt to develop genetically robust so...
Josh Jones, Terry Soule
98
Voted
CGO
2004
IEEE
15 years 6 months ago
The Accuracy of Initial Prediction in Two-Phase Dynamic Binary Translators
Dynamic binary translators use a two-phase approach to identify and optimize frequently executed code dynamically. In the first step (profiling phase), blocks of code are interpre...
Youfeng Wu, Mauricio Breternitz Jr., Justin Quek, ...
130
Voted
MP
1998
109views more  MP 1998»
15 years 2 months ago
Rounding algorithms for covering problems
In the last 25 years approximation algorithms for discrete optimization problems have been in the center of research in the fields of mathematical programming and computer science...
Dimitris Bertsimas, Rakesh V. Vohra
210
Voted
DC
2011
14 years 2 months ago
Distributed algorithms for covering, packing and maximum weighted matching
Abstract This paper gives poly-logarithmic-round, distributed δ-approximation algorithms for covering problems with submodular cost and monotone covering constraints (Submodular-c...
Christos Koufogiannakis, Neal E. Young
109
Voted
GECCO
2005
Springer
140views Optimization» more  GECCO 2005»
15 years 8 months ago
CGP visits the Santa Fe trail: effects of heuristics on GP
GP uses trees to represent chromosomes. The user defines the representation space by defining the set of functions and terminals to label the nodes in the trees, and GP searches t...
Cezary Z. Janikow, Christopher J. Mann