5580 search results - page 628 / 1116 » Randomized priority algorithms |
145
click to vote
CORR
2008
Springer
15 years 4 months ago
2008
Springer
We present a deterministic way of assigning small (log bit) weights to the edges of a bipartite planar graph so that the minimum weight perfect matching becomes unique. The isolati...
126
click to vote
IJBC
2007
15 years 4 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...
172
click to vote
AMAI
2005
Springer
15 years 4 months ago
2005
Springer
Abstract. This paper is concerned with the reliable inference of optimal treeapproximations to the dependency structure of an unknown distribution generating data. The traditional ...
132
click to vote
AI
2002
Springer
15 years 4 months ago
2002
Springer
TD-Gammon is a neural network that is able to teach itself to play backgammon solely by playing against itself and learning from the results. Starting from random initial play, TD...
111
click to vote
ENTCS
2002
15 years 4 months ago
2002
Solovay showed that there are noncomputable reals such that H( n) H(1n) + O(1), where H is prefix-free Kolmogorov complexity. Such H-trivial reals are interesting due to the conn...