2467 search results - page 233 / 494 » Finite State Machines |
156
click to vote
CIA
2001
Springer
15 years 11 months ago
2001
Springer
This paper describes a framework to construct interface agents with example dialogs based on the tasks by the machine learning technology. The Wizard of Oz method is used to collec...
164
click to vote
COLT
1994
Springer
15 years 10 months ago
1994
Springer
Realistic domains for learning possess regularities that make it possible to generalize experience across related states. This paper explores an environment-modeling framework tha...
175
click to vote
DM
2007
15 years 6 months ago
2007
A sequence is said to be k-automatic if the nth term of this sequence is generated by a finite state machine with n in base k as input. Regular sequences were first defined by ...
404
click to vote
EGPGV
2011
Springer
14 years 10 months ago
2011
Springer
We present a state of the art read-only distributed shared memory (DSM) ray tracer capable of fully utilizing modern cluster hardware to render massive out-of-core polygonal model...
171
click to vote
SIGOPSE
1998
ACM
15 years 11 months ago
1998
ACM
Modern virtual machines, such as Java and Inferno, are emerging as network computing s. While these virtual machines provide higher-level abstractions and more sophisticated servi...