Sciweavers

363 search results - page 42 / 73
» Partial Multicuts in Trees
Sort
View
AAAI
2010
13 years 11 months ago
Reinforcement Learning via AIXI Approximation
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...
Joel Veness, Kee Siong Ng, Marcus Hutter, David Si...
JAPLL
2006
114views more  JAPLL 2006»
13 years 10 months ago
The monadic second-order logic of graphs XV: On a conjecture by D. Seese
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...
Bruno Courcelle
MST
2002
107views more  MST 2002»
13 years 9 months ago
A Comparison of Asymptotically Scalable Superscalar Processors
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...
Bradley C. Kuszmaul, Dana S. Henry, Gabriel H. Loh
ICAI
2009
13 years 7 months ago
Learning Mappings with Neural Network
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...
Yefei Peng, Paul W. Munro
CGF
2011
13 years 1 months ago
RTSAH Traversal Order for Occlusion Rays
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...
Thiago Ize, Charles D. Hansen