Sciweavers

62 search results - page 10 / 13
» Two Moments of the Logitnormal Distribution
Sort
View
TAMC
2007
Springer
15 years 4 months ago
Improving the Average Delay of Sorting
In previous work we have introduced an average-case measure for the time complexity of Boolean circuits – that is the delay between feeding the input bits into a circuit and the ...
Andreas Jakoby, Maciej Liskiewicz, Rüdiger Re...
EOR
2008
106views more  EOR 2008»
14 years 10 months ago
Analysis of a discrete-time preemptive resume priority buffer
In this paper, we analyze a discrete-time preemptive resume priority queue. We consider two classes of customers which have to be served, where customers of one class have preempt...
Joris Walraevens, Bart Steyaert, Herwig Bruneel
SIGMETRICS
1998
ACM
15 years 2 months ago
Scheduling Policies to Support Distributed 3D Multimedia Applications
We consider the problem of scheduling tasks with unpredictable service times on distinct processing nodes so as to meet a real-time deadline, given that all communication among no...
Thu D. Nguyen, John Zahorjan
TIT
2011
134views more  TIT 2011»
14 years 4 months ago
Estimating Heavy-Tail Exponents Through Max Self-Similarity
: In this paper, a novel approach to the problem of estimating the heavy–tail exponent α > 0 of a distribution is proposed. It is based on the fact that block–maxima of siz...
Stilian Stoev, George Michailidis, Murad S. Taqqu
AUTOMATICA
2006
178views more  AUTOMATICA 2006»
14 years 10 months ago
Decentralized adaptive coordinated control of multiple robot arms without using a force sensor
This paper presents a distributed adaptive coordinated control method for multiple robot arms grasping a common object. The cases of rigid contact and rolling contact are analyzed...
Haruhisa Kawasaki, Satoshi Ueki, Satoshi Ito