Sciweavers

1329 search results - page 127 / 266
» Randomly Sampling Molecules
Sort
View
CAV
2009
Springer
187views Hardware» more  CAV 2009»
14 years 11 months ago
A Markov Chain Monte Carlo Sampler for Mixed Boolean/Integer Constraints
We describe a Markov chain Monte Carlo (MCMC)-based algorithm for sampling solutions to mixed Boolean/integer constraint problems. The focus of this work differs in two points from...
Nathan Kitchen, Andreas Kuehlmann
COLT
2007
Springer
14 years 4 months ago
Minimax Bounds for Active Learning
This paper analyzes the potential advantages and theoretical challenges of “active learning” algorithms. Active learning involves sequential sampling procedures that use infor...
Rui Castro, Robert D. Nowak
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
INFOCOM
2003
IEEE
14 years 3 months ago
Server-based Inference of Internet Link Lossiness
— We investigate the problem of inferring the packet loss characteristics of Internet links using server-based measurements. Unlike much of existing work on network tomography th...
Venkata N. Padmanabhan, Lili Qiu, Helen J. Wang
DAGM
2003
Springer
14 years 3 months ago
Locally Optimized RANSAC
A new enhancement of RANSAC, the locally optimized RANSAC (LO-RANSAC), is introduced. It has been observed that, to find an optimal solution (with a given probability), the numbe...
Ondrej Chum, Jiri Matas, Josef Kittler