93 search results - page 3 / 19 » On representations of the feasible set in convex optimizatio... |
ISPD
1999
ACM
15 years 1 months ago
1999
ACM
The sequence-pair was proposed in 1994 as a representation of the packing of rectangles of general structure. Since then, there have been e orts to expand its applicability over s...
DATE
2002
IEEE
15 years 2 months ago
2002
IEEE
In this paper, we deal with arbitrary convex and concave rectilinear module packing using the Transitive Closure Graph (TCG) representation. The geometric meanings of modules are ...
MP
2007
14 years 9 months ago
2007
Given a primal-dual pair of linear programs, it is well known that if their optimal values are viewed as lying on the extended real line, then the duality gap is zero, unless both...
DAC
2005
ACM
15 years 10 months ago
2005
ACM
We obtain analytically, the energy optimal speed profile of a generic multi-speed device with a discrete set of speeds, to execute a given task within a given time. Current implem...
101
click to vote
CORR
2010
Springer
14 years 6 months ago
2010
Springer
The structural properties of graphs are usually characterized in terms of invariants, which are functions of graphs that do not depend on the labeling of the nodes. In this paper ...