Sciweavers

2467 search results - page 146 / 494
» Finite State Machines
Sort
View
ALT
2002
Springer
16 years 3 months ago
How to Achieve Minimax Expected Kullback-Leibler Distance from an Unknown Finite Distribution
Abstract. We consider a problem that is related to the “Universal Encoding Problem” from information theory. The basic goal is to find rules that map “partial information”...
Dietrich Braess, Jürgen Forster, Tomas Sauer,...
EUROSYS
2006
ACM
16 years 3 months ago
The SMART way to migrate replicated stateful services
Many stateful services use the replicated state machine approach for high availability. In this approach, a service runs on multiple machines to survive machine failures. This pap...
Jacob R. Lorch, Atul Adya, William J. Bolosky, Ron...
APSEC
2008
IEEE
16 years 1 months ago
Jackson's JSP-Like Method for State Transition Design
This paper presents an idea to apply Jackson’s JSP method, which is suitable for the transformation problem frame, into the state transition design, presented in the behavior pr...
Osamu Shigo
JUCS
2006
121views more  JUCS 2006»
15 years 6 months ago
On-line Monitoring of Metric Temporal Logic with Time-Series Constraints Using Alternating Finite Automata
: In this paper we describe a technique for monitoring and checking temporal logic assertions augmented with real-time and time-series constraints, or Metric Temporal Logic Series ...
Doron Drusinsky
GLOBECOM
2010
IEEE
15 years 3 months ago
Mutual Information of MIMO Transmission over Correlated Channels with Finite Symbol Alphabets and Link Adaptation
In this paper, results on the mutual information of MIMO transmission over spatially correlated channels in slow fading environments are presented. Different receiver techniques su...
Eckhard Ohlmer, Udo Wachsmann, Gerhard Fettweis