397 search results - page 54 / 80 » Inversion in Time |
SWAT
2004
Springer
15 years 3 months ago
2004
Springer
We show that any priority queue data structure that supports insert, delete, and find-min operations in pq(n) time, when n is an upper bound on the number of elements in the prio...
AIPS
2007
15 years 4 days ago
2007
Many scheduling problems reside in uncertain and dynamic environments – tasks have a nonzero probability of failure and may need to be rescheduled. In these cases, an optimized ...
BPM
2009
Springer
15 years 1 months ago
2009
Springer
Abstract. Enterprises are finding limitations with current modelling and hierarchical methodologies which have human agents as a key component. By requiring a priori knowledge of b...
ICC
2009
IEEE
15 years 4 months ago
2009
IEEE
—Finding the most likely path satisfying a requested additive Quality-of-Service (QoS) value, such as delay, when link metrics are defined as random variables by known probabili...
ICASSP
2008
IEEE
15 years 4 months ago
2008
IEEE
This paper derives the Cramer-Rao lower bound (CRLB) on estimates of the frequency of a coherent pulse-train passively intercepted at a moving antenna. Such estimates are used to ...