1982 search results - page 223 / 397 » Designing Efficient Distributed Algorithms Using Sampling Te... |
106
Voted
GECCO
2007
Springer
15 years 9 months ago
2007
Springer
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...
241
Voted
ICDE
2002
IEEE
16 years 4 months ago
2002
IEEE
Obtaining fast and good quality approximations to data distributions is a problem of central interest to database management. A variety of popular database applications including,...
124
Voted
PODS
2008
ACM
16 years 3 months ago
2008
ACM
We consider a fundamental flow maximization problem that arises during the evaluation of multiple overlapping queries defined on a data stream, in a heterogenous parallel environm...
157
click to vote
SIGSOFT
2003
ACM
16 years 4 months ago
2003
ACM
Automated finite-state verification techniques have matured considerably in the past several years, but state-space explosion remains an obstacle to their use. Theoretical lower b...
144
Voted
IJCAI
2001
15 years 4 months ago
2001
A new, general approach is described for approximate inference in first-order probabilistic languages, using Markov chain Monte Carlo (MCMC) techniques in the space of concrete po...