Sciweavers

1390 search results - page 165 / 278
» On the Algebraic Structure of Convergence
Sort
View
JALC
2002
97views more  JALC 2002»
15 years 6 months ago
Semiring Frameworks and Algorithms for Shortest-Distance Problems
We define general algebraic frameworks for shortest-distance problems based on the structure of semirings. We give a generic algorithm for finding single-source shortest distances...
Mehryar Mohri
JUCS
2002
113views more  JUCS 2002»
15 years 6 months ago
The Origins and the Development of the ASM Method for High Level System Design and Analysis
: The research belonging to the Abstract State Machines approach to system design and analysis is surveyed and documented in an annotated ASM bibliography. The survey covers the pe...
Egon Börger
IGPL
2010
156views more  IGPL 2010»
15 years 5 months ago
Fusion of sequent modal logic systems labelled with truth values
Fusion is a well-known form of combining normal modal logics endowed with a Hilbert calculi and a Kripke semantics. Herein, fusion is studied over logic systems using sequent calc...
João Rasga, Karina Roggia, Cristina Sernada...
GLOBECOM
2010
IEEE
15 years 4 months ago
Trusted Storage over Untrusted Networks
We consider distributed storage over two untrusted networks, whereby coding is used as a means to achieve a prescribed level of confidentiality. The key idea is to exploit the alge...
Paulo F. Oliveira, Luísa Lima, Tiago T. V. ...
ECSQARU
2009
Springer
15 years 4 months ago
Soft Constraints Processing over Divisible Residuated Lattices
We claim that divisible residuated lattices (DRLs) can act as a unifying evaluation framework for soft constraint satisfaction problems (soft CSPs). DRLs form the algebraic semanti...
Simone Bova