Sciweavers

658 search results - page 87 / 132
» Lower bounds for sorting networks
Sort
View
IPPS
1999
IEEE
14 years 20 hour ago
Optimal Scheduling Algorithms in WDM Optical Passive Star Networks
All-to-all broadcast scheduling problems are considered in WDM optical passive star networks where k wavelengths are available in the network. It is assumed that each node has exac...
Hongjin Yeh, Kyubum Wee, Manpyo Hong
ISTCS
1993
Springer
13 years 11 months ago
Analog Computation Via Neural Networks
We pursue a particular approach to analog computation, based on dynamical systems of the type used in neural networks research. Our systems have a xed structure, invariant in time...
Hava T. Siegelmann, Eduardo D. Sontag
CLUSTER
2001
IEEE
13 years 11 months ago
Using Multirail Networks in High-Performance Clusters
Using multiple independent networks (also known as rails) is an emerging technique to overcome bandwidth limitations and enhance fault tolerance of current high-performance parall...
Salvador Coll, Eitan Frachtenberg, Fabrizio Petrin...
CN
2006
82views more  CN 2006»
13 years 7 months ago
A cost-minimization algorithm for fast location tracking in mobile wireless networks
Location tracking is one of the most important issues in providing real-time applications over wireless networks due to its effect to quality of service (QoS), such as end-to-end ...
Wenye Wang, Guoliang Xue
COMCOM
2006
100views more  COMCOM 2006»
13 years 7 months ago
Routing and wavelength assignment for core-based tree in WDM networks
In this paper, we address the routing and wavelength assignment problem for the core-based tree (CBT) service in a wavelength-division-multiplexing (WDM) network, where k sources ...
Jianping Wang, Xiangtong Qi, Mei Yang