Sciweavers

2266 search results - page 319 / 454
» Evolutionary Algorithms for the Satisfiability Problem
Sort
View
STOC
2012
ACM
192views Algorithms» more  STOC 2012»
13 years 9 months ago
Nearly optimal sparse fourier transform
We consider the problem of computing the k-sparse approximation to the discrete Fourier transform of an ndimensional signal. We show: • An O(k log n)-time randomized algorithm f...
Haitham Hassanieh, Piotr Indyk, Dina Katabi, Eric ...
SODA
2012
ACM
203views Algorithms» more  SODA 2012»
13 years 9 months ago
Black-box reductions for cost-sharing mechanism design
We consider the design of strategyproof cost-sharing mechanisms. We give two simple, but extremely versatile, black-box reductions, that in combination reduce the cost-sharing mec...
Konstantinos Georgiou, Chaitanya Swamy
GECCO
2007
Springer
308views Optimization» more  GECCO 2007»
16 years 28 days ago
Multiobjective clustering with automatic k-determination for large-scale data
Web mining - data mining for web data - is a key factor of web technologies. Especially, web behavior mining has attracted a great deal of attention recently. Behavior mining invo...
Nobukazu Matake, Tomoyuki Hiroyasu, Mitsunori Miki...
SASO
2009
IEEE
16 years 1 months ago
Evolution of Probabilistic Consensus in Digital Organisms
—The complexity of distributed computing systems and their increasing interaction with the physical world impose challenging requirements in terms of adaptation, robustness, and ...
David B. Knoester, Philip K. McKinley
GECCO
2003
Springer
112views Optimization» more  GECCO 2003»
15 years 12 months ago
Dispersion-Based Population Initialization
Reliable execution and analysis of an evolutionary algorithm (EA) normally requires many runs to provide reasonable assurance that stochastic effects have been properly considered...
Ronald W. Morrison