Sciweavers

1502 search results - page 259 / 301
» Node weighted scheduling
Sort
View
MOC
2000
173views more  MOC 2000»
13 years 8 months ago
Computation of Gauss-Kronrod quadrature rules
Recently Laurie presented a new algorithm for the computation of (2n+1)-point Gauss-Kronrod quadrature rules with real nodes and positive weights. This algorithm first determines a...
Daniela Calvetti, Gene H. Golub, William B. Gragg,...
IJCM
2002
92views more  IJCM 2002»
13 years 8 months ago
Random-tree Diameter and the Diameter-constrained MST
A minimum spanning tree (MST) with a small diameter is required in numerous practical situations. It is needed, for example, in distributed mutual exclusion algorithms in order to...
Ayman Abdalla, Narsingh Deo
APIN
1999
107views more  APIN 1999»
13 years 8 months ago
Massively Parallel Probabilistic Reasoning with Boltzmann Machines
We present a method for mapping a given Bayesian network to a Boltzmann machine architecture, in the sense that the the updating process of the resulting Boltzmann machine model pr...
Petri Myllymäki
RAS
2002
168views more  RAS 2002»
13 years 8 months ago
Neural predictive control for a car-like mobile robot
: This paper presents a new path-tracking scheme for a car-like mobile robot based on neural predictive control. A multi-layer back-propagation neural network is employed to model ...
Dongbing Gu, Huosheng Hu
TNN
1998
132views more  TNN 1998»
13 years 8 months ago
Synthesis of fault-tolerant feedforward neural networks using minimax optimization
—In this paper we examine a technique by which fault tolerance can be embedded into a feedforward network leading to a network tolerant to the loss of a node and its associated w...
Dipti Deodhare, M. Vidyasagar, S. Sathiya Keerthi