Sciweavers

1502 search results - page 30 / 301
» Node weighted scheduling
Sort
View
ICML
2010
IEEE
13 years 11 months ago
Random Spanning Trees and the Prediction of Weighted Graphs
We show that the mistake bound for predicting the nodes of an arbitrary weighted graph is characterized (up to logarithmic factors) by the cutsize of a random spanning tree of the...
Nicolò Cesa-Bianchi, Claudio Gentile, Fabio...
FORMATS
2008
Springer
13 years 11 months ago
Infinite Runs in Weighted Timed Automata with Energy Constraints
We study the problems of existence and construction of infinite schedules for finite weighted automata and one-clock weighted timed automata, subject to boundary constraints on the...
Patricia Bouyer, Ulrich Fahrenberg, Kim Guldstrand...
ICONIP
2007
13 years 11 months ago
Analysis on Bidirectional Associative Memories with Multiplicative Weight Noise
Abstract. In neural networks, network faults can be exhibited in different forms, such as node fault and weight fault. One kind of weight faults is due to the hardware or software ...
Chi-Sing Leung, Pui-Fai Sum, Tien-Tsin Wong
DPD
2007
84views more  DPD 2007»
13 years 9 months ago
Disseminating dependent data in wireless broadcast environments
In wireless mobile environments, data broadcasting is an effective approach to disseminate information to mobile clients. In some applications, the access pattern of all the data c...
Chuan-Ming Liu, Kun-Feng Lin
JCP
2008
121views more  JCP 2008»
13 years 9 months ago
Relation Organization of SOM Initial Map by Improved Node Exchange
The Self Organizing Map (SOM) involves neural networks, that learns the features of input data thorough unsupervised, competitive neighborhood learning. In the SOM learning algorit...
Tsutomu Miyoshi