Sciweavers

1485 search results - page 62 / 297
» Whole Program Paths
Sort
View
WWW
2007
ACM
14 years 10 months ago
SPARQ2L: towards support for subgraph extraction queries in rdf databases
Many applications in analytical domains often have the need to "connect the dots" i.e., query about the structure of data. In bioinformatics for example, it is typical t...
Kemafor Anyanwu, Angela Maduko, Amit P. Sheth
LCPC
2005
Springer
14 years 3 months ago
Concurrency Analysis for Parallel Programs with Textually Aligned Barriers
Abstract. A fundamental problem in the analysis of parallel programs is to determine when two statements in a program may run concurrently. This analysis is the parallel analog to ...
Amir Kamil, Katherine A. Yelick
INFOCOM
2010
IEEE
13 years 8 months ago
Reliable Adaptive Multipath Provisioning with Bandwidth and Differential Delay Constraints
Abstract— Robustness and reliability are critical issues in network management. To provide resiliency, a popular protection scheme against network failures is the simultaneous ro...
Weiyi Zhang, Jian Tang, Chonggang Wang, Shanaka de...
ICCAD
1999
IEEE
99views Hardware» more  ICCAD 1999»
14 years 2 months ago
Concurrent logic restructuring and placement for timing closure
: In this paper, an algorithm for simultaneous logic restructuring and placement is presented. This algorithm first constructs a set of super-cells along the critical paths and the...
Jinan Lou, Wei Chen, Massoud Pedram
DATE
2003
IEEE
79views Hardware» more  DATE 2003»
14 years 3 months ago
Time Budgeting in a Wireplanning Context
Wireplanning is an approach in which the timing of inputoutput paths is planned before modules are specified, synthesized or sized. If these global wires are optimally segmented ...
Jurjen Westra, Dirk-Jan Jongeneel, Ralph H. J. M. ...