Sciweavers

1616 search results - page 66 / 324
» networks 2002
Sort
View
NPL
2002
151views more  NPL 2002»
13 years 9 months ago
Additive Composition of Supervised Self Organizing Maps
The learning of complex relationships can be decomposed into several neural networks. The modular organization is determined by prior knowledge of the problem that permits to split...
Jean-Luc Buessler, Jean-Philippe Urban, Julien Gre...
NETWORKS
2002
13 years 9 months ago
Node-disjoint paths and related problems on hierarchical cubic networks
An n-dimensional hierarchical cubic network (denoted by HCN(n)) contains 2 n n-dimensional hypercubes. The diameter of the HCN(n), which is equal to n+(n+1)/3+1, is about two-thir...
Jung-Sheng Fu, Gen-Huey Chen, Dyi-Rong Duh
IPPS
2002
IEEE
14 years 2 months ago
A Framework for Network Management Using Mobile Agents
Conventional network management is based on SNMP and often run in a centralized manner. Although the centralized management approach gives network administrators a flexibility of ...
Manoj Kumar Kona, Cheng-Zhong Xu
ICDCSW
2002
IEEE
14 years 2 months ago
Stability of Autonomous Decentralized Flow Control Schemes in High-Speed Networks
This paper focuses on flow control in high-speed networks. Each node in the networks handles its local traffic flow only on the basis of the information it knows, but it is pre...
Masaki Aida, Chisa Takano
EOR
2002
68views more  EOR 2002»
13 years 9 months ago
The computational complexity of the criticality problems in a network with interval activity times
The paper analyzes the criticality in a network with interval activities duration times. A natural generalization of the criticality notion (for a path, an activity and an event) ...
Stefan Chanas, Pawel Zielinski