102291 search results - page 19957 / 20459 » Computing |
146
click to vote
COLT
2008
Springer
15 years 6 months ago
2008
Springer
In the multi-armed bandit (MAB) problem there are k distributions associated with the rewards of playing each of k strategies (slot machine arms). The reward distributions are ini...
119
click to vote
COMPGEOM
2008
ACM
15 years 6 months ago
2008
ACM
In many applications it is often desirable to maintain a valid mesh within a certain domain that deforms over time. During a period for which the underlying mesh topology remains ...
145
click to vote
COMPGEOM
2008
ACM
15 years 6 months ago
2008
ACM
We consider the problem of finding a maximum number of disjoint paths for unit disks moving amidst static or dynamic obstacles. For the static case we give efficient exact algorit...
152
click to vote
CPAIOR
2008
Springer
15 years 6 months ago
2008
Springer
Theoretical models for the evaluation of quickly improving search strategies, like limited discrepancy search, are based on specific assumptions regarding the probability that a va...
140
click to vote
CPM
2008
Springer
15 years 6 months ago
2008
Springer
Abstract. k-ary trees are a fundamental data structure in many textprocessing algorithms (e.g., text searching). The traditional pointer-based representation of trees is space cons...