Sciweavers

213 search results - page 41 / 43
» The randomized complexity of initial value problems
Sort
View
EXPERT
2006
84views more  EXPERT 2006»
13 years 7 months ago
Infrastructure for Engineered Emergence on Sensor/Actuator Networks
abstraction rules that hide the complexity of systems of components. We've begun this process in the domain of sensor/actuator network applications, observing that in manyappl...
Jacob Beal, Jonathan Bachrach
EC
2010
157views ECommerce» more  EC 2010»
13 years 7 months ago
Memetic Algorithms for Continuous Optimisation Based on Local Search Chains
Memetic algorithms with continuous local search methods have arisen as effective tools to address the difficulty of obtaining reliable solutions of high precision for complex cont...
Daniel Molina, Manuel Lozano, Carlos García...
BMCBI
2008
201views more  BMCBI 2008»
13 years 7 months ago
A copula method for modeling directional dependence of genes
Background: Genes interact with each other as basic building blocks of life, forming a complicated network. The relationship between groups of genes with different functions can b...
Jong-Min Kim, Yoon-Sung Jung, Engin A. Sungur, Kap...
IJAR
2006
125views more  IJAR 2006»
13 years 7 months ago
Computing best-possible bounds for the distribution of a sum of several variables is NP-hard
In many real-life situations, we know the probability distribution of two random variables x1 and x2, but we have no information about the correlation between x1 and x2; what are ...
Vladik Kreinovich, Scott Ferson
GECCO
2008
Springer
186views Optimization» more  GECCO 2008»
13 years 8 months ago
A pareto following variation operator for fast-converging multiobjective evolutionary algorithms
One of the major difficulties when applying Multiobjective Evolutionary Algorithms (MOEA) to real world problems is the large number of objective function evaluations. Approximate...
A. K. M. Khaled Ahsan Talukder, Michael Kirley, Ra...