Sciweavers

5153 search results - page 189 / 1031
» Introduction to Randomized Algorithms
Sort
View
FOCS
2006
IEEE
15 years 9 months ago
Fast Algorithms for Logconcave Functions: Sampling, Rounding, Integration and Optimization
We prove that the hit-and-run random walk is rapidly mixing for an arbitrary logconcave distribution starting from any point in the support. This extends the work of [26], where t...
László Lovász, Santosh Vempal...
CEC
2005
IEEE
15 years 8 months ago
Genetic algorithms with self-organized criticality for dynamic optimization problems
This paper proposes a genetic algorithm (GA) with random immigrants for dynamic optimization problems where the worst individual and its neighbours are replaced every generation. I...
Renato Tinós, Shengxiang Yang
SSPR
2004
Springer
15 years 8 months ago
Feature Subset Selection Using an Optimized Hill Climbing Algorithm for Handwritten Character Recognition
This paper presents an optimized Hill Climbing algorithm to select a subset of features for handwritten character recognition. The search is conducted taking into account a random ...
Carlos M. Nunes, Alceu de Souza Britto Jr., Celso ...
CDC
2009
IEEE
137views Control Systems» more  CDC 2009»
15 years 7 months ago
Asynchronous gossip algorithms for stochastic optimization
Abstract— We consider a distributed multi-agent network system where the goal is to minimize an objective function that can be written as the sum of component functions, each of ...
Sundhar Srinivasan Ram, Angelia Nedic, Venugopal V...
NAA
2000
Springer
104views Mathematics» more  NAA 2000»
15 years 6 months ago
A Grid Free Monte Carlo Algorithm for Solving Elliptic Boundary Value Problems
In this work a grid free Monte Carlo algorithm for solving elliptic boundary value problems is investigated. The proposed Monte Carlo approach leads to a random process called a ba...
Todor V. Gurov, Paula A. Whitlock, Ivan Dimov