3898 search results - page 118 / 780 » On the Bit Extraction Problem |
IJCAI
2003
14 years 11 months ago
2003
Relaxed plans are used in the heuristic search planner FF for computing a numerical heuristic and extracting helpful actions. We present a novel way for extracting information fro...
FUIN
2007
14 years 10 months ago
2007
Using 1947 work of Post showing that the word problem for semigroups is unsolvable, we explicitly exhibit an algebraic characterization of the bits of the halting probability Ω....
COLT
2001
Springer
15 years 2 months ago
2001
Springer
In this paper, we examine on-line learning problems in which the target concept is allowed to change over time. In each trial a master algorithm receives predictions from a large ...
ICONIP
2008
14 years 11 months ago
2008
Practical Recurrent Learning (PRL) has been proposed as a simple learning algorithm for recurrent neural networks[1][2]. This algorithm enables learning with practical order O(n2 )...
104
click to vote
STOC
2005
ACM
15 years 10 months ago
2005
ACM
Our main result is a reduction from worst-case lattice problems such as GAPSVP and SIVP to a certain learning problem. This learning problem is a natural extension of the `learnin...