Sciweavers

3268 search results - page 569 / 654
» The hub number of a graph
Sort
View
87
Voted
ASPDAC
2000
ACM
95views Hardware» more  ASPDAC 2000»
15 years 4 months ago
FSM decomposition by direct circuit manipulation applied to low power design
Abstract— Clock-gating techniques are very effective in the reduction of the switching activity in sequential logic circuits. In particular, recent work has shown that significa...
José C. Monteiro, Arlindo L. Oliveira
COMPGEOM
2000
ACM
15 years 4 months ago
Kinetic connectivity for unit disks
We describe a kinetic data structure (KDS) that maintains the connected components of the union of a set of unit-radius disks moving in the plane. We assume that the motion of eac...
Leonidas J. Guibas, John Hershberger, Subhash Suri...
ECBS
1999
IEEE
129views Hardware» more  ECBS 1999»
15 years 4 months ago
Situation Assessment and Decision Making Integrated into the Process Centered Environment
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...
Stephanie White, Susan Fife Dorchak, John T. Keane...
IPPS
1999
IEEE
15 years 4 months ago
Visualization and Performance Prediction of Multithreaded Solaris Programs by Tracing Kernel Threads
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...
Magnus Broberg, Lars Lundberg, Håkan Grahn
FOCS
1998
IEEE
15 years 4 months ago
The Finite Capacity Dial-A-Ride Problem
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...
Moses Charikar, Balaji Raghavachari