412 search results - page 30 / 83 » Algorithmic Complexity Bounds on Future Prediction Errors |
105
click to vote
ESA
2003
Springer
15 years 5 months ago
2003
Springer
We propose a new complexity measure for movement of objects, the smoothed motion complexity. Many applications are based on algorithms dealing with moving objects, but usually data...
FOCS
1995
IEEE
15 years 3 months ago
1995
IEEE
Abstract. Littlestone developed a simple deterministic on-line learning algorithm for learning k-literal disjunctions. This algorithm (called Winnow) keeps one weight for each of t...
RECSYS
2009
ACM
15 years 6 months ago
2009
ACM
This paper presents a new memory-based approach to Collaborative Filtering where the neighbors of the active user will be selected taking into account their predictive capability....
104
click to vote
GRID
2007
Springer
15 years 6 months ago
2007
Springer
—Due to the dynamic nature of grid environments, schedule algorithms always need assistance of a long-time-ahead load prediction to make decisions on how to use grid resources ef...
IPPS
2007
IEEE
15 years 6 months ago
2007
IEEE
A comparative study of parallel metaheuristics executed in grid environments is proposed, having as case study a genetic algorithm, a simulated annealing algorithm and a random se...