Sciweavers

588 search results - page 40 / 118
» Querying Objects Modeled by Arbitrary Probability Distributi...
Sort
View
GECCO
2007
Springer
210views Optimization» more  GECCO 2007»
15 years 3 months ago
Markov chain models of bare-bones particle swarm optimizers
We apply a novel theoretical approach to better understand the behaviour of different types of bare-bones PSOs. It avoids many common but unrealistic assumptions often used in an...
Riccardo Poli, William B. Langdon
AAAI
2012
13 years 1 days 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
COLT
1995
Springer
15 years 1 months ago
Learning with Unreliable Boundary Queries
We introduce a new model for learning with membership queries in which queries near the boundary of a target concept may receive incorrect or “don’t care” responses. In part...
Avrim Blum, Prasad Chalasani, Sally A. Goldman, Do...
80
Voted
APPROX
2007
Springer
153views Algorithms» more  APPROX 2007»
15 years 3 months ago
Distribution-Free Testing Lower Bounds for Basic Boolean Functions
: In the distribution-free property testing model, the distance between functions is measured with respect to an arbitrary and unknown probability distribution D over the input dom...
Dana Glasner, Rocco A. Servedio
SSDBM
2000
IEEE
87views Database» more  SSDBM 2000»
15 years 2 months ago
A Tool for Nesting and Clustering Large Objects
In implementations of non-standard database systems, large objects are often embedded within an aggregate of different types, i.e. a tuple. For a given size and access probabilit...
Stefan Dieker, Ralf Hartmut Güting, Miguel Ro...