3471 search results - page 610 / 695 » Obstacle Numbers of Graphs |
146
click to vote
ECBS
1999
IEEE
15 years 9 months ago
1999
IEEE
Researchers have defined a number of process modeling methods and have developed in-roads to process-centered environments that support process modeling and project control. Howev...
170
click to vote
IPPS
1999
IEEE
1999
IEEE
Visualization and Performance Prediction of Multithreaded Solaris Programs by Tracing Kernel Threads
15 years 9 months ago
Efficient performance tuning of parallel programs is often hard. We present a performance prediction and visualization tool called VPPB. Based on a monitored uni-processor executi...
126
click to vote
FOCS
1998
IEEE
15 years 9 months ago
1998
IEEE
In the Finite Capacity Dial-a-Ride problem the input is a metric space, a set of objects {di}, each specifying a source si and a destination ti, and an integer k--the capacity of t...
140
click to vote
IEEEPACT
1998
IEEE
15 years 9 months ago
1998
IEEE
Register coalescing is used, as part of register allocation, to reduce the number of register copies. Developing efficient register coalescing heuristics is particularly important ...
157
click to vote
IPPS
1998
IEEE
15 years 9 months ago
1998
IEEE
Boundeddegreenetworks like deBruijn graphsor wrapped butterfly networks are very important from VLSI implementation point of view as well as for applications where the computing n...