Sciweavers

4229 search results - page 38 / 846
» On the Optimality of Spiral Search
Sort
View
GECCO
2007
Springer
211views Optimization» more  GECCO 2007»
15 years 5 months ago
An extremal optimization search method for the protein folding problem: the go-model example
The protein folding problem consists of predicting the functional (native) structure of the protein given its linear sequence of amino acids. Despite extensive progress made in un...
Alena Shmygelska
FOCS
2008
IEEE
15 years 5 months ago
The Bayesian Learner is Optimal for Noisy Binary Search (and Pretty Good for Quantum as Well)
We use a Bayesian approach to optimally solve problems in noisy binary search. We deal with two variants: • Each comparison is erroneous with independent probability 1 − p. â€...
Michael Ben-Or, Avinatan Hassidim
ATAL
2006
Springer
15 years 2 months ago
No-commitment branch and bound search for distributed constraint optimization
We present a new polynomial-space algorithm for solving Distributed Constraint Optimization problems (DCOP). The algorithm, called NCBB, is branch and bound search with modificati...
Anton Chechetka, Katia P. Sycara
CGF
2008
94views more  CGF 2008»
14 years 11 months ago
Statistical optimization of octree searches
This work emerged from the following observation: usual search procedures for octrees start from the root to retrieve the data stored at the leaves. But since the leaves are the fa...
Rener Castro, Thomas Lewiner, Hélio Lopes, ...
INFORMS
2000
128views more  INFORMS 2000»
14 years 11 months ago
A Revised Simplex Search Procedure for Stochastic Simulation Response Surface Optimization
We develop a variant of the Nelder-Mead (NM) simplex search procedure for stochastic simulation optimization that is designed to avoid many of the weaknesses encumbering such dire...
David G. Humphrey, James R. Wilson