412 search results - page 69 / 83 » Algorithmic Complexity Bounds on Future Prediction Errors |
117
click to vote
JAIR
2008
14 years 11 months ago
2008
Probabilistic planning problems are typically modeled as a Markov Decision Process (MDP). MDPs, while an otherwise expressive model, allow only for sequential, non-durative action...
EDBT
2002
ACM
15 years 11 months ago
2002
ACM
Web logs collected by proxy servers, referred to as proxy logs or proxy traces, contain information about Web document accesses by many users against many Web sites. This "man...
ICNC
2009
Springer
15 years 6 months ago
2009
Springer
The main purpose of this paper is to propose an incorporating a grammatical evolution (GE) into the genetic algorithm (GA), called GEGA, and apply it to estimate the compressive s...
106
click to vote
JVCIR
2006
14 years 11 months ago
2006
In this paper, we propose a family of novel stereoscopic image coders based on morphological coding and a block-based disparity compensation algorithm. The proposed schemes employ...
104
click to vote
IWMM
2009
Springer
15 years 6 months ago
2009
Springer
The peak heap consumption of a program is the maximum size of the live data on the heap during the execution of the program, i.e., the minimum amount of heap space needed to run t...