Sciweavers

1047 search results - page 40 / 210
» Searching Without a Heuristic: Efficient Use of Abstraction
Sort
View
GECCO
2005
Springer
190views Optimization» more  GECCO 2005»
14 years 1 months ago
An efficient evolutionary algorithm applied to the design of two-dimensional IIR filters
This paper presents an efficient technique of designing twodimensional IIR digital filters using a new algorithm involving the tightly coupled synergism of particle swarm optimiza...
Swagatam Das, Amit Konar, Uday Kumar Chakraborty
GECCO
2007
Springer
150views Optimization» more  GECCO 2007»
14 years 1 months ago
Credit assignment in adaptive memetic algorithms
Adaptive Memetic Algorithms couple an evolutionary algorithm with a number of local search heuristics for improving the evolving solutions. They are part of a broad family of meta...
J. E. Smith
KDD
2007
ACM
177views Data Mining» more  KDD 2007»
14 years 8 months ago
Mining optimal decision trees from itemset lattices
We present DL8, an exact algorithm for finding a decision tree that optimizes a ranking function under size, depth, accuracy and leaf constraints. Because the discovery of optimal...
Élisa Fromont, Siegfried Nijssen
IDA
1999
Springer
14 years 22 hour ago
Discovering Dynamics Using Bayesian Clustering
Abstract. This paper introduces a Bayesian method for clustering dynamic processes and applies it to the characterization of the dynamics of a military scenario. The method models ...
Paola Sebastiani, Marco Ramoni, Paul R. Cohen, Joh...
RECOMB
2002
Springer
14 years 8 months ago
Provably sensitive Indexing strategies for biosequence similarity search
The field of algorithms for pairwisc biosequence similarity search is dominated by heuristic methods of high efficiency but uncertain sensitivity. One reason that more formal stri...
Jeremy Buhler