Sciweavers

416 search results - page 9 / 84
» Approximation Algorithms for Reliable Stochastic Combinatori...
Sort
View
CORR
2008
Springer
126views Education» more  CORR 2008»
13 years 8 months ago
Path following algorithm for the graph matching problem
We propose a convex-concave programming approach for the labeled weighted graph matching problem. The convex-concave programming formulation is obtained by rewriting the weighted ...
Mikhail Zaslavskiy, Francis Bach, Jean-Philippe Ve...
WSC
2001
13 years 10 months ago
Global random optimization by simultaneous perturbation stochastic approximation
We examine the theoretical and numerical global convergence properties of a certain "gradient free" stochastic approximation algorithm called the "simultaneous pertu...
John L. Maryak, Daniel C. Chin
SIGECOM
2011
ACM
232views ECommerce» more  SIGECOM 2011»
12 years 11 months ago
Near optimal online algorithms and fast approximation algorithms for resource allocation problems
We present algorithms for a class of resource allocation problems both in the online setting with stochastic input and in the offline setting. This class of problems contains man...
Nikhil R. Devanur, Kamal Jain, Balasubramanian Siv...
ML
2007
ACM
192views Machine Learning» more  ML 2007»
13 years 8 months ago
Annealing stochastic approximation Monte Carlo algorithm for neural network training
We propose a general-purpose stochastic optimization algorithm, the so-called annealing stochastic approximation Monte Carlo (ASAMC) algorithm, for neural network training. ASAMC c...
Faming Liang
ICGA
1997
134views Optimization» more  ICGA 1997»
13 years 10 months ago
Local Search Genetic Algorithm for Optimization of Highly Reliable Communications Networks
This paper presents a genetic algorithm (GA) with specialized encoding, initialization and local search genetic operators to optimize communication network topologies. This NPhard...
Berna Dengiz, Fulya Altiparmak, Alice E. Smith