2492 search results - page 301 / 499 » On the General Signature Trees |
184
click to vote
JAIR
2010
15 years 4 months ago
2010
Noisy probabilistic relational rules are a promising world model representation for several reasons. They are compact and generalize over world instantiations. They are usually in...
153
click to vote
TOMS
2010
15 years 4 months ago
2010
The Tutte polynomial of a graph, also known as the partition function of the q-state Potts model, is a 2-variable polynomial graph invariant of considerable importance in both comb...
171
click to vote
WALCOM
2010
IEEE
15 years 4 months ago
2010
IEEE
We present two space-efficient algorithms. First, we show how to report a simple path between two arbitrary nodes in a given tree. Using a technique called “computing instead of ...
200
click to vote
DMTCS
2010
15 years 3 months ago
2010
This paper studies the fundamental trade-off between communication cost and delay cost arising in various contexts such as control message aggregation or organization theory. An o...
138
Voted
JAIR
2011
15 years 1 months ago
2011
This paper describes a computationally feasible approximation to the AIXI agent, a universal reinforcement learning agent for arbitrary environments. AIXI is scaled down in two ke...