Sciweavers

2356 search results - page 8 / 472
» Characterizations of postman sets
Sort
View
CORR
2011
Springer
149views Education» more  CORR 2011»
13 years 4 months ago
Solving k-Set Agreement with Stable Skeleton Graphs
In this paper we consider the k-set agreement problem in distributed round-based systems where processes communicate by message passing. We capture the synchrony and reliability o...
Martin Biely, Peter Robinson, Ulrich Schmid
TSMC
2010
13 years 4 months ago
Invariant Set of Weight of Perceptron Trained by Perceptron Training Algorithm
In this paper, an invariant set of the weight of the perceptron trained by the perceptron training algorithm is defined and characterized. The dynamic range of the steady state va...
Charlotte Yuk-Fan Ho, Bingo Wing-Kuen Ling, Herber...
JC
2011
102views more  JC 2011»
13 years 4 months ago
Tractability of tensor product problems in the average case setting
It has been an open problem to derive a necessary and sufficient condition for a linear tensor product problem S = {Sd} in the average case setting to be weakly tractable but not ...
Anargyros Papageorgiou, Iasonas Petras
CN
1999
100views more  CN 1999»
13 years 9 months ago
Testing protocols modeled as FSMs with timing parameters
An optimization method is introduced for generating minimum-length test sequences taking into account timing constraints for FSM models of communication protocols. Due to active t...
M. Ümit Uyar, Mariusz A. Fecko, Adarshpal S. ...
ISQED
2009
IEEE
70views Hardware» more  ISQED 2009»
14 years 4 months ago
On-chip transistor characterization arrays with digital interfaces for variability characterization
An on-chip test-and-measurement system with digital interfaces that can perform device-level characterization of large-dense arrays of transistors is demonstrated in 90- and 65-nm...
Simeon Realov, William McLaughlin, Kenneth L. Shep...