Sciweavers

16596 search results - page 60 / 3320
» Generalized Assignment Problems
Sort
View
NIPS
2007
14 years 11 months ago
Fixing Max-Product: Convergent Message Passing Algorithms for MAP LP-Relaxations
We present a novel message passing algorithm for approximating the MAP problem in graphical models. The algorithm is similar in structure to max-product but unlike max-product it ...
Amir Globerson, Tommi Jaakkola
IMC
2003
ACM
15 years 3 months ago
Virtual landmarks for the internet
Internet coordinate schemes have been proposed as a method for estimating minimum round trip time between hosts without direct measurement. In such a scheme, each host is assigned...
Liying Tang, Mark Crovella
JCM
2008
94views more  JCM 2008»
14 years 9 months ago
Cell Site Power Characterization for Multi-rate Wireless CDMA Data Networks Using Lognormal Approximation
An analytical model is developed to solve the power-rate assignment problem for multi-rate CDMA systems and calculate the probability density function (PDF) for the downlink traffi...
Ashraf S. Hasan Mahmoud
DISOPT
2007
90views more  DISOPT 2007»
14 years 9 months ago
On the job rotation problem
The job rotation problem (JRP) is the following: Given an n × n matrix A over R ∪ {−∞} and k ≤ n, find a k × k principal submatrix of A whose optimal assignment problem...
Peter Butkovic, Seth Lewis
SODA
2003
ACM
121views Algorithms» more  SODA 2003»
14 years 11 months ago
An improved approximation algorithm for the partial latin square extension problem
Previous work on the partial Latin square extension (PLSE) problem resulted in a 2-approximation algorithm based on the LP relaxation of a three-dimensional assignment IP formulat...
Carla P. Gomes, Rommel G. Regis, David B. Shmoys