2944 search results - page 260 / 589 » Improving Bound Propagation |
143
click to vote
JCSS
2008
15 years 6 months ago
2008
We present a polynomial time approximation algorithm for unit time precedence constrained scheduling. Our algorithm guarantees schedules which are at most 2 - 7 3p+1 factor as lon...
149
click to vote
DM
2002
15 years 6 months ago
2002
We investigate the minimum and maximum number of colors in edge-colorings of Kn,n such that every copy of Kp,p receives at least q and at most q colors. Along the way we improve t...
170
click to vote
TIT
2010
15 years 1 months ago
2010
A new variable-rate coding technique is presented for two-dimensional constraints. For certain constraints, such as the (0, 2)-RLL, (2, )-RLL, and the "no isolated bits" ...
182
click to vote
MMM
2010
Springer
15 years 8 months ago
2010
Springer
: Networks and distributed computing systems are becoming increasingly important and at the same time, more and more critical to the world of Information Technology. This rash spre...
212
click to vote
AI
2010
Springer
15 years 6 months ago
2010
Springer
Bayesian networks (BNs) are used to represent and ef ciently compute with multi-variate probability distributions in a wide range of disciplines. One of the main approaches to per...