Sciweavers

1778 search results - page 120 / 356
» The Theory of Probabilistic Databases
Sort
View
SIGMETRICS
2012
ACM
257views Hardware» more  SIGMETRICS 2012»
13 years 8 months ago
Fair sampling across network flow measurements
Sampling is crucial for controlling resource consumption by internet traffic flow measurements. Routers use Packet Sampled NetFlow [9], and completed flow records are sampled in...
Nick G. Duffield
GECCO
2007
Springer
155views Optimization» more  GECCO 2007»
16 years 13 days ago
Solving the MAXSAT problem using a multivariate EDA based on Markov networks
Markov Networks (also known as Markov Random Fields) have been proposed as a new approach to probabilistic modelling in Estimation of Distribution Algorithms (EDAs). An EDA employ...
Alexander E. I. Brownlee, John A. W. McCall, Deryc...
GECCO
2005
Springer
129views Optimization» more  GECCO 2005»
15 years 11 months ago
Real-coded crossover as a role of kernel density estimation
This paper presents a kernel density estimation method by means of real-coded crossovers. Estimation of density algorithms (EDAs) are evolutionary optimization techniques, which d...
Jun Sakuma, Shigenobu Kobayashi
GECCO
2005
Springer
232views Optimization» more  GECCO 2005»
15 years 11 months ago
Factorial representations to generate arbitrary search distributions
A powerful approach to search is to try to learn a distribution of good solutions (in particular of the dependencies between their variables) and use this distribution as a basis ...
Marc Toussaint
MM
2004
ACM
154views Multimedia» more  MM 2004»
15 years 11 months ago
PLSA-based image auto-annotation: constraining the latent space
We address the problem of unsupervised image auto-annotation with probabilistic latent space models. Unlike most previous works, which build latent space representations assuming ...
Florent Monay, Daniel Gatica-Perez