2944 search results - page 289 / 589 » Improving Bound Propagation |
192
click to vote
JCS
2008
15 years 6 months ago
2008
Randomized protocols for hiding private information can be regarded as noisy channels in the information-theoretic sense, and the inference of the concealed information can be reg...
197
click to vote
ETT
2007
15 years 6 months ago
2007
A powerful class of rate-compatible serially concatenated convolutional codes (SCCCs) has been proposed based on minimizing analytical upper bounds on the error probability in the ...
205
click to vote
NETWORKS
2008
15 years 6 months ago
2008
The resource-constrained elementary shortest path problem arises as a pricing subproblem in branch-and-price algorithms for vehicle routing problems with additional constraints. W...
185
click to vote
MP
2006
15 years 6 months ago
2006
Decomposition algorithms such as Lagrangian relaxation and Dantzig-Wolfe decomposition are well-known methods that can be used to generate bounds for mixed-integer linear programmi...
209
click to vote
ALGORITHMICA
2005
15 years 6 months ago
2005
In an adversarial queueing network, the incoming traffic is decided by an adversary, who operates under a reasonable rate restriction. This model provides a valuable, complementar...