Sciweavers

3475 search results - page 392 / 695
» Backbones in Optimization and Approximation
Sort
View
GECCO
2008
Springer
152views Optimization» more  GECCO 2008»
15 years 7 months ago
Designing EDAs by using the elitist convergent EDA concept and the boltzmann distribution
This paper presents a theoretical definition for designing EDAs called Elitist Convergent Estimation of Distribution Algorithm (ECEDA), and a practical implementation: the Boltzm...
Sergio Ivvan Valdez Peña, Arturo Hern&aacut...
GECCO
2008
Springer
139views Optimization» more  GECCO 2008»
15 years 7 months ago
Coordinate change operators for genetic algorithms
This paper studies the issue of space coordinate change in genetic algorithms, based on two methods: convex quadratic approximations, and principal component analysis. In both met...
Elizabeth F. Wanner, Eduardo G. Carrano, Ricardo H...
FOCS
2008
IEEE
15 years 6 months ago
Hardness of Nearest Neighbor under L-infinity
Recent years have seen a significant increase in our understanding of high-dimensional nearest neighbor search (NNS) for distances like the 1 and 2 norms. By contrast, our underst...
Alexandr Andoni, Dorian Croitoru, Mihai Patrascu
CORR
2010
Springer
104views Education» more  CORR 2010»
15 years 6 months ago
Decentralised Learning MACs for Collision-free Access in WLANs
By combining the features of CSMA and TDMA, fully decentralised WLAN MAC schemes have recently been proposed that converge to collision-free schedules. In this paper we describe a ...
Minyu Fang, David Malone, Ken R. Duffy, Douglas J....
CORR
2010
Springer
253views Education» more  CORR 2010»
15 years 6 months ago
Fast Inference in Sparse Coding Algorithms with Applications to Object Recognition
Adaptive sparse coding methods learn a possibly overcomplete set of basis functions, such that natural image patches can be reconstructed by linearly combining a small subset of t...
Koray Kavukcuoglu, Marc'Aurelio Ranzato, Yann LeCu...