Sciweavers

534 search results - page 62 / 107
» Proving Termination of Rewrite Systems Using Bounds
Sort
View
TWC
2008
80views more  TWC 2008»
13 years 8 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
ENTCS
2000
114views more  ENTCS 2000»
13 years 8 months ago
Syntactic Type Soundness for the Region Calculus
The region calculus of Tofte and Talpin is an annotated polymorphically typed lambda calculus which makes memory allocation and deallocation explicit. It is intended as an interme...
Simon Helsen, Peter Thiemann
ISCAS
2008
IEEE
343views Hardware» more  ISCAS 2008»
14 years 3 months ago
Rigorous study of short periodic orbits for the Lorenz system
— The existence of short periodic orbits for the Lorenz system is studied rigorously. We describe a method for finding all short cycles embedded in a chaotic singular attractor ...
Zbigniew Galias, Warwick Tucker
POPL
2010
ACM
14 years 6 months ago
Nominal System T
This paper introduces a new recursion principle for inductive data modulo -equivalence of bound names. It makes use of Oderskystyle local names when recursing over bound names. It...
Andrew M. Pitts
JSAC
2010
92views more  JSAC 2010»
13 years 7 months ago
Analysis of Nonlinear Transition Shift and Write Precompensation in Perpendicular Recording Systems
Abstract—In high density perpendicular magnetic recording channels, nonlinear transition shift (NLTS) is one of the distortions that can degrade the system performance. Write pre...
Zheng Wu, Paul H. Siegel, Jack K. Wolf, H. Neal Be...