Sciweavers

1892 search results - page 25 / 379
» Warren's Abstract Machine
Sort
View
AMC
2006
79views more  AMC 2006»
13 years 8 months ago
Church's thesis meets the N-body problem
``Church's thesis'' is at the foundation of computer science. We point out that with any particular set of physical laws, Church's thesis need not merely be po...
Warren D. Smith
SOFSEM
2012
Springer
12 years 4 months ago
Turing Machines for Dummies - Why Representations Do Matter
Abstract. Various methods exists in the literature for denoting the configuration of a Turing Machine. A key difference is whether the head position is indicated by some integer ...
Peter van Emde Boas
COLT
2008
Springer
13 years 10 months ago
More Efficient Internal-Regret-Minimizing Algorithms
Standard no-internal-regret (NIR) algorithms compute a fixed point of a matrix, and hence typically require O(n3 ) run time per round of learning, where n is the dimensionality of...
Amy R. Greenwald, Zheng Li, Warren Schudy
CACM
2011
84views more  CACM 2011»
13 years 3 months ago
Using simple abstraction to reinvent computing for parallelism
ple abstraction encapsulating the desired interface between programmers and system builders. Using Simple ion to Reinvent Computing for Parallelism doi:10.1145/1866739.1866757 abst...
Uzi Vishkin
ICML
2004
IEEE
14 years 9 months ago
Using relative novelty to identify useful temporal abstractions in reinforcement learning
lative Novelty to Identify Useful Temporal Abstractions in Reinforcement Learning ?Ozg?ur S?im?sek ozgur@cs.umass.edu Andrew G. Barto barto@cs.umass.edu Department of Computer Scie...
Özgür Simsek, Andrew G. Barto