Sciweavers

108 search results - page 14 / 22
» ILP for Mathematical Discovery
Sort
View
RECOMB
2004
Springer
14 years 7 months ago
Finding approximate tandem repeats in genomic sequences
An efficient algorithm is presented for detecting approximate tandem repeats in genomic sequences. The algorithm is based on a flexible statistical model which allows a wide range...
Ydo Wexler, Zohar Yakhini, Yechezkel Kashi, Dan Ge...
ECML
2001
Springer
13 years 12 months ago
Discovering Admissible Simultaneous Equation Models from Observed Data
Conventional work on scienti c discovery such as BACON derives empirical law equations from experimental data. In recent years, SDS introducing mathematical admissibility constrain...
Takashi Washio, Hiroshi Motoda, Yuji Niwa
KES
1998
Springer
13 years 11 months ago
Properties of robust solution searching in multi-dimensional space with genetic algorithms
-A large number of studies on Genetic Algorithms (GAs) emphasize finding a globally optimal solution. Some other investigations have also been made for detecting multiple solutions...
Shigeyoshi Tsutsui, Lakhmi C. Jain
WOA
2007
13 years 8 months ago
Conceptual Foundations of Interrogative Agents
—Reasoning by interrogation is one of the most ancient and experimented ways of reasoning. Originated by the Aristotelian elenchus, it has been used for many purposes, such as th...
Vincenzo Deufemia, Giuseppe Polese, Genoveffa Tort...
GECCO
2008
Springer
110views Optimization» more  GECCO 2008»
13 years 8 months ago
Genetic programming for finite algebras
We describe the application of genetic programming (GP) to a problem in pure mathematics, in the study of finite algebras. We document the production of human-competitive results...
Lee Spector, David M. Clark, Ian Lindsay, Bradford...