1705 search results - page 20 / 341 » Representing Constraints with Automata |
ISCAS
1999
IEEE
13 years 12 months ago
1999
IEEE
In this paper, the problem of determining if a given sequential specification can be made to fit a predetermined set of shape constraints is explored. Shape constraints are constr...
SBBD
2007
13 years 9 months ago
2007
Abstract. A lot of recent applications dealing with complex data require sophisticated data structures (trees or graphs) for their specification. Recently, several techniques for ...
AUSAI
2003
Springer
14 years 26 days ago
2003
Springer
Most on-line cursive handwriting recognition systems use a lexical constraint to help improve the recognition performance. Traditionally, the vocabulary lexicon is stored in a trie...
COCOON
2001
Springer
14 years 4 days ago
2001
Springer
We consider generalized discrete timed automata with general linear relations over clocks and parameterized constants as clock constraints and with parameterized durations. We look...
HYBRID
2000
Springer
13 years 11 months ago
2000
Springer
This paper studies the existence of solutions to a class of hybrid automata in which the underlying continuous dynamics are represented by inhomogeneous linear time-invariant syste...