Sciweavers

5316 search results - page 229 / 1064
» Which Search Problems Are Random
Sort
View
ICML
2010
IEEE
15 years 5 months ago
Efficient Selection of Multiple Bandit Arms: Theory and Practice
We consider the general, widely applicable problem of selecting from n real-valued random variables a subset of size m of those with the highest means, based on as few samples as ...
Shivaram Kalyanakrishnan, Peter Stone
FSTTCS
2010
Springer
15 years 2 months ago
Average Analysis of Glushkov Automata under a BST-Like Model
We study the average number of transitions in Glushkov automata built from random regular expressions. This statistic highly depends on the probabilistic distribution set on the e...
Cyril Nicaud, Carine Pivoteau, Benoît Razet
153
Voted
PVLDB
2008
174views more  PVLDB 2008»
15 years 4 months ago
Relaxation in text search using taxonomies
In this paper we propose a novel document retrieval model in which text queries are augmented with multi-dimensional taxonomy restrictions. These restrictions may be relaxed at a ...
Marcus Fontoura, Vanja Josifovski, Ravi Kumar, Chr...
GECCO
2009
Springer
141views Optimization» more  GECCO 2009»
15 years 11 months ago
Visualizing the search process of particle swarm optimization
It is a hard problem to understand the search process of particle swarm optimization over high-dimensional domain. The visualization depicts the total search process and then it w...
Yong-Hyuk Kim, Kang Hoon Lee, Yourim Yoon
HEURISTICS
2006
109views more  HEURISTICS 2006»
15 years 4 months ago
A scatter search algorithm for project scheduling under partially renewable resources
In this paper we develop a heuristic algorithm, based on Scatter Search, for project scheduling problems under partially renewable resources. This new type of resource can be view...
Ramón Alvarez-Valdés, Enric Crespo, ...