Sciweavers

435 search results - page 59 / 87
» Partitioning Search Spaces of a Randomized Search
Sort
View
GECCO
2000
Springer
120views Optimization» more  GECCO 2000»
15 years 1 months ago
An Improved Adaptive Multi-Start Approach to Finding Near-Optimal Solutions to the Euclidean TSP
We present an "adaptive multi-start" genetic algorithm for the Euclidean traveling salesman problem that uses a population of tours locally optimized by the Lin-Kernigha...
Dan Bonachea, Eugene Ingerman, Joshua Levy, Scott ...
AIPS
2009
14 years 11 months ago
Computing Robust Plans in Continuous Domains
We define the robustness of a sequential plan as the probability that it will execute successfully despite uncertainty in the execution environment. We consider a rich notion of u...
Christian Fritz, Sheila A. McIlraith
RECOMB
2007
Springer
15 years 10 months ago
Minimizing and Learning Energy Functions for Side-Chain Prediction
Abstract. Side-chain prediction is an important subproblem of the general protein folding problem. Despite much progress in side-chain prediction, performance is far from satisfact...
Chen Yanover, Ora Schueler-Furman, Yair Weiss
INFOCOM
2006
IEEE
15 years 3 months ago
Theory and Network Applications of Dynamic Bloom Filters
Abstract— A bloom filter is a simple, space-efficient, randomized data structure for concisely representing a static data set, in order to support approximate membership querie...
Deke Guo, Jie Wu, Honghui Chen, Xueshan Luo
PAMI
2000
142views more  PAMI 2000»
14 years 9 months ago
Evolutionary Pursuit and Its Application to Face Recognition
Abstract-- This paper introduces Evolutionary Pursuit (EP) as a novel and adaptive representation method for image encoding and classification. In analogy to projection pursuit met...
Chengjun Liu, Harry Wechsler