Sciweavers

598 search results - page 71 / 120
» A Deterministic Metaheuristic Approach Using
Sort
View
AUTOMATICA
2011
13 years 4 months ago
Distributed dynamic programming for discrete-time stochastic control, and idempotent algorithms
Previously, idempotent methods have been found to be extremely fast for solution of dynamic programming equations associated with deterministic control problems. The original meth...
William M. McEneaney
EDBT
2009
ACM
133views Database» more  EDBT 2009»
14 years 1 months ago
Schema-conscious filtering of XML documents
In a publish-subscribe system based on filtering of XML documents, subscribers specify their interests with profiles expressed in the XPath language. The system processes a stre...
Panu Silvasti, Seppo Sippu, Eljas Soisalon-Soinine...
GECCO
2010
Springer
207views Optimization» more  GECCO 2010»
14 years 1 months ago
Generalized crowding for genetic algorithms
Crowding is a technique used in genetic algorithms to preserve diversity in the population and to prevent premature convergence to local optima. It consists of pairing each offsp...
Severino F. Galán, Ole J. Mengshoel
IDA
2007
Springer
14 years 3 months ago
Combining Bagging and Random Subspaces to Create Better Ensembles
Random forests are one of the best performing methods for constructing ensembles. They derive their strength from two aspects: using random subsamples of the training data (as in b...
Pance Panov, Saso Dzeroski
ISMVL
2005
IEEE
90views Hardware» more  ISMVL 2005»
14 years 2 months ago
Test Generation and Fault Localization for Quantum Circuits
It is believed that quantum computing will begin to have a practical impact in industry around year 2010. We propose an approach to test generation and fault localization for a wi...
Marek A. Perkowski, Jacob Biamonte, Martin Lukac