3019 search results - page 38 / 604 » Approximating the Domatic Number |
AAIM
2008
Springer
15 years 1 months ago
2008
Springer
We give a randomized protocol for the classic cake cutting problem that guarantees approximate proportional fairness, and with high probability uses a linear number of cuts.
CDC
2010
IEEE
14 years 6 months ago
2010
IEEE
Abstract-- The Unscented Kalman Filter (UKF) is a nonlinear estimator that is particularly well suited for complex nonlinear systems. In the UKF, the error covariance is estimated ...
101
click to vote
LATIN
2000
Springer
15 years 3 months ago
2000
Springer
The Flexible Job Shop problem is a generalization of the classical job shop scheduling problem in which for every operation there is a group of machines that can process it. The p...
NIPS
2003
15 years 1 months ago
2003
Belief propagation on cyclic graphs is an efficient algorithm for computing approximate marginal probability distributions over single nodes and neighboring nodes in the graph. I...
105
click to vote
IPL
2006
14 years 11 months ago
2006
Max-Satisfy is the problem of finding an assignment that satisfies the maximum number of equations in a system of linear equations over Q. We prove that unless NPBPP Max-Satisfy c...