Sciweavers

476 search results - page 80 / 96
» Information Algebras
Sort
View
JDA
2006
184views more  JDA 2006»
13 years 8 months ago
Dynamic shortest paths and transitive closure: Algorithmic techniques and data structures
In this paper, we survey fully dynamic algorithms for path problems on general directed graphs. In particular, we consider two fundamental problems: dynamic transitive closure and...
Camil Demetrescu, Giuseppe F. Italiano
JSAC
2007
102views more  JSAC 2007»
13 years 8 months ago
Partially-coherent distributed space-time codes with differential encoder and decoder
Abstract— Distributed space-time coding is a means of achieving diversity through cooperative communication in a wireless relay network. In this paper, we consider a transmission...
T. Kiran, B. Sundar Rajan
SIAMDM
2000
103views more  SIAMDM 2000»
13 years 8 months ago
Directional Routing via Generalized st-Numberings
We present a mathematical model for network routing based on generating paths in a consistent direction. Our development is based on an algebraic and geometric framework for defini...
Fred S. Annexstein, Kenneth A. Berman
IFM
2010
Springer
203views Formal Methods» more  IFM 2010»
13 years 7 months ago
A CSP Approach to Control in Event-B
Event-B has emerged as one of the dominant state-based formal techniques used for modelling control-intensive applications. Due to the blocking semantics of events, their ordering ...
Steve Schneider, Helen Treharne, Heike Wehrheim
LOGCOM
2010
136views more  LOGCOM 2010»
13 years 7 months ago
Combining Derivations and Refutations for Cut-free Completeness in Bi-intuitionistic Logic
Bi-intuitionistic logic is the union of intuitionistic and dual intuitionistic logic, and was introduced by Rauszer as a Hilbert calculus with algebraic and Kripke semantics. But ...
Rajeev Goré, Linda Postniece