Sciweavers

1369 search results - page 33 / 274
» Lattice computations for random numbers
Sort
View
EUROGP
2001
Springer
103views Optimization» more  EUROGP 2001»
14 years 1 months ago
Computational Complexity, Genetic Programming, and Implications
Recent theory work has shown that a Genetic Program (GP) used to produce programs may have output that is bounded above by the GP itself [l]. This paper presents proofs that show t...
Bart Rylander, Terence Soule, James A. Foster
ICCS
2004
Springer
14 years 2 months ago
Evolutionary Perspectives on Protein Thermodynamics
While modern evolutionary theory has emphasized the role of neutral evolution, protein biochemistry and biophysics has interpreted the properties of proteins as largely resulting f...
Richard A. Goldstein
CORR
2008
Springer
110views Education» more  CORR 2008»
13 years 9 months ago
Trimmed Moebius Inversion and Graphs of Bounded Degree
We study ways to expedite Yates's algorithm for computing the zeta and Moebius transforms of a function defined on the subset lattice. We develop a trimmed variant of Moebius ...
Andreas Björklund, Thore Husfeldt, Petteri Ka...
BMCBI
2007
202views more  BMCBI 2007»
13 years 8 months ago
ProtNet: a tool for stochastic simulations of protein interaction networks dynamics
Background: Protein interactions support cell organization and mediate its response to any specific stimulus. Recent technological advances have produced large data-sets that aim ...
Massimo Bernaschi, Filippo Castiglione, Alessandra...
ADHOCNOW
2004
Springer
14 years 2 months ago
Approximating the Minimum Number of Maximum Power Users in Ad Hoc Networks
Topology control is the problem of assigning transmission power values to the nodes of an ad hoc network so that the induced graph satisfies some specified property. The most fun...
Errol L. Lloyd, Rui Liu, S. S. Ravi