Sciweavers

2926 search results - page 139 / 586
» Partially Optimal Routing
Sort
View
LOPSTR
2005
Springer
15 years 8 months ago
Non-leftmost Unfolding in Partial Evaluation of Logic Programs with Impure Predicates
Partial evaluation of logic programs which contain impure predicates poses non-trivial challenges. Impure predicates include those which produce side-effects, raise errors (or exc...
Elvira Albert, Germán Puebla, John P. Galla...
GECCO
2009
Springer
100views Optimization» more  GECCO 2009»
15 years 9 months ago
Partial neighborhoods of elementary landscapes
This paper introduces a new component based model that makes it relatively simple to prove that certain types of landscapes are elementary. We use the model to reconstruct proofs ...
L. Darrell Whitley, Andrew M. Sutton
ICSM
1994
IEEE
15 years 7 months ago
A Framework for Partial Data Flow Analysis
Although data pow analysis was first developed for use in compilers, its usefulness is now recognized in many software tools. Because of its compiler origins, the computation of d...
Rajiv Gupta, Mary Lou Soffa
DAC
2007
ACM
16 years 4 months ago
IPR: An Integrated Placement and Routing Algorithm
Abstract-- In nanometer-scale VLSI technologies, several interconnect issues like routing congestion and interconnect delay have become the main concerns in placement. However, all...
Min Pan, Chris C. N. Chu
PODC
2006
ACM
15 years 9 months ago
Optimal-stretch name-independent compact routing in doubling metrics
We consider the problem of name-independent routing in doubling metrics. A doubling metric is a metric space whose doubling dimension is a constant, where the doubling dimension o...
Goran Konjevod, Andréa W. Richa, Donglin Xi...