Sciweavers

142 search results - page 26 / 29
» Proving Termination by Invariance Relations
Sort
View
DBPL
1999
Springer
109views Database» more  DBPL 1999»
13 years 11 months ago
Expressing Topological Connectivity of Spatial Databases
We consider two-dimensional spatial databases defined in terms of polynomial inequalities and focus on the potential of programming languages for such databases to express queries...
Floris Geerts, Bart Kuijpers
WEA
2010
Springer
284views Algorithms» more  WEA 2010»
14 years 2 months ago
Paging Multiple Users in Cellular Network: Yellow Page and Conference Call Problems
Abstract. Mobile users are roaming in a zone of cells in a cellular network system. The probabilities of each user residing in each cell are known, and all probabilities are indepe...
Amotz Bar-Noy, Panagiotis Cheilaris, Yi Feng 0002
CDC
2008
IEEE
109views Control Systems» more  CDC 2008»
14 years 1 months ago
MPC for tracking with optimal closed-loop performance
— This paper deals with the tracking problem for constrained linear systems using a model predictive control (MPC) law. As it is well known, MPC provides a control law suitable f...
Antonio Ferramosca, Daniel Limón, Ignacio A...
PKC
2009
Springer
129views Cryptology» more  PKC 2009»
13 years 12 months ago
Zero-Knowledge Proofs with Witness Elimination
Abstract. Zero-knowledge proofs with witness elimination are protocols that enable a prover to demonstrate knowledge of a witness to the verifier that accepts the interaction prov...
Aggelos Kiayias, Hong-Sheng Zhou
JFP
2000
91views more  JFP 2000»
13 years 7 months ago
Uniform confluence in concurrent computation
Indeterminism is typical for concurrent computation. If several concurrent actors compete for the same resource then at most one of them may succeed, whereby the choice of the suc...
Joachim Niehren