2131 search results - page 171 / 427 » A computational approximation to the AIXI model |
164
click to vote
CVPR
2010
IEEE
16 years 3 months ago
2010
IEEE
We present a passive computer vision method that exploits existing mapping and navigation databases in order to automatically create 3D building models. Our method defines a gramm...
152
click to vote
JSSPP
2005
Springer
16 years 2 days ago
2005
Springer
Our main goal in this paper is to study the scheduling of parallel BSP tasks on clusters of computers. We focus our attention on special characteristics of BSP tasks, which can use...
287
click to vote
POPL
2006
ACM
16 years 6 months ago
2006
ACM
In POPL 2002, Petrank and Rawitz showed a universal result-finding optimal data placement is not only NP-hard but also impossible to approximate within a constant factor if P = NP...
153
click to vote
GECCO
2006
Springer
15 years 10 months ago
2006
Springer
The generic Multi-objective Evolutionary Algorithm (MOEA) aims to produce Pareto-front approximations with good convergence and diversity property. To achieve convergence, most mu...
175
click to vote
DCC
2011
IEEE
15 years 1 months ago
2011
IEEE
We present a general-purpose, lossless compressor for streaming data. This compressor is based on the deplump probabilistic compressor for batch data. Approximations to the infere...