Sciweavers

1754 search results - page 142 / 351
» The Computational Complexity of Delay Management
Sort
View
WSCG
2001
77views more  WSCG 2001»
15 years 8 months ago
Physics-Enhanced L-Systems
In computer graphics and engineering many classes of complex objects can be designed with L-systems. We present a concept for enhancing timed and parametric L-systems with physics...
Hansrudi Noser, S. Rudolph, Peter Stucki
IPPS
2006
IEEE
16 years 1 months ago
Concurrent counting is harder than queuing
In both distributed counting and queuing, processors in a distributed system issue operations which are organized into a total order. In counting, each processor receives the rank...
Srikanta Tirthapura, Costas Busch
DAC
2000
ACM
16 years 8 months ago
Symbolic timing simulation using cluster scheduling
We recently introduced symbolic timing simulation (STS) using data-dependent delays as a tool for verifying the timing of fullcustom transistor-level circuit designs, and for the ...
Clayton B. McDonald, Randal E. Bryant
VLSID
2005
IEEE
98views VLSI» more  VLSID 2005»
16 years 7 months ago
False Path and Clock Scheduling Based Yield-Aware Gate Sizing
Timing margin (slack) needs to be carefully managed to ensure a satisfactory timing yield. We propose a new design flow that combines a false-path-aware gate sizing and a statisti...
Jeng-Liang Tsai, Dong Hyun Baik, Charlie Chung-Pin...
ICRA
2005
IEEE
156views Robotics» more  ICRA 2005»
16 years 18 days ago
A Hierarchical Multiple-Target Tracking Algorithm for Sensor Networks
Abstract— Multiple-target tracking is a canonical application of sensor networks as it exhibits different aspects of sensor networks such as event detection, sensor information f...
Songhwai Oh, Luca Schenato, Shankar Sastry