Sciweavers

2272 search results - page 149 / 455
» Capture Complexity by Partition
Sort
View
GLOBECOM
2006
IEEE
15 years 9 months ago
Link Performance Bounds in Homogeneous Optically Switched Ring Networks
— We consider a ring topology with limited or full switching capability as deployed in high bandwidth metro optical networks and develop a model to estimate the probability of bl...
Shujia Gong, Bijan Jabbari
GLOBECOM
2006
IEEE
15 years 9 months ago
Efficient Construction of Weakly-Connected Dominating Set for Clustering Wireless Ad Hoc Networks
In most of the proposed clustering algorithms for wireless ad hoc networks, the cluster-heads form a dominating set in the network topology. A variant of dominating set which is mo...
Bo Han, Weijia Jia
FDL
2005
IEEE
15 years 8 months ago
Integrating Model-Checking with UML-based SoC Development
In order to address the complexities of SoC design, rigorous development methods and automated tools are required. This paper presents an approach to formal verification using mod...
Peter Green, Kinika Tasie-Amadi
ISAAC
2005
Springer
86views Algorithms» more  ISAAC 2005»
15 years 8 months ago
On the Computation of Colored Domino Tilings of Simple and Non-simple Orthogonal Polygons
We explore the complexity of computing tilings of orthogonal polygons using colored dominoes. A colored domino is a rotatable 2 × 1 rectangle that is partitioned into two unit squ...
Chris Worman, Boting Yang
MIDDLEWARE
2005
Springer
15 years 8 months ago
Combining Flexibility and Scalability in a Peer-to-Peer Publish/Subscribe System
The content-based publish/subscribe model has been adopted by many services to deliver data between distributed users based on application-specific semantics. Two key issues in su...
Chi Zhang, Arvind Krishnamurthy, Randolph Y. Wang,...