Sciweavers

14382 search results - page 341 / 2877
» Time in Connectionist Models
Sort
View
EWSN
2012
Springer
14 years 2 months ago
On the Optimal Blacklisting Threshold for Link Selection in Wireless Sensor Networks
Empirical studies on link blacklisting show that the delivery rate is very sensitive to the calibration of the blacklisting threshold. If the calibration is too restrictive (the th...
Flavio Fabbri, Marco Zuniga, Daniele Puccinelli, P...
SODA
2012
ACM
174views Algorithms» more  SODA 2012»
13 years 9 months ago
Using hashing to solve the dictionary problem
We consider the dictionary problem in external memory and improve the update time of the wellknown buffer tree by roughly a logarithmic factor. For any λ ≥ max{lg lg n, logM/B(...
John Iacono, Mihai Patrascu
TCS
2002
15 years 6 months ago
Automatic verification of real-time systems with discrete probability distributions
We consider the timed automata model of [3], which allows the analysis of realtime systems expressed in terms of quantitative timing constraints. Traditional approaches to real-ti...
Marta Z. Kwiatkowska, Gethin Norman, Roberto Segal...
ANSS
2000
IEEE
15 years 11 months ago
Multi-Resolution Modeling of Power Converter Using Waveform Reconstruction
Computer simulation of switching power converters is complicated by the discontinuous (switching) nature of the converter waveforms. When switching details of the waveforms are of...
Yuwei Luo, Roger Dougal, Enrico Santi
177
Voted
QUESTA
2006
119views more  QUESTA 2006»
15 years 6 months ago
Single-Server Queue with Markov-Dependent Inter-Arrival and Service Times
In this paper we study a single-server queue where the inter-arrival times and the service times depend on a common discrete time Markov Chain. This model generalizes the well-kno...
Ivo J. B. F. Adan, Vidyadhar G. Kulkarni