Sciweavers

52 search results - page 1 / 11
» Ant Colony Optimization and Stochastic Gradient Descent
Sort
View
ALIFE
2002
13 years 4 months ago
Ant Colony Optimization and Stochastic Gradient Descent
In this paper, we study the relationship between the two techniques known as ant colony optimization (aco) and stochastic gradient descent. More precisely, we show that some empir...
Nicolas Meuleau, Marco Dorigo
ANOR
2004
155views more  ANOR 2004»
13 years 4 months ago
Model-Based Search for Combinatorial Optimization: A Critical Survey
In this paper we introduce model-based search as a unifying framework accommodating some recently proposed metaheuristics for combinatorial optimization such as ant colony optimiza...
Mark Zlochin, Mauro Birattari, Nicolas Meuleau, Ma...
SAGA
2005
Springer
13 years 10 months ago
Two Metaheuristics for Multiobjective Stochastic Combinatorial Optimization
Two general-purpose metaheuristic algorithms for solving multiobjective stochastic combinatorial optimization problems are introduced: SP-ACO (based on the Ant Colony Optimization ...
Walter J. Gutjahr
ICANN
2001
Springer
13 years 9 months ago
Fast Curvature Matrix-Vector Products
The method of conjugate gradients provides a very effective way to optimize large, deterministic systems by gradient descent. In its standard form, however, it is not amenable to ...
Nicol N. Schraudolph
EUROCAST
2007
Springer
159views Hardware» more  EUROCAST 2007»
13 years 8 months ago
Ant Colony Optimization for Model Checking
Abstract Model Checking is a well-known and fully automatic technique for checking software properties, usually given as temporal logic formulas on the program variables. Most of m...
Enrique Alba, J. Francisco Chicano