5153 search results - page 185 / 1031 » Introduction to Randomized Algorithms |
115
click to vote
WSC
2001
15 years 4 months ago
2001
We examine the theoretical and numerical global convergence properties of a certain "gradient free" stochastic approximation algorithm called the "simultaneous pertu...
121
click to vote
CORR
2008
Springer
15 years 3 months ago
2008
Springer
Abstract--The paper introduces DILOC, a distributed, iterative algorithm to locate sensors (with unknown locations) in 1, with respect to a minimal number of + 1 anchors with known...
169
click to vote
TAINN
2005
Springer
15 years 8 months ago
2005
Springer
Satisfiability problem is an NP-complete problem that finds itself or its variants in many combinatorial problems. There exist many complete algorithms that give successful results...
120
click to vote
IWOCA
2009
Springer
15 years 9 months ago
2009
Springer
Abstract. We analyze special random network models – so-called thickened trees – which are constructed by random trees where the nodes are replaced by local clusters. These obj...
124
click to vote
WSCG
2004
15 years 4 months ago
2004
This paper presents a stochastic iteration algorithm solving the global illumination problem, where the random sampling is governed by classical importance sampling and also by th...