Sciweavers

530 search results - page 56 / 106
» Bounds on marginal probability distributions
Sort
View
FOCS
1990
IEEE
14 years 1 days ago
Simple Constructions of Almost k-Wise Independent Random Variables
We present three alternative simple constructions of small probability spaces on n bits for which any k bits are almost independent. The number of bits used to specify a point in ...
Noga Alon, Oded Goldreich, Johan Håstad, Ren...
GECCO
2003
Springer
14 years 1 months ago
Two Broad Classes of Functions for Which a No Free Lunch Result Does Not Hold
We identify classes of functions for which a No Free Lunch result does and does not hold, with particular emphasis on the relationship between No Free Lunch and problem description...
Matthew J. Streeter
ENTCS
2008
146views more  ENTCS 2008»
13 years 8 months ago
Probabilistic Abstract Interpretation of Imperative Programs using Truncated Normal Distributions
istic Abstract Interpretation of Imperative Programs using Truncated Normal Distributions Michael J. A. Smith1 ,2 Laboratory for Foundations of Computer Science University of Edinb...
Michael J. A. Smith
CORR
2008
Springer
118views Education» more  CORR 2008»
13 years 8 months ago
Distributed Constrained Optimization with Semicoordinate Transformations
Recent work has shown how information theory extends conventional full-rationality game theory to allow bounded rational agents. The associated mathematical framework can be used ...
William G. Macready, David Wolpert
GECCO
2005
Springer
126views Optimization» more  GECCO 2005»
14 years 1 months ago
Not all linear functions are equally difficult for the compact genetic algorithm
Estimation of distribution algorithms (EDAs) try to solve an optimization problem by finding a probability distribution focussed around its optima. For this purpose they conduct ...
Stefan Droste