2124 search results - page 123 / 425 » Aggregating time partitions |
134
click to vote
COMPGEOM
1993
ACM
15 years 7 months ago
1993
ACM
For a polygon P, the bounded Voronoi diagram of P is a partition of P into regions assigned to the vertices of P. A point p inside P belongs to the region of a vertex v if and onl...
211
click to vote
ICDE
2006
IEEE
16 years 5 months ago
2006
IEEE
In a Mobile Ad-hoc Network (MANET), due to the mobility and energy limitations of nodes, disconnection and network partitioning occur frequently. In addition, transactions in many...
195
click to vote
IPPS
1997
IEEE
15 years 8 months ago
1997
IEEE
This paper presents a new fault-tolerant scheduling algorithm for multiprocessor hard-real-time systems. The so called partitioning method is used to schedule a set of tasks in a ...
136
click to vote
ICCAD
2004
IEEE
16 years 19 days ago
2004
IEEE
—In this paper, we present a new block budgeting algorithm which speeds up timing closure in timing driven hierarchical flows. After a brief description of the addressed flow, ...
167
Voted
RTSS
2003
IEEE
15 years 9 months ago
2003
IEEE
Data caches are essential in modern processors, bridging the widening gap between main memory and processor speeds. However, they yield very complex performance models, which make...