Sciweavers

16404 search results - page 407 / 3281
» A set coverage problem
Sort
View
ECOOP
2004
Springer
16 years 3 days ago
The Expression Problem Revisited
The expression problem (aka the extensibility problem) refers to a fundamental dilemma of programming: Can your application be structured in such a way that both the data model and...
Mads Torgersen
AUSSOIS
2001
Springer
15 years 11 months ago
Exact Algorithms for NP-Hard Problems: A Survey
We discuss fast exponential time solutions for NP-complete problems. We survey known results and approaches, we provide pointers to the literature, and we discuss several open prob...
Gerhard J. Woeginger
IJCGA
2006
79views more  IJCGA 2006»
15 years 6 months ago
Well-constrained Completion and Decomposition for under-constrained Geometric Constraint Problems
In this paper, we consider the optimal well-constrained completion problem, that is, for an under-constrained geometric constraint problem, add automatically new constraints in suc...
Gui-Fang Zhang, Xiao-Shan Gao
SIAMJO
2002
102views more  SIAMJO 2002»
15 years 6 months ago
Robust Solutions of Uncertain Quadratic and Conic-Quadratic Problems
We consider a conic-quadratic (and in particular a quadratically constrained) optimization problem with uncertain data, known only to reside in some uncertainty set U. The robust ...
Aharon Ben-Tal, Arkadi Nemirovski, Cees Roos
COR
2010
123views more  COR 2010»
15 years 6 months ago
Multi-dimensional bin packing problems with guillotine constraints
The problem addressed in this paper is the decision problem of determining if a set of multi-dimensional rectangular boxes can be orthogonally packed into a rectangular bin while ...
Rasmus Resen Amossen, David Pisinger