Sciweavers

437 search results - page 79 / 88
» Proving Termination by Divergence
Sort
View
INFSOF
2006
73views more  INFSOF 2006»
13 years 7 months ago
Theory and algorithms for slicing unstructured programs
Program slicing identifies parts of a program that potentially affect a chosen computation. It has many applications in software engineering, including maintenance, evolution and ...
Mark Harman, Arun Lakhotia, David Binkley
FUIN
2007
95views more  FUIN 2007»
13 years 7 months ago
Compositional Systems over Reducible Networks
Abstract. In the paper two notions related to local (distributed) computations are identified and discussed. The first one is the notion of reducible graphs. A graph is reducible...
Antoni W. Mazurkiewicz
TWC
2008
100views more  TWC 2008»
13 years 7 months ago
An Empirical Study on Time-Correlation of GSM Telephone Traffic
Abstract--In this paper, we investigate possible timecorrelation of answered call arrivals in sets of real GSM telephone traffic data. Instead of attempting to model the empirical ...
Stefano Bregni, Roberto Cioffi, Maurizio Decina
TWC
2008
80views more  TWC 2008»
13 years 7 months ago
Robust connectivity-aware energy-efficient routing for wireless sensor networks
In this paper, we consider a class of energy-aware routing algorithm that explicitly takes into account the connectivity of the remaining sensor network. In typical sensor network ...
Charles Pandana, K. J. Ray Liu
LOGCOM
2010
136views more  LOGCOM 2010»
13 years 6 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