5316 search results - page 185 / 1064 » Which Search Problems Are Random |
123
click to vote
IEAAIE
2001
Springer
15 years 8 months ago
2001
Springer
Scheduling problems can be seen as a set of temporal metric and disjunctive constraints. So, they can be formulated in terms of CSPs techniques. In the literature, there are CSP-b...
135
click to vote
WWW
2007
ACM
16 years 4 months ago
2007
ACM
Often scientists seek to search for articles on the Web related to a particular chemical. When a scientist searches for a chemical formula using a search engine today, she gets ar...
132
click to vote
STOC
2003
ACM
16 years 4 months ago
2003
ACM
We study clustering problems in the streaming model, where the goal is to cluster a set of points by making one pass (or a few passes) over the data using a small amount of storag...
179
click to vote
ICML
1995
IEEE
16 years 4 months ago
1995
IEEE
In this paper we introduce Ant-Q, a family of algorithms which present many similarities with Q-learning (Watkins, 1989), and which we apply to the solution of symmetric and asymm...
144
click to vote
SODA
2007
ACM
15 years 5 months ago
2007
ACM
We study a generalization of the classical secretary problem which we call the “matroid secretary problem”. In this problem, the elements of a matroid are presented to an onli...