501 search results - page 53 / 101 » An Upper Bound on the Number of Rectangulations of a Point S... |
EDCC
2008
Springer
13 years 9 months ago
2008
Springer
We present the design, correctness, and analysis of SONDe, a simple fully decentralized object deployment algorithm for highly requested systems. Given an object (service or data)...
PIMRC
2008
IEEE
14 years 2 months ago
2008
IEEE
— In the opportunistic power control algorithm (OPC), designed in [1], [2], each user tries to keep the product of its transmit power and its experienced effective interference t...
SIAMCOMP
1998
13 years 7 months ago
1998
Motivated by applications in computer graphics, visualization, and scienti c computation, we study the computational complexity of the following problem: Given a set S of n points...
APN
1999
Springer
13 years 12 months ago
1999
Springer
Abstract. Symbolic techniques based on BDDs (Binary Decision Diagrams) have emerged as an e cient strategy for the analysis of Petri nets. The existing techniques for the symbolic ...
AUTOMATICA
2004
13 years 7 months ago
2004
In any real-life identification problem, only a finite number of data points is available. On the other hand, almost all results in stochastic identification pertain to asymptotic...