Sciweavers

2492 search results - page 421 / 499
» On the General Signature Trees
Sort
View
FOCS
1997
IEEE
14 years 1 months ago
Beyond the Flow Decomposition Barrier
We introduce a new approach to the maximum flow problem. This approach is based on assigning arc lengths based on the residual flow value and the residual arc capacities. Our appro...
Andrew V. Goldberg, Satish Rao
LICS
1997
IEEE
14 years 1 months ago
Ground Reducibility is EXPTIME-Complete
Abstract. We prove that ground reducibility is EXPTIME-complete in the general case. EXPTIME-hardness is proved by encoding the emptiness problem for the intersection of recognizab...
Hubert Comon, Florent Jacquemard
ICCAD
1996
IEEE
74views Hardware» more  ICCAD 1996»
14 years 1 months ago
Optimal non-uniform wire-sizing under the Elmore delay model
We consider non-uniform wire-sizing for general routing trees under the Elmore delay model. Three minimization objectives are studied: 1) total weighted sink-delays; 2) total area...
Chung-Ping Chen, Hai Zhou, D. F. Wong
ICECCS
1996
IEEE
209views Hardware» more  ICECCS 1996»
14 years 1 months ago
Coupling-based Integration Testing
This research is part of a project to develop practical, effective, formalizable, automatable techniques for integration testing. Integration testing is an important part of the t...
Zhenyi Jin, A. Jefferson Offutt
APL
1993
ACM
14 years 1 months ago
Array Morphology
Array morphology is the study of the form, structure, and evolution of arrays. An array annotation for a program written in an applicative array lanan abstract syntax tree for the...
Robert Bernecky