960 search results - page 77 / 192 » Optimal Monte Carlo Algorithms |
WONS
2005
IEEE
14 years 2 months ago
2005
IEEE
In this paper we describe AntHocNet, an algorithm for routing in mobile ad hoc networks based on ideas from the Nature-inspired Ant Colony Optimization framework. The algorithm co...
GLOBECOM
2009
IEEE
14 years 27 days ago
2009
IEEE
In this paper we investigate both experimentally and via simulation the monitoring of fiber link quality in a PON using optical coding technology. We use a new, simple and costeffe...
PRL
2006
13 years 9 months ago
2006
This paper presents a partitional dynamic clustering method for interval data based on adaptive Hausdorff distances. Dynamic clustering algorithms are iterative two-step relocatio...
CDC
2008
IEEE
14 years 3 months ago
2008
IEEE
— We define the concept of approximate domain optimizer for deterministic and expected value optimization criteria. Roughly speaking, a candidate optimizer is an approximate dom...
SAC
2011
ACM
12 years 12 months ago
2011
ACM
Slice sampling provides an easily implemented method for constructing a Markov chain Monte Carlo (MCMC) algorithm. However, slice sampling has two major drawbacks: (i) it requires...