Sciweavers

3552 search results - page 707 / 711
» Proof theory in the abstract
Sort
View
NDJFL
1998
105views more  NDJFL 1998»
14 years 11 months ago
Idempotent Full Paraconsistent Negations are not Algebraizable
Using methods of abstract logic and the theory of valuation, we prove that there is no paraconsistent negation obeying the law of double negation and such that ¬(a ∧ ¬a) is a t...
Jean-Yves Béziau
TELSYS
2002
131views more  TELSYS 2002»
14 years 11 months ago
Call Blocking Performance Study for PCS Networks under More Realistic Mobility Assumptions
Abstract. In the micro-cell-based PCS networks, due to the high user mobility, handoffs occur more frequently. Hence, the classical assumptions, such as the exponential assumptions...
Helen Zeng, Yuguang Fang, Imrich Chlamtac
TIT
2002
126views more  TIT 2002»
14 years 11 months ago
Two-dimensional interleaving schemes with repetitions: Constructions and bounds
Abstract--Two-dimensional interleaving schemes with repetitions are considered. These schemes are required for the correction of two-dimensional bursts (or clusters) of errors in a...
Tuvi Etzion, Alexander Vardy
JGO
2008
101views more  JGO 2008»
14 years 11 months ago
Dynamic equilibria of group vaccination strategies in a heterogeneous population
Abstract In this paper we present an evolutionary variational inequality model of vaccination strategies games in a population with a known vaccine coverage profile over a certain ...
Monica-Gabriela Cojocaru
IFM
2010
Springer
190views Formal Methods» more  IFM 2010»
14 years 10 months ago
On Model Checking Techniques for Randomized Distributed Systems
Abstract. The automata-based model checking approach for randomized distributed systems relies on an operational interleaving semantics of the system by means of a Markov decision ...
Christel Baier