Sciweavers

5580 search results - page 696 / 1116
» Randomized priority algorithms
Sort
View
ATAL
2009
Springer
15 years 10 months ago
Self-organising agent organisations
Self-organising multi-agent systems provide a suitable paradigm for developing autonomic computing systems that manage themselves. Towards this goal, we demonstrate a robust, dece...
Ramachandra Kota, Nicholas Gibbins, Nicholas R. Je...
GECCO
2009
Springer
143views Optimization» more  GECCO 2009»
15 years 10 months ago
Exploiting hierarchical clustering for finding bounded diameter minimum spanning trees on euclidean instances
The bounded diameter minimum spanning tree problem is an NP-hard combinatorial optimization problem arising, for example, in network design when quality of service is of concern. ...
Martin Gruber, Günther R. Raidl
RECSYS
2009
ACM
15 years 10 months ago
Collaborative prediction and ranking with non-random missing data
A fundamental aspect of rating-based recommender systems is the observation process, the process by which users choose the items they rate. Nearly all research on collaborative ï¬...
Benjamin M. Marlin, Richard S. Zemel
SIGIR
2009
ACM
15 years 10 months ago
Smoothing clickthrough data for web search ranking
Incorporating features extracted from clickthrough data (called clickthrough features) has been demonstrated to significantly improve the performance of ranking models for Web sea...
Jianfeng Gao, Wei Yuan, Xiao Li, Kefeng Deng, Jian...
CISS
2008
IEEE
15 years 10 months ago
1-Bit compressive sensing
Abstract—Compressive sensing is a new signal acquisition technology with the potential to reduce the number of measurements required to acquire signals that are sparse or compres...
Petros Boufounos, Richard G. Baraniuk