2636 search results - page 410 / 528 » Linear Programming |
113
click to vote
NIPS
2008
15 years 3 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...
133
Voted
NETWORKING
2007
15 years 3 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...
101
click to vote
SODA
2008
ACM
15 years 3 months ago
2008
ACM
In this paper, we study an online make-to-order variant of the classical joint replenishment problem (JRP) that has been studied extensively over the years and plays a fundamental...
121
click to vote
SODA
2008
ACM
15 years 3 months ago
2008
ACM
We consider a problem known as the restricted assignment version of the max-min allocation problem with indivisible goods. There are n items of various nonnegative values and m pl...
137
click to vote
UAI
2008
15 years 3 months ago
2008
Linear Programming (LP) relaxations have become powerful tools for finding the most probable (MAP) configuration in graphical models. These relaxations can be solved efficiently u...