Sciweavers

269 search results - page 54 / 54
» A Minimax Method for Learning Functional Networks
Sort
View
GECCO
2010
Springer
158views Optimization» more  GECCO 2010»
13 years 10 months ago
Efficiently evolving programs through the search for novelty
A significant challenge in genetic programming is premature convergence to local optima, which often prevents evolution from solving problems. This paper introduces to genetic pro...
Joel Lehman, Kenneth O. Stanley
CCO
2001
Springer
161views Combinatorics» more  CCO 2001»
13 years 12 months ago
Branch, Cut, and Price: Sequential and Parallel
Branch, cut, and price (BCP) is an LP-based branch and bound technique for solving large-scale discrete optimization problems (DOPs). In BCP, both cuts and variables can be generat...
Laszlo Ladányi, Ted K. Ralphs, Leslie E. Tr...
BMCBI
2010
118views more  BMCBI 2010»
13 years 7 months ago
Walk-weighted subsequence kernels for protein-protein interaction extraction
Background: The construction of interaction networks between proteins is central to understanding the underlying biological processes. However, since many useful relations are exc...
Seonho Kim, Juntae Yoon, Jihoon Yang, Seog Park
EUSFLAT
2009
169views Fuzzy Logic» more  EUSFLAT 2009»
13 years 5 months ago
Decentralized Adaptive Fuzzy-Neural Control of an Anaerobic Digestion Bioprocess Plant
The paper proposed to use recurrent Fuzzy-Neural Multi-Model (FNMM) identifier for decentralized identification of a distributed parameter anaerobic wastewater treatment digestion ...
Ieroham S. Baruch, Rosalba Galvan-Guerra