Sciweavers

8259 search results - page 83 / 1652
» On Generalized Feistel Networks
Sort
View
NETWORKS
2008
13 years 9 months ago
A Reach and Bound algorithm for acyclic dynamic-programming networks
Node pruning is a commonly used technique for solution acceleration in a dynamic programming network. In pruning, nodes are adaptively removed from the dynamic programming network...
Matthew D. Bailey, Robert L. Smith, Jeffrey M. Ald...
AUTOMATICA
2004
104views more  AUTOMATICA 2004»
13 years 9 months ago
Dynamics and stability in optical communication networks: a system theory framework
This paper addresses the problem of dynamics analysis in optical networks from a system control perspective. A general framework for
Lacra Pavel
EOR
2000
77views more  EOR 2000»
13 years 8 months ago
Training the random neural network using quasi-Newton methods
Training in the random neural network (RNN) is generally speci
Aristidis Likas, Andreas Stafylopatis
SUM
2009
Springer
14 years 3 months ago
Modeling Unreliable Observations in Bayesian Networks by Credal Networks
Bayesian networks are probabilistic graphical models widely employed in AI for the implementation of knowledge-based systems. Standard inference algorithms can update the beliefs a...
Alessandro Antonucci, Alberto Piatti
LCN
2008
IEEE
14 years 3 months ago
Reducing network cost of many-to-many communication in unidirectional WDM rings with network coding
—In this paper we address the problem of traffic grooming in WDM rings with all-to-all and its generalization to many-to-many service by using network coding. We consider minimi...
Long Long, Ahmed E. Kamal