1331 search results - page 205 / 267 » Complexity bounds for zero-test algorithms |
158
click to vote
ICDE
2005
IEEE
15 years 11 months ago
2005
IEEE
Scientific database federations are geographically distributed and network bound. Thus, they could benefit from proxy caching. However, existing caching techniques are not suitabl...
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...
APPROX
2009
Springer
15 years 4 months ago
2009
Springer
Property testing is concerned with deciding whether an object (e.g. a graph or a function) has a certain property or is “far” (for some definition of far) from every object w...
ICCCN
2008
IEEE
15 years 4 months ago
2008
IEEE
—Most existing wireless ad hoc routing protocols rely upon the use of backward learning technique with explicit control messages to route packets. In this paper we propose a set ...
3DIM
2005
IEEE
15 years 3 months ago
2005
IEEE
The computational cost of a collision detection (CD) algorithm on polygonal surfaces depends highly on the complexity of the models. A novel “locally refined” approach is intr...