Sciweavers

413 search results - page 32 / 83
» Are Hopfield Networks Faster than Conventional Computers
Sort
View
SC
1994
ACM
15 years 10 months ago
PARAMICS - moving vehicles on the connection machine
PARAMICS is a PARAllel MICroscopic Traffic Simulator which is, to our knowledge, the most powerful of its type in the world. The simulator can model around 200,000 vehicles on aro...
Gordon Cameron, Brian J. N. Wylie, David McArthur
PDCAT
2007
Springer
16 years 8 days ago
Optimal Routing in Binomial Graph Networks
A circulant graph with n nodes and jumps j1, j2, ..., jm is a graph in which each node i, 0 ≤ i ≤ n−1, is adjacent to all the vertices i±jk mod n, where 1 ≤ k ≤ m. A bi...
Thara Angskun, George Bosilca, Bradley T. Vander Z...
HPCA
1997
IEEE
15 years 10 months ago
A Performance Comparison of Hierarchical Ring- and Mesh-Connected Multiprocessor Networks
This paper compares the performance of hierarchical ring- and mesh-connected wormhole routed shared memory multiprocessor networks in a simulation study. Hierarchical rings are in...
Govindan Ravindran, Michael Stumm
159
Voted
CIBCB
2007
IEEE
15 years 10 months ago
Genetic Regulatory Network Modeling Using Network Component Analysis and Fuzzy Clustering
Gene regulatory network model is the most widely used mechanism to model and predict the behavior of living organisms. Network Component Analysis (NCA) as an emerging issue for unc...
Fatemeh Bakouie, Mohammad Hassan Moradi
153
Voted
ICPPW
2002
IEEE
15 years 11 months ago
System Services for Implementing Ad-Hoc Routing Protocols
This paper explores several systems issues regarding the implementation of routing protocols for mobile ad-hoc networks. It proclaims that support for on-demand routing is insufï¬...
Vikas Kawadia, Yongguang Zhang, Binita Gupta