Sciweavers

5981 search results - page 65 / 1197
» time 2006
Sort
View
RTS
2000
82views more  RTS 2000»
14 years 11 months ago
Priority Scheduling Versus Pre-Run-Time Scheduling
Builders of real-time systems often use priority scheduling in their systems without considering alternatives. This paper examines one alternative, pre-run-time scheduling, and sho...
Jia Xu, David Lorge Parnas
JPDC
2002
104views more  JPDC 2002»
14 years 11 months ago
Fully dynamic distributed search trees can be balanced in O(lg2 N) time
In this paper we consider the dictionary problem in a message-passing distributed environment. We introduce a new version, based on AVL-trees, of distributed search trees, the fir...
Fabio Barillari, Enrico Nardelli, Massimo Pepe
103
Voted
RTS
1998
104views more  RTS 1998»
14 years 11 months ago
Real-Time Schedulability Tests for Preemptive Multitasking
When developing multitasking real-time systems, schedulability tests are used to formally prove that a given task set will meet its deadlines. A wide range of such tests have appe...
Colin J. Fidge
IPL
2010
79views more  IPL 2010»
14 years 10 months ago
Unrestricted and complete Breadth-First Search of trapezoid graphs in O(n) time
We present an O(n) Breadth-First Search algorithm for trapezoid graphs, which takes as input a trapezoid model and any priority order on the vertices. Our algorithm is the first ...
Christophe Crespelle, Philippe Gambette
MST
2010
81views more  MST 2010»
14 years 10 months ago
Quantum Search with Variable Times
Since Grover’s seminal work, quantum search has been studied in great detail. In the usual search problem, we have a collection of n items x1, . . . , xn and we would like
Andris Ambainis