5005 search results - page 390 / 1001 » The Design and Analysis of Parallel Algorithms |
160
Voted
CORR
2010
Springer
15 years 6 months ago
2010
Springer
During the last decade, incremental sampling-based motion planning algorithms, such as the Rapidly-exploring Random Trees (RRTs), have been shown to work well in practice and to po...
184
click to vote
DATE
2003
IEEE
16 years 19 hour ago
2003
IEEE
This paper proposes a novel methodology tailored to design embedded systems, taking into account the emerging market needs, such as hw/sw partitioning, object-oriented specificati...
185
Voted
WABI
2005
Springer
16 years 6 days ago
2005
Springer
Motifs in a network are small connected subnetworks that occur in significantly higher frequencies than in random networks. They have recently gathered much attention as a useful ...
203
click to vote
INFOCOM
2002
IEEE
15 years 11 months ago
2002
IEEE
Abstract—Packet delay traces are important measurements for analyzing end-to-end performance and for designing traffic control algorithms in computer networks. Due to the fact t...
178
click to vote
RTSS
2006
IEEE
16 years 22 days ago
2006
IEEE
We present an optimal real-time scheduling algorithm for multiprocessors — one that satisfies all task deadlines, when the total utilization demand does not exceed the utilizat...