2131 search results - page 25 / 427 » A computational approximation to the AIXI model |
COMPGEOM
2004
ACM
14 years 1 months ago
2004
ACM
We propose a strategy to decompose a polygon, containing zero or more holes, into “approximately convex” pieces. For many applications, the approximately convex components of ...
CCR
2006
13 years 7 months ago
2006
Abstract-- The need for efficient computation of approximate global state lies at the heart of a wide range of problems in distributed systems. Examples include routing in the Inte...
SCIA
2009
Springer
14 years 2 months ago
2009
Springer
Many computer vision problems can be formulated as low rank bilinear minimization problems. One reason for the success of these problems is that they can be efficiently solved usin...
ALGORITHMICA
2004
13 years 7 months ago
2004
We investigate the diameter problem in the streaming and slidingwindow models. We show that, for a stream of n points or a sliding window of size n, any exact algorithm for diamet...
IWANN
2009
Springer
14 years 4 days ago
2009
Springer
In this paper we present a soft computing system developed to optimize the face milling operation under High Speed conditions in the manufacture of steel components like molds with...