1982 search results - page 272 / 397 » Designing Efficient Distributed Algorithms Using Sampling Te... |
154
click to vote
HIPC
2007
Springer
15 years 7 months ago
2007
Springer
First Come First Served (FCFS) is a policy that is accepted for implementing fairness in a number of application domains such as scheduling in Operating Systems, scheduling web req...
102
click to vote
DAC
2005
ACM
16 years 4 months ago
2005
ACM
Placement migration is the movement of cells within an existing placement to address a variety of post-placement design closure issues, such as timing, routing congestion, signal ...
141
click to vote
QOSA
2010
Springer
15 years 28 days ago
2010
Springer
Design decisions for complex, component-based systems impact multiple quality of service (QoS) properties. Often, means to improve one quality property deteriorate another one. In ...
111
click to vote
PLDI
2003
ACM
15 years 8 months ago
2003
ACM
Profiling can accurately analyze program behavior for select data inputs. We show that profiling can also predict program locality for inputs other than profiled ones. Here loc...
121
click to vote
COMPGEOM
2000
ACM
15 years 6 months ago
2000
ACM
The purpose of this paper is to present a new method to design exact geometric predicates in algorithms dealing with curved objects such as circular arcs. We focus on the comparis...