Sciweavers

895 search results - page 135 / 179
» An Indirect Genetic Algorithm for Set Covering Problems
Sort
View
DAC
1995
ACM
15 years 2 months ago
Register Allocation and Binding for Low Power
This paper describes a technique for calculating the switching activity of a set of registers shared by di erent data values. Based on the assumption that the joint pdf (probabili...
Jui-Ming Chang, Massoud Pedram
WG
2010
Springer
14 years 9 months ago
On the Small Cycle Transversal of Planar Graphs
We consider the problem of finding a k-edge transversal set that covers all (simple) cycles of length at most s in a planar graph, where s ≥ 3 is a constant. This problem, refe...
Ge Xia, Yong Zhang
PODC
2005
ACM
15 years 4 months ago
Facility location: distributed approximation
In this paper, we initiate the study of the approximability of the facility location problem in a distributed setting. In particular, we explore a trade-off between the amount of...
Thomas Moscibroda, Roger Wattenhofer
GECCO
2008
Springer
133views Optimization» more  GECCO 2008»
14 years 11 months ago
Using feature-based fitness evaluation in symbolic regression with added noise
Symbolic regression is a popular genetic programming (GP) application. Typically, the fitness function for this task is based on a sum-of-errors, involving the values of the depe...
Janine H. Imada, Brian J. Ross
EVOW
2007
Springer
15 years 4 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