2944 search results - page 122 / 589 » Improving Bound Propagation |
TIT
2011
13 years 5 months ago
2011
—The capacity of 1-D constraints is given by the entropy of a corresponding stationary maxentropic Markov chain. Namely, the entropy is maximized over a set of probability distri...
TIT
2010
13 years 4 months ago
2010
Abstract--This paper discusses new bounds for restricted isometry constants in compressed sensing. Let 8be an n2p real matrix and k be a positive integer with k n. One of the main...
WEA
2010
Springer
14 years 5 months ago
2010
Springer
Abstract. This work deals with the Vehicle Routing Problem with Simultaneous Pickup and Delivery. We propose undirected and directed two-commodity flow formulations, which are bas...
IWPEC
2009
Springer
14 years 4 months ago
2009
Springer
Many parameterized algorithms for NP-hard graph problems are search tree algorithms with sophisticated local branching rules. But it has also been noticed that the global structur...
WG
2007
Springer
14 years 4 months ago
2007
Springer
Abstract. The computation of all minimal transversals of a given hypergraph in output-polynomial time is a long standing open question known as the transversal hypergraph generatio...