Sciweavers

983 search results - page 108 / 197
» Negative-Weight Cycle Algorithms
Sort
View
TACAS
1998
Springer
115views Algorithms» more  TACAS 1998»
15 years 5 months ago
MESA: Support for Scenario-Based Design of Concurrent Systems
The latest ITU-T standard syntax of Message Sequence Charts (MSCs) 16] o ers several operators to compose MSCs in a hierarchical, iterating, and nondeterministic way. However, curr...
Hanêne Ben-Abdallah, Stefan Leue
ICDCS
1996
IEEE
15 years 5 months ago
Larchant: Persistence by Reachability in Distributed Shared Memory Through Garbage Collection
We consider a shared store based on distributed shared memory (DSM), supporting persistence by reachability (PBR), a very simple data sharing model for a distributed system. This ...
Paulo Ferreira, Marc Shapiro
90
Voted
ICC
2007
IEEE
150views Communications» more  ICC 2007»
15 years 4 months ago
ACE Spectrum of LDPC Codes and Generalized ACE Design
The construction of good, finite-length, LDPC codes is currently an attractive research area. Reducing attention to the Binary Erasure Channel (BEC), this problem translates into t...
Dejan Vukobratovic, Aleksandar Djurendic, Vojin Se...
99
Voted
ICCAD
1995
IEEE
106views Hardware» more  ICCAD 1995»
15 years 4 months ago
Re-engineering of timing constrained placements for regular architectures
In a typical design ow, the design may be altered slightly several times after the initial design cycle according to minor changes in the design speci cation either as a result o...
Anmol Mathur, K. C. Chen, C. L. Liu
FOCS
1994
IEEE
15 years 4 months ago
Finding the k Shortest Paths
We describe algorithms for finding the k shortest paths connecting a given pair of vertices in a digraph (allowing cycles). Our algorithms output an implicit representation of the...
David Eppstein