Sciweavers

8647 search results - page 1264 / 1730
» The Container Selection Problem
Sort
View
STACS
2005
Springer
15 years 11 months ago
Kolmogorov-Loveland Randomness and Stochasticity
An infinite binary sequence X is Kolmogorov-Loveland (or KL) random if there is no computable non-monotonic betting strategy that succeeds on X in the sense of having an unbounde...
Wolfgang Merkle, Joseph S. Miller, André Ni...
MIR
2003
ACM
213views Multimedia» more  MIR 2003»
15 years 11 months ago
Replication algorithms to retrieve scalable streaming media over Content Delivery Networks
CDN (Content Delivery Networks) improves end-user performance by replicating web contents on a group of geographically distributed content servers. Replication Algorithm plays an ...
Zhou Su, Jiro Katto, Yasuhiko Yasuda
GPCE
2009
Springer
15 years 10 months ago
Extending AspectJ for separating regions
Synchronization is a good candidate for an aspect in aspectoriented programming (AOP) since programmers have to choose the best granularity of synchronization for the underlying h...
Shumpei Akai, Shigeru Chiba
PG
1999
IEEE
15 years 10 months ago
Automatic Camera Placement for Image-Based Modeling
We present an automatic camera placement method for generating image-based models from scenes with known geometry. Our method first approximately determines the set of surfaces vi...
Shachar Fleishman, Daniel Cohen-Or, Dani Lischinsk...
IWANN
1999
Springer
15 years 10 months ago
Using Temporal Neighborhoods to Adapt Function Approximators in Reinforcement Learning
To avoid the curse of dimensionality, function approximators are used in reinforcement learning to learn value functions for individual states. In order to make better use of comp...
R. Matthew Kretchmar, Charles W. Anderson
« Prev « First page 1264 / 1730 Last » Next »