1068 search results - page 105 / 214 » On Space Bounded Server Algorithms |
ALGORITHMICA
2008
13 years 8 months ago
2008
In this paper we investigate the design and analysis of algorithms resilient to memory faults. We focus on algorithms that, despite the corruption of some memory values during the...
COLT
2000
Springer
14 years 5 days ago
2000
Springer
This paper collects together a miscellany of results originally motivated by the analysis of the generalization performance of the “maximum-margin” algorithm due to Vapnik and...
NFM
2011
13 years 2 months ago
2011
A main idea underlying bounded model checking is to limit the length of the potential counter-examples, and then prove properties for the bounded version of the problem. In softwar...
CORR
2011
Springer
13 years 2 months ago
2011
Springer
—We consider the problem of positioning a cloud of points in the Euclidean space Rd , from noisy measurements of a subset of pairwise distances. This task has applications in var...
ICML
2008
IEEE
14 years 8 months ago
2008
IEEE
Rich representations in reinforcement learning have been studied for the purpose of enabling generalization and making learning feasible in large state spaces. We introduce Object...