Sciweavers

1246 search results - page 129 / 250
» Recursive Timed Automata
Sort
View
QUESTA
2010
86views more  QUESTA 2010»
14 years 12 months ago
Tandem queues with subexponential service times and finite buffers
We focus on tandem queues with subexponential service time distributions. We assume that number of customers in front of the first station is infinite and there is infinite room f...
Jung-Kyung Kim, Hayriye Ayhan
138
Voted
INFOCOM
2003
IEEE
15 years 10 months ago
The Waiting Time Distribution for a TDMA Model with a Finite Buffer
—We obtain detailed analytic formulas for the density and probability distribution of the waiting time in a time-division multiple-access (TDMA) model with a finite buffer and s...
Marcel F. Neuts, Jun Guo, Moshe Zukerman, Hai Le V...
FLAIRS
2001
15 years 6 months ago
Time Series Analysis Using Unsupervised Construction of Hierarchical Classifiers
Recently we have proposed an algorithm of constructing hierarchical neural network classifiers (HNNC), that is based on a modification of error back-propagation. This algorithm co...
S. A. Dolenko, Yu. V. Orlov, I. G. Persiantsev, Ju...
164
Voted
ISAAC
2010
Springer
240views Algorithms» more  ISAAC 2010»
15 years 3 months ago
Interpretation of Stream Programs: Characterizing Type 2 Polynomial Time Complexity
We study polynomial time complexity of type 2 functionals. For that purpose, we introduce a first order functional stream language. We give criteria, named well-founded, on such pr...
Hugo Férée, Emmanuel Hainry, Mathieu...
113
Voted
GLOBECOM
2009
IEEE
15 years 12 months ago
Optimal Relay-Subset Selection and Time-Allocation in Decode-and-Forward Cooperative Networks
—We present the optimal relay-subset selection and transmission-time for a decode-and-forward, half-duplex cooperative network of arbitrary size. The resource allocation is obtai...
Elzbieta Beres, Raviraj Adve