1723 search results - page 265 / 345 » Cycling in linear programming problems |
INFOCOM
2000
IEEE
15 years 1 months ago
2000
IEEE
An efficient and general graph-theoretic model (the Wavelength-Graph (WG)) has been proposed which enables solving the static Routing and Wavelength Assignment (RWA) problems in Mu...
DAC
2005
ACM
14 years 11 months ago
2005
ACM
This paper presents a new method for designing test wrappers for embedded cores with multiple clock domains. By exploiting the use of multiple shift frequencies, the proposed meth...
NIPS
2008
14 years 11 months ago
2008
We propose a new class of consistency constraints for Linear Programming (LP) relaxations for finding the most probable (MAP) configuration in graphical models. Usual cluster-base...
79
Voted
NIPS
2008
14 years 11 months ago
2008
We consider the problem of obtaining the approximate maximum a posteriori estimate of a discrete random field characterized by pairwise potentials that form a truncated convex mod...
92
Voted
NETWORKING
2007
14 years 11 months ago
2007
Abstract. The topology creation is one of the most important step for the design of an overlay network. Traffic characteristic and volume, and behavior of nodes which can be sel...