Sciweavers

13214 search results - page 2609 / 2643
» Pseudorandomness for network algorithms
Sort
View
GECCO
2010
Springer
184views Optimization» more  GECCO 2010»
14 years 11 days ago
Transfer learning through indirect encoding
An important goal for the generative and developmental systems (GDS) community is to show that GDS approaches can compete with more mainstream approaches in machine learning (ML)....
Phillip Verbancsics, Kenneth O. Stanley
CDC
2009
IEEE
129views Control Systems» more  CDC 2009»
14 years 8 days ago
Resource allocation for signal detection with active sensors
— We consider the problem of determining the existence of known constant signals over a set of sites, given noisy measurements obtained by a team of active sensors that can switc...
Jerome Le Ny, Michael M. Zavlanos, George J. Pappa...
GECCO
2009
Springer
14 years 5 days ago
The sensitivity of HyperNEAT to different geometric representations of a problem
HyperNEAT, a generative encoding for evolving artificial neural networks (ANNs), has the unique and powerful ability to exploit the geometry of a problem (e.g., symmetries) by enc...
Jeff Clune, Charles Ofria, Robert T. Pennock
KDD
2009
ACM
379views Data Mining» more  KDD 2009»
14 years 4 days ago
MetaFac: community discovery via relational hypergraph factorization
This paper aims at discovering community structure in rich media social networks, through analysis of time-varying, multi-relational data. Community structure represents the laten...
Yu-Ru Lin, Jimeng Sun, Paul Castro, Ravi B. Konuru...
DIS
2001
Springer
14 years 1 days ago
Computational Discovery of Communicable Knowledge: Symposium Report
Abstract. The Symposium on Computational Discovery of Communicable Knowledge was held from March 24 to 25, 2001, at Stanford University. Fifteen speakers reviewed recent advances i...
Saso Dzeroski, Pat Langley
« Prev « First page 2609 / 2643 Last » Next »