291 search results - page 23 / 59 » Approximate centerpoints with proofs |
122
click to vote
ICML
2004
IEEE
16 years 2 months ago
2004
IEEE
Synchronous reinforcement learning (RL) algorithms with linear function approximation are representable as inhomogeneous matrix iterations of a special form (Schoknecht & Merk...
136
click to vote
RTA
2007
Springer
15 years 8 months ago
2007
Springer
This paper shows how to construct static analyzers using tree automata and rewriting techniques. Starting from a term rewriting system representing the operational semantics of the...
112
click to vote
FOCS
2006
IEEE
15 years 8 months ago
2006
IEEE
Given an undirected hypergraph and a subset of vertices S ⊆ V with a specified root vertex r ∈ S, the STEINER ROOTED-ORIENTATION problem is to find an orientation of all the...
SAGA
2007
Springer
15 years 8 months ago
2007
Springer
In the layered-graph query model of network discovery, a query at a node v of an undirected graph G discovers all edges and non-edges whose endpoints have different distance from ...
95
Voted
IJBC
2007
15 years 1 months ago
2007
A Chaitin Omega number is the halting probability of a universal prefix-free Turing machine. Every Omega number is simultaneously computably enumerable (the limit of a computable...