Sciweavers

804 search results - page 29 / 161
» On the Termination of the Chase Algorithm
Sort
View
96
Voted
SIGCOMM
1995
ACM
15 years 1 months ago
A Mobile User Location Update and Paging Mechanism Under Delay Constraints
A mobile user location management mechanism is introduced that incorporates a distance based location update scheme and a paging mechanism that satis es prede ned delay requiremen...
Ian F. Akyildiz, Joseph S. M. Ho
103
Voted
AUTOMATICA
2007
70views more  AUTOMATICA 2007»
14 years 10 months ago
Squaring the circle: An algorithm for generating polyhedral invariant sets from ellipsoidal ones
This paper presents a new (geometrical) approach to the computation of polyhedral (robustly) positively invariant (PI) sets for general (possibly discontinuous) nonlinear discrete...
A. Alessio, Mircea Lazar, Alberto Bemporad, W. P. ...
75
Voted
SAC
2006
ACM
14 years 10 months ago
Design and implementation of a context-aware decision algorithm for heterogeneous networks
Wireless networks and mobile terminals are evolving towards being heterogeneous. In this environment, intelligent handover decision, beyond traditional ones that are based on only...
Tansir Ahmed, Kyandoghere Kyamakya, Markus Ludwig
82
Voted
INFOCOM
2008
IEEE
15 years 4 months ago
On Survivable Access Network Design: Complexity and Algorithms
Abstract— We consider the computational complexity and algorithm challenges in designing survivable access networks. With limited routing capability, the structure of an access n...
Dahai Xu, Elliot Anshelevich, Mung Chiang
90
Voted
APPROX
2006
Springer
106views Algorithms» more  APPROX 2006»
15 years 1 months ago
A Tight Lower Bound for the Steiner Point Removal Problem on Trees
Gupta (SODA'01) considered the Steiner Point Removal (SPR) problem on trees. Given an edge-weighted tree T and a subset S of vertices called terminals in the tree, find an edg...
Hubert T.-H. Chan, Donglin Xia, Goran Konjevod, An...