Sciweavers

882 search results - page 81 / 177
» Local Search for Very Large SAT Problems
Sort
View
GECCO
2007
Springer
437views Optimization» more  GECCO 2007»
15 years 6 months ago
A gestalt genetic algorithm: less details for better search
The basic idea to defend in this paper is that an adequate perception of the search space, sacrificing most of the precision, can paradoxically accelerate the discovery of the mo...
Christophe Philemotte, Hugues Bersini
BMCBI
2006
194views more  BMCBI 2006»
14 years 12 months ago
Novel metaheuristic for parameter estimation in nonlinear dynamic biological systems
Background: We consider the problem of parameter estimation (model calibration) in nonlinear dynamic models of biological systems. Due to the frequent ill-conditioning and multi-m...
Maria Rodriguez-Fernandez, Jose A. Egea, Julio R. ...
FSTTCS
1998
Springer
15 years 4 months ago
Alternative Computational Models: A Comparison of Biomolecular and Quantum Computation
Molecular Computation (MC) is massively parallel computation where data is stored and processed within objects of molecular size. Biomolecular Computation (BMC) is MC using biotec...
John H. Reif
PR
2008
117views more  PR 2008»
14 years 11 months ago
A scale-free distribution of false positives for a large class of audio similarity measures
The "bag-of-frames" approach (BOF) to audio pattern recognition models signals as the long-term statistical distribution of their local spectral features, a prototypical...
Jean-Julien Aucouturier, François Pachet
TSMC
1998
78views more  TSMC 1998»
14 years 11 months ago
Automata learning and intelligent tertiary searching for stochastic point location
—Consider the problem of a robot (learning mechanism or algorithm) attempting to locate a point on a line. The mechanism interacts with a random environment which essentially inf...
B. John Oommen, Govindachari Raghunath