Sciweavers

14548 search results - page 337 / 2910
» The Optimal Path-Matching Problem
Sort
View
AOR
2010
15 years 4 months ago
Speeding up Stochastic Dynamic Programming with Zero-Delay Convolution
We show how a technique from signal processing known as zero-delay convolution can be used to develop more efficient dynamic programming algorithms for a broad class of stochastic...
Brian C. Dean
JMLR
2010
182views more  JMLR 2010»
15 years 1 months ago
Quadratic Programming Feature Selection
Identifying a subset of features that preserves classification accuracy is a problem of growing importance, because of the increasing size and dimensionality of real-world data se...
Irene Rodriguez-Lujan, Ramón Huerta, Charle...
GECCO
2009
Springer
130views Optimization» more  GECCO 2009»
15 years 11 months ago
A stigmergy-based algorithm for black-box optimization: noiseless function testbed
In this paper, we present a stigmergy-based algorithm for solving optimization problems with continuous variables, labeled Differential Ant-Stigmergy Algorithm (DASA). The perfor...
Peter Korosec, Jurij Silc
GECCO
2009
Springer
107views Optimization» more  GECCO 2009»
15 years 11 months ago
A stigmergy-based algorithm for black-box optimization: noisy function testbed
In this paper, we present a stigmergy-based algorithm for solving optimization problems with continuous variables, labeled Differential Ant-Stigmergy Algorithm (DASA). The perfor...
Peter Korosec, Jurij Silc
AUSAI
2005
Springer
15 years 8 months ago
Understanding the Pheromone System Within Ant Colony Optimization
Abstract. Ant Colony Optimization (ACO) is a collection of metaheuristics inspired by foraging in ant colonies, whose aim is to solve combinatorial optimization problems. We identi...
Stephen Gilmour, Mark Dras