Sciweavers

2124 search results - page 122 / 425
» Aggregating time partitions
Sort
View
RTAS
1996
IEEE
15 years 7 months ago
Evaluation of Wireless Soft Real-Time Protocols
Communication between current military real-time systems and future interconnection of general purpose, embedded real-time systems will often require wireless communications. Howe...
Michael J. Markowski, Adarshpal S. Sethi
124
Voted
NIPS
2008
15 years 5 months ago
Local Gaussian Process Regression for Real Time Online Model Learning
Learning in real-time applications, e.g., online approximation of the inverse dynamics model for model-based robot control, requires fast online regression techniques. Inspired by...
Duy Nguyen-Tuong, Matthias Seeger, Jan Peters
SWAT
2004
Springer
123views Algorithms» more  SWAT 2004»
15 years 9 months ago
A Simple Linear-Time Modular Decomposition Algorithm for Graphs, Using Order Extension
The first polynomial time algorithm (O(n4 )) for modular decomposition appeared in 1972 [8] and since then there have been incremental improvements, eventually resulting in linear...
Michel Habib, Fabien de Montgolfier, Christophe Pa...
DAM
2006
79views more  DAM 2006»
15 years 3 months ago
A simple expected running time analysis for randomized "divide and conquer" algorithms
There are many randomized "divide and conquer" algorithms, such as randomized Quicksort, whose operation involves partitioning a problem of size n uniformly at random int...
Brian C. Dean
RTCSA
2005
IEEE
15 years 9 months ago
Real-Time Scheduling of Sporadic Task Systems When the Number of Distinct Task Types Is Small
In some real-time application systems, there are only a few distinct kinds of tasks, each of which may be instantiated several times during runtime. The scheduling of such sporadi...
Sanjoy K. Baruah, Nathan Fisher