3049 search results - page 370 / 610 » On the Convergence of Bound Optimization Algorithms |
217
click to vote
PDP
2005
IEEE
16 years 24 days ago
2005
IEEE
Circulant graphs have been deeply studied in technical literature. Midimew networks are a class of distancerelated optimal circulant graphs of degree four which have applications ...
182
click to vote
IPPS
2000
IEEE
15 years 11 months ago
2000
IEEE
All-to-all personalized exchange is one of the most dense collective communication patterns and occurs in many important parallel computing/networking applications. In this paper,...
207
click to vote
CPAIOR
2010
Springer
15 years 10 months ago
2010
Springer
Cutting plane methods are widely used for solving convex optimization problems and are of fundamental importance, e.g., to provide tight bounds for Mixed-Integer Programs (MIPs). T...
164
click to vote
DAGSTUHL
2006
15 years 8 months ago
2006
This paper presents the optimal compression for sequences with undefined values. Let we have (N -m) undefined and m defined positions in the boolean sequence V of length N. The se...
176
click to vote
GD
2008
Springer
15 years 8 months ago
2008
Springer
A visibility representation of a graph G is to represent the nodes of G with non-overlapping horizontal line segments such that the line segments representing any two distinct adja...