Sciweavers

2754 search results - page 408 / 551
» Distributed Weighted Matching
Sort
View
IJCM
2002
92views more  IJCM 2002»
15 years 4 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»
15 years 3 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
NPL
1998
135views more  NPL 1998»
15 years 3 months ago
Local Adaptive Subspace Regression
Abstract. Incremental learning of sensorimotor transformations in high dimensional spaces is one of the basic prerequisites for the success of autonomous robot devices as well as b...
Sethu Vijayakumar, Stefan Schaal
TCAD
2002
134views more  TCAD 2002»
15 years 3 months ago
DS-LFSR: a BIST TPG for low switching activity
A test pattern generator (TPG) for built-in self-test (BIST), which can reduce switching activity during test application, is proposed. The proposed TPG, called dual-speed LFSR (DS...
Seongmoon Wang, Sandeep K. Gupta
TON
2002
123views more  TON 2002»
15 years 3 months ago
Utility-based rate control in the Internet for elastic traffic
In a communication network, a good rate allocation algorithm should reflect the utilities of the users while being fair. We investigate this fundamental problem of achieving the sy...
Richard J. La, Venkat Anantharam