Sciweavers

403 search results - page 37 / 81
» Sampling Bounds for Stochastic Optimization
Sort
View
TIT
2011
157views more  TIT 2011»
13 years 4 months ago
Decentralized Sequential Hypothesis Testing Using Asynchronous Communication
—An asymptotically optimum test for the problem of decentralized sequential hypothesis testing is presented. The induced communication between sensors and fusion center is asynch...
Georgios Fellouris, George V. Moustakides
AAAI
2008
14 years 6 days ago
Towards Faster Planning with Continuous Resources in Stochastic Domains
Agents often have to construct plans that obey resource limits for continuous resources whose consumption can only be characterized by probability distributions. While Markov Deci...
Janusz Marecki, Milind Tambe
CPHYSICS
2006
182views more  CPHYSICS 2006»
13 years 10 months ago
MinFinder: Locating all the local minima of a function
A new stochastic clustering algorithm is introduced that aims to locate all the local minima of a multidimensional continuous and differentiable function inside a bounded domain. ...
Ioannis G. Tsoulos, Isaac E. Lagaris
GECCO
2007
Springer
164views Optimization» more  GECCO 2007»
14 years 4 months ago
A study of mutational robustness as the product of evolutionary computation
This paper investigates the ability of a tournament selection based genetic algorithm to find mutationally robust solutions to a simple combinatorial optimization problem. Two di...
Justin Schonfeld
AE
2005
Springer
14 years 3 months ago
Algorithms (X, sigma, eta): Quasi-random Mutations for Evolution Strategies
Randomization is an efficient tool for global optimization. We here define a method which keeps : – the order 0 of evolutionary algorithms (no gradient) ; – the stochastic as...
Anne Auger, Mohamed Jebalia, Olivier Teytaud