224 search results - page 6 / 45 » G-graphs for the cage problem: a new upper bound |
93
Voted
EVOW
2007
Springer
15 years 4 months ago
2007
Springer
We present a Lagrangian decomposition approach for the Knapsack Constrained Maximum Spanning Tree problem yielding upper bounds as well as heuristic solutions. This method is furth...
91
Voted
CORR
2006
Springer
14 years 10 months ago
2006
Springer
Abstract--We address the maximum attainable rate of fingerprinting codes under the marking assumption, studying lower and upper bounds on the value of the rate for various sizes of...
92
Voted
EOR
2008
14 years 10 months ago
2008
The 0-1 Multidimensional Knapsack Problem (0-1 MKP) is a wellknown (and strongly NP-hard) combinatorial optimization problem with many applications. Up to now, the majority of upp...
95
Voted
SIAMNUM
2011
14 years 5 months ago
2011
We derive energy-norm a posteriori error bounds for an Euler timestepping method combined with various spatial discontinuous Galerkin schemes for linear parabolic problems. For acc...
70
Voted
ICML
2009
IEEE
15 years 11 months ago
2009
IEEE
The purpose of this paper is three-fold. First, we formalize and study a problem of learning probabilistic concepts in the recently proposed KWIK framework. We give details of an ...