Sciweavers

7311 search results - page 164 / 1463
» Time in State Machines
Sort
View
ACL
1997
15 years 5 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
AAMAS
2005
Springer
15 years 4 months ago
Cooperative Multi-Agent Learning: The State of the Art
Cooperative multi-agent systems are ones in which several agents attempt, through their interaction, to jointly solve tasks or to maximize utility. Due to the interactions among t...
Liviu Panait, Sean Luke
CONCUR
2003
Springer
15 years 9 months ago
Composition of Cryptographic Protocols in a Probabilistic Polynomial-Time Process Calculus
We describe a probabilistic polynomial-time process calculus for analyzing cryptographic protocols and use it to derive compositionality properties of protocols in the presence of ...
Paulo Mateus, John C. Mitchell, Andre Scedrov
ALT
2010
Springer
14 years 11 months ago
PageRank Optimization in Polynomial Time by Stochastic Shortest Path Reformulation
Abstract. The importance of a node in a directed graph can be measured by its PageRank. The PageRank of a node is used in a number of application contexts
Balázs Csanád Csáji, Rapha&eu...
131
Voted
DATE
2009
IEEE
178views Hardware» more  DATE 2009»
15 years 11 months ago
Correct-by-construction generation of device drivers based on RTL testbenches
Abstract—The generation of device drivers is a very time consuming and error prone activity. All the strategies proposed up to now to simplify this operation require a manual, ev...
Nicola Bombieri, Franco Fummi, Graziano Pravadelli...