Sciweavers

1185 search results - page 42 / 237
» The Equivalence of Sampling and Searching
Sort
View
AAAI
2012
11 years 10 months ago
A Search Algorithm for Latent Variable Models with Unbounded Domains
This paper concerns learning and prediction with probabilistic models where the domain sizes of latent variables have no a priori upper-bound. Current approaches represent prior d...
Michael Chiang, David Poole
KDD
2002
ACM
108views Data Mining» more  KDD 2002»
14 years 8 months ago
Incremental Machine Learning to Reduce Biochemistry Lab Costs in the Search for Drug Discovery
This paper promotes the use of supervised machine learning in laboratory settings where chemists have a large number of samples to test for some property, and are interested in id...
George Forman
GECCO
2004
Springer
131views Optimization» more  GECCO 2004»
14 years 1 months ago
PolyEDA: Combining Estimation of Distribution Algorithms and Linear Inequality Constraints
Estimation of distribution algorithms (EDAs) are population-based heuristic search methods that use probabilistic models of good solutions to guide their search. When applied to co...
Jörn Grahl, Franz Rothlauf
EC
2002
111views ECommerce» more  EC 2002»
13 years 7 months ago
Fitness Landscapes and Evolvability
In this paper, we develop techniques based on evolvability statistics of the fitness landscape surrounding sampled solutions. Averaging the measures over a sample of equal fitness...
Tom Smith, Phil Husbands, Paul J. Layzell, Michael...
DCOSS
2009
Springer
14 years 2 months ago
Optimal Allocation of Time-Resources for Multihypothesis Activity-Level Detection
Abstract. The optimal allocation of samples for activity-level detection in a wireless body area network for health-monitoring applications is considered. A wireless body area netw...
Gautam Thatte, Viktor Rozgic, Ming Li, Sabyasachi ...