1701 search results - page 180 / 341 » Computer Science and State Machines |
87
Voted
COLT
1994
Springer
15 years 2 months ago
1994
Springer
: Sequential algorithms given by Angluin 1987 and Schapire 1992 learn deterministic nite automata DFA exactly from Membership and Equivalence queries. These algorithms are feasible...
78
Voted
LISA
2004
14 years 11 months ago
2004
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...
86
Voted
USENIX
2001
14 years 11 months ago
2001
Multiple threads running in a single, shared address space is a simple model for writing parallel programs for symmetric multiprocessor (SMP) machines and for overlapping I/O and ...
110
Voted
ESOP
2012
Springer
13 years 6 months ago
2012
Springer
Communicating finite state machines (CFSMs) represent processes which communicate by asynchronous exchanges of messages via FIFO channels. Their major impact has been in character...
HICSS
2006
IEEE
15 years 4 months ago
2006
IEEE
The classical (ad hoc) document retrieval problem has been traditionally approached through ranking according to heuristically developed functions (such as tf.idf or bm25) or gene...