2467 search results - page 406 / 494 » Finite State Machines |
99
Voted
IANDC
2006
15 years 19 days ago
2006
We study three operational models of name-passing process calculi: coalgebras on (pre)sheaves, indexed labelled transition systems, and history dependent automata. The coalgebraic...
118
click to vote
CORR
2007
Springer
15 years 18 days ago
2007
Springer
: In the industry, numerous commercial packages provide tools to introduce, and analyse human behaviour in the product's environment (for maintenance, ergonomics...), thanks t...
110
Voted
JSAC
2008
15 years 18 days ago
2008
Abstract--In a downlink Orthogonal Frequency Division Multiple Access (OFDMA) system, optimally allocating sub-channels across mobile users can require excessive feedback of channe...
93
Voted
TIT
2008
15 years 16 days ago
2008
We investigate the decoding problem of Reed-Solomon (RS) Codes, also known as the Polynomial Reconstruction Problem (PR), from a cryptographic hardness perspective. Namely, we dea...
131
Voted
DC
1999
15 years 9 days ago
1999
or fault-tolerant asynchronous systems. It abstracts a family of problems known as Agreement (or Coordination) problems. Any solution to consensus can serve as a basic building blo...