Sciweavers

2922 search results - page 206 / 585
» Scalable Algorithms for Distribution Search
Sort
View
STACS
2005
Springer
15 years 9 months ago
Worst-Case and Average-Case Approximations by Simple Randomized Search Heuristics
Abstract. In recent years, probabilistic analyses of algorithms have received increasing attention. Despite results on the average-case complexity and smoothed complexity of exact ...
Carsten Witt
UAI
2000
15 years 5 months ago
Learning to Cooperate via Policy Search
Cooperative games are those in which both agents share the same payoff structure. Valuebased reinforcement-learning algorithms, such as variants of Q-learning, have been applied t...
Leonid Peshkin, Kee-Eung Kim, Nicolas Meuleau, Les...
GECCO
2010
Springer
248views Optimization» more  GECCO 2010»
15 years 7 months ago
Integrating decision space diversity into hypervolume-based multiobjective search
Multiobjective optimization in general aims at learning about the problem at hand. Usually the focus lies on objective space properties such as the front shape and the distributio...
Tamara Ulrich, Johannes Bader, Eckart Zitzler
SIGIR
2004
ACM
15 years 9 months ago
On scaling latent semantic indexing for large peer-to-peer systems
The exponential growth of data demands scalable infrastructures capable of indexing and searching rich content such as text, music, and images. A promising direction is to combine...
Chunqiang Tang, Sandhya Dwarkadas, Zhichen Xu
KDD
2009
ACM
152views Data Mining» more  KDD 2009»
16 years 4 months ago
TANGENT: a novel, 'Surprise me', recommendation algorithm
Most of recommender systems try to find items that are most relevant to the older choices of a given user. Here we focus on the "surprise me" query: A user may be bored ...
Kensuke Onuma, Hanghang Tong, Christos Faloutsos