Sciweavers

6142 search results - page 370 / 1229
» The Complexity of Partition Functions
Sort
View
GLOBECOM
2006
IEEE
16 years 23 days 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
16 years 23 days 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
16 years 10 days 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
205
Voted
ACMICEC
2005
ACM
151views ECommerce» more  ACMICEC 2005»
16 years 8 days ago
Product knowledge reasoning: a DL-based approach
In order to capture the full fledge semantic of complicated product data model, the expressive language ALCNHR+ K(D) is introduced. It cannot only be able to represent knowledge a...
Nizamuddin Channa, Shanping Li, Xiangjun Fu
ISAAC
2005
Springer
86views Algorithms» more  ISAAC 2005»
16 years 6 days 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