Sciweavers

1753 search results - page 192 / 351
» State Machines
Sort
View
ACSE
2000
ACM
15 years 9 months ago
Here, there and everywhere - on the recurring use of turtle graphics in CS1
The Logo programming language implements a virtual drawing machine—the turtle machine. The turtle machine is well-known for giving students an intuitive understanding of fundame...
Michael E. Caspersen, Henrik Bærbak Christen...
COLT
1994
Springer
15 years 9 months ago
An Optimal Parallel Algorithm for Learning DFA
: Sequential algorithms given by Angluin 1987 and Schapire 1992 learn deterministic nite automata DFA exactly from Membership and Equivalence queries. These algorithms are feasible...
José L. Balcázar, Josep Díaz,...
LREC
2008
120views Education» more  LREC 2008»
15 years 6 months ago
The U.S. Policy Agenda Legislation Corpus Volume 1 - a Language Resource from 1947 - 1998
We introduce the corpus of United States Congressional bills from 1947 to 1998 for use by language research communities. The U.S. Policy Agenda Legislation Corpus Volume 1 (USPALC...
Stephen Purpura, John Wilkerson, Dustin Hillard
LISA
2004
15 years 6 months ago
Who Moved My Data? A Backup Tracking System for Dynamic Workstation Environments
Periodic data backup is a system administration requirement that has changed as wireless machines have altered the fundamental structure of networks. These changes necessitate a c...
Gregory Pluta, Larry Brumbaugh, William Yurcik, Jo...
CORR
2008
Springer
70views Education» more  CORR 2008»
15 years 5 months ago
Every Computably Enumerable Random Real Is Provably Computably Enumerable Random
We prove that every computably enumerable (c.e.) random real is provable in Peano Arithmetic (PA) to be c.e. random. A major step in the proof is to show that the theorem stating ...
Cristian S. Calude, Nicholas J. Hay