Sciweavers

2214 search results - page 287 / 443
» complexity 2004
Sort
View
ASPDAC
2004
ACM
107views Hardware» more  ASPDAC 2004»
15 years 10 months ago
Minimization of the expected path length in BDDs based on local changes
— In many verification tools methods for functional simulation based on reduced ordered Binary Decision Diagrams (BDDs) are used. The evaluation time for a BDD can be crucial an...
Rüdiger Ebendt, Wolfgang Günther, Rolf D...
ASPDAC
2004
ACM
120views Hardware» more  ASPDAC 2004»
15 years 10 months ago
Temporal floorplanning using 3D-subTCG
Improving logic capacity by time-sharing, dynamically reconfigurable FPGAs are employed to handle designs of high complexity and functionality. In this paper, we use a novel topo...
Ping-Hung Yuh, Chia-Lin Yang, Yao-Wen Chang, Hsin-...
ASSETS
2004
ACM
15 years 10 months ago
Nonvisual tool for navigating hierarchical structures
The hierarchical structure of a program can be quite complex. As such, many Integrated Development Environments (IDEs) provide graphical representations of program structure at di...
Ann C. Smith, Justin S. Cook, Joan M. Francioni, A...
CF
2004
ACM
15 years 10 months ago
A framework for resource discovery in pervasive computing for mobile aware task execution
Aimed to provide computation ubiquitously, pervasive computing is perceived as a means to provide a user the transparency of anywhere, anyplace, anytime computing. Pervasive compu...
K. Kalapriya, S. K. Nandy, Deepti Srinivasan, R. U...
COMPGEOM
2004
ACM
15 years 10 months ago
An empirical comparison of techniques for updating Delaunay triangulations
The computation of Delaunay triangulations from static point sets has been extensively studied in computational geometry. When the points move with known trajectories, kinetic dat...
Leonidas J. Guibas, Daniel Russel