Sciweavers

8825 search results - page 190 / 1765
» All for one or one for all
Sort
View
ENDM
2007
78views more  ENDM 2007»
15 years 1 months ago
The Interval Liar Game
We regard the problem of communication in the presence of faulty transmissions. In contrast to the classical works in this area, we assume some structure on the times when the faul...
Benjamin Doerr, Johannes Lengler, David Steurer
NAR
2006
71views more  NAR 2006»
15 years 1 months ago
TSEMA: interactive prediction of protein pairings between interacting families
An entire family of methodologies for predicting protein interactions is based on the observed fact that families of interacting proteins tend to have similar phylogenetic trees d...
José M. G. Izarzugaza, David de Juan, Carle...
NN
2006
Springer
127views Neural Networks» more  NN 2006»
15 years 1 months ago
The asymptotic equipartition property in reinforcement learning and its relation to return maximization
We discuss an important property called the asymptotic equipartition property on empirical sequences in reinforcement learning. This states that the typical set of empirical seque...
Kazunori Iwata, Kazushi Ikeda, Hideaki Sakai
ADHOC
2005
102views more  ADHOC 2005»
15 years 1 months ago
Localized LMST and RNG based minimum-energy broadcast protocols in ad hoc networks
In the minimum energy broadcasting problem, each node adjusts its transmission power to minimize the total energy consumption while still guaranteeing the full coverage of the net...
Julien Cartigny, François Ingelrest, David ...
TCS
2008
15 years 1 months ago
Cleaning a network with brushes
Following the decontamination metaphor for searching a graph, we introduce a cleaning process, which is related to both the chip-firing game and edge searching. Brushes (instead o...
Margaret-Ellen Messinger, Richard J. Nowakowski, P...