Sciweavers

1538 search results - page 107 / 308
» Relative Randomness and Cardinality
Sort
View
WDAG
2005
Springer
100views Algorithms» more  WDAG 2005»
15 years 3 months ago
The Dynamic And-Or Quorum System
We investigate issues related to the probe complexity of the And-Or quorum system and its implementation in a dynamic environment. Our contribution is twofold: We first analyze th...
Uri Nadav, Moni Naor
WOLLIC
2010
Springer
15 years 3 months ago
Modal Logics with Counting
Abstract. We present a modal language that includes explicit operators to count the number of elements that a model might include in the extension of a formula, and we discuss how ...
Carlos Areces, Guillaume Hoffmann, Alexandre Denis
STACS
1993
Springer
15 years 2 months ago
The Complexity of Logic-Based Abduction
Abduction is an important form of nonmonotonic reasoning allowing one to find explanations for certain symptoms or manifestations. When the application domain is described by a l...
Thomas Eiter, Georg Gottlob
CN
2008
106views more  CN 2008»
14 years 10 months ago
Efficient virtual-backbone routing in mobile ad hoc networks
Since the physical topology of Mobile Ad hoc Networks (MANETs) is generally unstable, an appealing approach is the construction of a stable and robust virtual topology or backbone...
Jamal N. Al-Karaki, Ahmed E. Kamal
JAR
2006
236views more  JAR 2006»
14 years 10 months ago
Deciding Boolean Algebra with Presburger Arithmetic
We describe an algorithm for deciding the first-order multisorted theory BAPA, which combines 1) Boolean algebras of sets of uninterpreted elements (BA) and 2) Presburger arithmeti...
Viktor Kuncak, Huu Hai Nguyen, Martin C. Rinard