Sciweavers

136 search results - page 11 / 28
» Using Rewarding Mechanisms for Improving Branching Heuristic...
Sort
View
EC
2007
167views ECommerce» more  EC 2007»
13 years 7 months ago
Comparison-Based Algorithms Are Robust and Randomized Algorithms Are Anytime
Randomized search heuristics (e.g., evolutionary algorithms, simulated annealing etc.) are very appealing to practitioners, they are easy to implement and usually provide good per...
Sylvain Gelly, Sylvie Ruette, Olivier Teytaud
GECCO
2010
Springer
170views Optimization» more  GECCO 2010»
14 years 9 days ago
Improving reliability of embedded systems through dynamic memory manager optimization using grammatical evolution
Technology scaling has offered advantages to embedded systems, such as increased performance, more available memory and reduced energy consumption. However, scaling also brings a...
José Manuel Colmenar, José L. Risco-...
EVOW
2007
Springer
14 years 1 months ago
Modeling the Shoot Apical Meristem in A. thaliana : Parameter Estimation for Spatial Pattern Formation
Understanding the self-regulatory mechanisms controlling the spatial and temporal structure of multicellular organisms represents one of the major challenges in molecular biology. ...
Tim Hohm, Eckart Zitzler
ICCAD
1999
IEEE
72views Hardware» more  ICCAD 1999»
13 years 11 months ago
An integrated algorithm for combined placement and libraryless technology mapping
This paper presents a new solution for combining technology mapping with placement, coupling the two into one phase. The original aspects of our work are the use of libraryless ma...
Yanbin Jiang, Sachin S. Sapatnekar
CORR
2007
Springer
106views Education» more  CORR 2007»
13 years 7 months ago
Bandit Algorithms for Tree Search
Bandit based methods for tree search have recently gained popularity when applied to huge trees, e.g. in the game of go [6]. Their efficient exploration of the tree enables to ret...
Pierre-Arnaud Coquelin, Rémi Munos