451 search results - page 75 / 91 » Some Lower Bounds on Geometric Separability Problems |
76
Voted
ICML
2009
IEEE
15 years 10 months ago
2009
IEEE
We consider the exploration/exploitation problem in reinforcement learning (RL). The Bayesian approach to model-based RL offers an elegant solution to this problem, by considering...
STOC
2004
ACM
15 years 10 months ago
2004
ACM
We investigate the design of algorithms resilient to memory faults, i.e., algorithms that, despite the corruption of some memory values during their execution, are able to produce...
78
Voted
ALENEX
2010
14 years 11 months ago
2010
Monitoring the performance of large shared computing systems such as the cloud computing infrastructure raises many challenging algorithmic problems. One common problem is to trac...
87
Voted
MST
1998
14 years 9 months ago
1998
We consider the problem of merging two sorted sequences on constant degree networks using comparators only. The classical solution to the problem are the networks based on Batcherâ...
AAIM
2009
Springer
14 years 7 months ago
2009
Springer
In this paper we introduce a discrete version of the online traveling salesman problem (DOLTSP). We represent the metric space using a weighted graph, where the server is allowed t...