4843 search results - page 148 / 969 » The Shortcut Problem - Complexity and Approximation |
139
click to vote
WAOA
2007
Springer
15 years 9 months ago
2007
Springer
We continue the study of bin packing with splittable items and cardinality constraints. In this problem, a set of items must be packed into as few bins as possible. Items may be s...
123
Voted
AAAI
2007
15 years 5 months ago
2007
We present a new estimator for counting the number of solutions of a Boolean satisfiability problem as a part of an importance sampling framework. The estimator uses the recently...
145
click to vote
ORL
2008
15 years 3 months ago
2008
We propose a sample average approximation (SAA) method for stochastic programming problems involving an expected value constraint. Such problems arise, for example, in portfolio s...
163
click to vote
TIP
2002
15 years 2 months ago
2002
Fractal image encoding is a computationally intensive method of compression due to its need to find the best match between image sub-blocks by repeatedly searching a large virtual...
SIAMMAX
2010
14 years 10 months ago
2010
The aim of the paper is to provide a theoretical basis for approximate reduced SQP methods. In contrast to inexact reduced SQP methods, the forward and the adjoint problem accuraci...