Sciweavers

145 search results - page 9 / 29
» Extended Whole Program Paths
Sort
View
NETWORKS
2008
13 years 7 months ago
A Reach and Bound algorithm for acyclic dynamic-programming networks
Node pruning is a commonly used technique for solution acceleration in a dynamic programming network. In pruning, nodes are adaptively removed from the dynamic programming network...
Matthew D. Bailey, Robert L. Smith, Jeffrey M. Ald...
ICCAD
1999
IEEE
153views Hardware» more  ICCAD 1999»
13 years 11 months ago
Cycle time and slack optimization for VLSI-chips
We consider the problem of finding an optimal clock schedule, i.e. optimal arrival times for clock signals at latches of a VLSI chip. We describe a general model which includes al...
Christoph Albrecht, Bernhard Korte, Jürgen Sc...
AMC
2006
89views more  AMC 2006»
13 years 7 months ago
A functional computation model for the duality of two-variable Lambda-Boolean functions
This paper presents a new functional computation model for developing a class of two-variable Lambda-Boolean functions, and describes the properties of the duality principle on th...
Tolga Güyer, Seref Mirasyedioglu
ICSE
2007
IEEE-ACM
14 years 7 months ago
Exception-Chain Analysis: Revealing Exception Handling Architecture in Java Server Applications
Although it is common in large Java programs to rethrow exceptions, existing exception-flow analyses find only single exceptionflow links, thus are unable to identify multiple-lin...
Chen Fu, Barbara G. Ryder
INFOCOM
2009
IEEE
14 years 2 months ago
Towards Efficient Large-Scale VPN Monitoring and Diagnosis under Operational Constraints
Continuous monitoring and diagnosis of network performance are of crucial importance for the Internet access service and virtual private network (VPN) service providers. Various o...
Yao Zhao, Zhaosheng Zhu, Yan Chen, Dan Pei, Jia Wa...