1494 search results - page 272 / 299 » Polynomial time algorithms for network information flow |
IJCNN
2006
IEEE
14 years 2 months ago
2006
IEEE
— The present paper is devoted to the exploration of the properties of the simple spiking neuron model and quantification of the information transfer rate, which the separate neu...
CIKM
2010
Springer
13 years 7 months ago
2010
Springer
The cost of reachability query computation using traditional algorithms such as depth first search or transitive closure has been found to be prohibitive and unacceptable in mass...
INFORMS
1998
13 years 8 months ago
1998
High-level formalisms such as stochastic Petri nets can be used to model complex systems. Analysis of logical and numerical properties of these models often requires the generatio...
CN
2006
13 years 8 months ago
2006
This paper focuses on the protection of virtual circuits (Label Switched Paths, LSPs) in a (G)MPLS (Generalised Multi-Protocol Label Switching) network. The proposed algorithm is ...
WWW
2006
ACM
14 years 9 months ago
2006
ACM
Wide-area distributed applications are challenging to debug, optimize, and maintain. We present Wide-Area Project 5 (WAP5), which aims to make these tasks easier by exposing the c...