17 search results - page 1 / 4 » Optimal integer delay budgeting on directed acyclic graphs |
DAC
2003
ACM
14 years 5 months ago
2003
ACM
Delay budget is an excess delay each component of a design can tolerate under a given timing constraint. Delay budgeting has been widely exploited to improve the design quality. W...
ENDM
2006
13 years 4 months ago
2006
ASPDAC
2008
ACM
13 years 6 months ago
2008
ACM
In this paper we present a mathematical programming formulation of the integer time budgeting problem for directed acyclic graphs. In particular, we formally prove that our constr...
TCBB
2011
12 years 11 months ago
2011
—We study the problem of merging genetic maps, when the individual genetic maps are given as directed acyclic graphs. The computational problem is to build a consensus map, which...
ICIP
2000
IEEE
14 years 6 months ago
2000
IEEE
This paper presents an e cient recursive algorithm for generating operationally optimal intra mode scalable layer decompositions of object contours. The problem is posed in terms ...