Sciweavers

1723 search results - page 2 / 345
» Cycling in linear programming problems
Sort
View
TON
2010
118views more  TON 2010»
13 years 4 months ago
ILP formulations for p-cycle design without candidate cycle enumeration
—The concept of p-cycle (preconfigured protection cycle) allows fast and efficient span protection in wavelength division multiplexing (WDM) mesh networks. To design p-cycles f...
Bin Wu, Kwan L. Yeung, Pin-Han Ho
ICC
2007
IEEE
123views Communications» more  ICC 2007»
14 years 8 days ago
A New ILP-Based p-Cycle Construction Algorithm without Candidate Cycle Enumeration
—The notion of p-cycle (Preconfigured Protection Cycle) allows capacity efficient schemes to be designed for fast span protection in WDM mesh networks. Conventional p-cycle const...
Bin Wu, Kwan Lawrence Yeung, King-Shan Lui, Shizho...
STOC
2010
ACM
185views Algorithms» more  STOC 2010»
14 years 3 months ago
Optimal Homologous Cycles, Total Unimodularity, and Linear Programming
Tamal K. Dey, Anil N. Hirani and Bala Krishnamoort...
ICCAD
1999
IEEE
153views Hardware» more  ICCAD 1999»
13 years 10 months ago
Cycle time and slack optimization for VLSI-chips
We consider the problem of finding an optimal clock schedule, i.e. optimal arrival times for clock signals at latches of a VLSI chip. We describe a general model which includes al...
Christoph Albrecht, Bernhard Korte, Jürgen Sc...
ECCV
2008
Springer
14 years 7 months ago
Beyond Loose LP-Relaxations: Optimizing MRFs by Repairing Cycles
This paper presents a new MRF optimization algorithm, which is derived from Linear Programming and manages to go beyond current state-of-the-art techniques (such as those based on ...
Nikos Komodakis, Nikos Paragios