1701 search results - page 43 / 341 » Computer Science and State Machines |
ECTEL
2009
Springer
15 years 4 months ago
2009
Springer
Benchmarking for educational purposes in the context of computer science can be hindered by the low number and the homogeneity of machines to be assessed, and the inaccuracy of the...
CATS
2006
14 years 11 months ago
2006
The busy beaver is an example of a function which is not computable. It is based on a particular class of Turing machines, and is defined as the largest number of 1's that ca...
SPIN
2009
Springer
15 years 4 months ago
2009
Springer
Existing techniques for approximate storage of visited states in a model checker are too special-purpose and too DRAM-intensive. Bitstate hashing, based on Bloom filters, is good ...
DNA
2008
Springer
14 years 11 months ago
2008
Springer
Whiplash PCR (WPCR), due to Hagiya et al. [1], is a novel technique for autonomous molecular computation where a state machine is implemented with a single stranded DNA molecule a...
OSDI
2002
ACM
15 years 10 months ago
2002
ACM
This paper shows how to quickly move the state of a running computer across a network, including the state in its disks, memory, CPU registers, and I/O devices. We call this state...