363 search results - page 42 / 73 » Partial Multicuts in Trees |
118
click to vote
AAAI
2010
15 years 3 months ago
2010
This paper introduces a principled approach for the design of a scalable general reinforcement learning agent. This approach is based on a direct approximation of AIXI, a Bayesian...
131
click to vote
JAPLL
2006
15 years 1 months ago
2006
A conjecture by D. Seese states that if a set of graphs has a decidable monadic second-order theory, then it is the image of a set of trees under a transformation defined by monad...
116
click to vote
MST
2002
15 years 1 months ago
2002
The poor scalability of existing superscalar processors has been of great concern to the computer engineering community. In particular, the critical-path lengths of many components...
ICAI
2009
14 years 11 months ago
2009
The authors extended the idea of training multiple tasks simultaneously on a partially shared feed forward network. A shared input subvector was added to represented common inputs...
140
click to vote
CGF
2011
14 years 5 months ago
2011
We accelerate the finding of occluders in tree based acceleration structures, such as a packetized BVH and a single ray kd-tree, by deriving the ray termination surface area heur...