Sciweavers

5316 search results - page 366 / 1064
» Which Search Problems Are Random
Sort
View
176
Voted
EC
2002
111views ECommerce» more  EC 2002»
15 years 7 months ago
Fitness Landscapes and Evolvability
In this paper, we develop techniques based on evolvability statistics of the fitness landscape surrounding sampled solutions. Averaging the measures over a sample of equal fitness...
Tom Smith, Phil Husbands, Paul J. Layzell, Michael...
178
Voted
KDD
2003
ACM
124views Data Mining» more  KDD 2003»
16 years 7 months ago
Information-theoretic co-clustering
Two-dimensional contingency or co-occurrence tables arise frequently in important applications such as text, web-log and market-basket data analysis. A basic problem in contingenc...
Inderjit S. Dhillon, Subramanyam Mallela, Dharmend...
GECCO
2009
Springer
122views Optimization» more  GECCO 2009»
16 years 2 months ago
Evolving symmetric and modular neural networks for distributed control
Problems such as the design of distributed controllers are characterized by modularity and symmetry. However, the symmetries useful for solving them are often difficult to determ...
Vinod K. Valsalam, Risto Miikkulainen
ECCC
2010
122views more  ECCC 2010»
15 years 6 months ago
Query Complexity Lower Bounds for Reconstruction of Codes
We investigate the problem of local reconstruction, as defined by Saks and Seshadhri (2008), in the context of error correcting codes. The first problem we address is that of me...
Sourav Chakraborty, Eldar Fischer, Arie Matsliah
ICML
2006
IEEE
16 years 8 months ago
A new approach to data driven clustering
We consider the problem of clustering in its most basic form where only a local metric on the data space is given. No parametric statistical model is assumed, and the number of cl...
Arik Azran, Zoubin Ghahramani