245 search results - page 34 / 49 » Using Finite State Automata for Sequence Mining |
ALGORITHMICA
2000
13 years 7 months ago
2000
We describe a programmable apparatus that uses a vibrating surface for sensorless, nonprehensile manipulation, where parts are systematically positioned and oriented without sensor...
WSC
1998
13 years 9 months ago
1998
The search problem, ACCESSIBILITY, asks whether a finite sequence of events can be found such that, starting with a specific initial event, a particular state can be reached. This...
JIRS
2008
13 years 7 months ago
2008
Abstract This paper proposes an approach for reducing the computational complexity of a model-predictive-control strategy for discrete-time hybrid systems with discrete inputs only...
JSA
2008
13 years 7 months ago
2008
Processor simulators are important parts of processor design toolsets in which they are used to verify and evaluate the properties of the designed processors. While simulating arch...
EWRL
2008
13 years 9 months ago
2008
If one possesses a model of a controlled deterministic system, then from any state, one may consider the set of all possible reachable states starting from that state and using any...