Sciweavers

10263 search results - page 1817 / 2053
» From Use Cases to System Operation Specifications
Sort
View
IJFCS
2006
130views more  IJFCS 2006»
15 years 6 months ago
Mealy multiset automata
We introduce the networks of Mealy multiset automata, and study their computational power. The networks of Mealy multiset automata are computationally complete. 1 Learning from Mo...
Gabriel Ciobanu, Viorel Mihai Gontineac
183
Voted
ACL
1997
15 years 7 months ago
Approximating Context-Free Grammars with a Finite-State Calculus
Although adequate models of human language for syntactic analysis and semantic interpretation are of at least contextfree complexity, for applications such as speech processing in...
Edmund Grimley-Evans
ISTCS
1992
Springer
15 years 9 months ago
Concurrent Timestamping Made Simple
Concurrent Time-stamp Systems (ctss) allow processes to temporally order concurrent events in an asynchronous shared memorysystem, a powerful tool for concurrency control, serving...
Rainer Gawlick, Nancy A. Lynch, Nir Shavit
CORR
2010
Springer
185views Education» more  CORR 2010»
15 years 2 months ago
Analysing the behaviour of robot teams through relational sequential pattern mining
This report outlines the use of a relational representation in a Multi-Agent domain to model the behaviour of the whole system. A desired property in this systems is the ability of...
Grazia Bombini, Raquel Ros, Stefano Ferilli, Ramon...
CASES
2006
ACM
16 years 5 days ago
Code transformation strategies for extensible embedded processors
Embedded application requirements, including high performance, low power consumption and fast time to market, are uncommon in the broader domain of general purpose applications. I...
Paolo Bonzini, Laura Pozzi
« Prev « First page 1817 / 2053 Last » Next »