Sciweavers

1716 search results - page 135 / 344
» Proving Conditional Termination
Sort
View
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
IFIPTCS
2010
13 years 6 months ago
Deterministic Computations in Time-Varying Graphs: Broadcasting under Unstructured Mobility
Most highly dynamic infrastructure-less networks have in common that the assumption of connectivity does not necessarily hold at a given instant. Still, communication routes can be...
Arnaud Casteigts, Paola Flocchini, Bernard Mans, N...
CORR
2011
Springer
200views Education» more  CORR 2011»
13 years 4 months ago
Optimal Channel Training in Uplink Network MIMO Systems
We consider a multi-cell frequency-selective fading uplink channel (network MIMO) from K singleantenna user terminals (UTs) to B cooperative base stations (BSs) with M antennas ea...
Jakob Hoydis, Mari Kobayashi, Mérouane Debb...
MONET
2011
13 years 3 months ago
On Adaptive Density Deployment to Mitigate the Sink-Hole Problem in Mobile Sensor Networks
Abstract The use of mobile sensors is of great relevance to monitor critical areas where sensors cannot be deployed manually. The presence of data collector sinks causes increased ...
Novella Bartolini, Tiziana Calamoneri, Annalisa Ma...
JCS
2010
80views more  JCS 2010»
13 years 3 months ago
Constraint differentiation: Search-space reduction for the constraint-based analysis of security protocols
We introduce constraint differentiation, a powerful technique for reducing search when model-checking security protocols using constraint-based methods. Constraint differentiation...
Sebastian Mödersheim, Luca Viganò, Dav...