Sciweavers

592 search results - page 97 / 119
» Crossing numbers of random graphs
Sort
View
SBACPAD
2006
IEEE
148views Hardware» more  SBACPAD 2006»
14 years 1 months ago
Scalable Parallel Implementation of Bayesian Network to Junction Tree Conversion for Exact Inference
We present a scalable parallel implementation for converting a Bayesian network to a junction tree, which can then be used for a complete parallel implementation for exact inferen...
Vasanth Krishna Namasivayam, Animesh Pathak, Vikto...
COCOON
2005
Springer
14 years 1 months ago
Construction of Scale-Free Networks with Partial Information
It has recently been observed that the node degrees of many real-world large-scale networks, such as the Internet and the Web, follow a power law distributions. Since the classical...
Jianyang Zeng, Wen-Jing Hsu, Suiping Zhou
FPGA
1997
ACM
145views FPGA» more  FPGA 1997»
14 years 2 days ago
Generation of Synthetic Sequential Benchmark Circuits
Programmable logic architectures increase in capacity before commercial circuits are designed for them, yielding a distinct problem for FPGA vendors: how to test and evaluate the ...
Michael D. Hutton, Jonathan Rose, Derek G. Corneil
MABS
2000
Springer
13 years 11 months ago
Effects of Interaction Topology and Activation Regime in Several Multi-Agent Systems
The effects of distinct agent interaction and activation structures are compared and contrasted in several multi-agent models of social phenomena. Random graphs and lattices repre...
Robert L. Axtell
TCOM
2010
65views more  TCOM 2010»
13 years 2 months ago
Max-matching diversity in OFDMA systems
Abstract--This paper considers the problem of optimal subcarrier allocation in OFDMA systems to achieve the minimum outage probability while guaranteeing fairness. The optimal subc...
Bo Bai, Wei Chen, Zhigang Cao, Khaled Ben Letaief