Sciweavers

437 search results - page 62 / 88
» Gradience, Constructions and Constraint Systems
Sort
View
DATE
2010
IEEE
168views Hardware» more  DATE 2010»
15 years 10 months ago
Verifying UML/OCL models using Boolean satisfiability
Abstract--Nowadays, modeling languages like UML are essential in the design of complex software systems and also start to enter the domain of hardware and hardware/software codesig...
Mathias Soeken, Robert Wille, Mirco Kuhlmann, Mart...
AUSAI
2003
Springer
15 years 11 months ago
Reduction of Non Deterministic Automata for Hidden Markov Model Based Pattern Recognition Applications
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...
Frédéric Maire, Frank Wathne, Alain ...
CSFW
2000
IEEE
15 years 10 months ago
Information Flow Analysis in a Discrete-Time Process Algebra
Some of the non interference properties studied in [4, 6, 18] for information flow analysis in computer systems, notably Æ , are reformulated here in a realtime setting. This is...
Riccardo Focardi, Roberto Gorrieri, Fabio Martinel...
VLDB
2002
ACM
110views Database» more  VLDB 2002»
15 years 5 months ago
Extending an ORDBMS: The StateMachine Module
Extensibility is one of the mayor benefits of object-relational database management systems. We have used this system property to implement a StateMachine Module inside an object-...
Wolfgang Mahnke, Christian Mathis, Hans-Peter Stei...
IJCAI
1993
15 years 7 months ago
Provably Bounded Optimal Agents
Since its inception, arti cial intelligence has relied upon a theoretical foundation centred around perfect rationality as the desired property of intelligent systems. We argue, a...
Stuart J. Russell, Devika Subramanian, Ronald Parr