1090 search results - page 122 / 218 » Priority Algorithms for Graph Optimization Problems |
CODES
2003
IEEE
14 years 1 months ago
2003
IEEE
the level of abstraction in system design promises to enable faster exploration of the design space at early stages. While scheduling decision for embedded software has great impa...
CGF
2008
13 years 8 months ago
2008
We describe algorithms for canonically partitioning semi-regular quadrilateral meshes into structured submeshes, using an adaptation of the geometric motorcycle graph of Eppstein ...
KBSE
1995
IEEE
13 years 11 months ago
1995
IEEE
Numerical design optimization algorithms are highly sensitive to the particular formulation of the optimization problems they are given. The formulation of the search space, the o...
ICCV
2007
IEEE
14 years 9 months ago
2007
IEEE
Capacity scaling is a hierarchical approach to graph representation that can improve theoretical complexity and practical efficiency of max-flow/min-cut algorithms. Introduced by ...
INFOCOM
2003
IEEE
14 years 1 months ago
2003
IEEE
— There are two fundamental technology issues that challenge the robustness of IP backbones. First, SONET protection is gradually being removed because of its high cost (while SO...