Sciweavers

1258 search results - page 121 / 252
» Architecture-driven Problem Decomposition
Sort
View
CP
2009
Springer
14 years 9 months ago
On Decomposing Knapsack Constraints for Length-Lex Bounds Consistency
The length-lex representation for set variables orders all subsets of a given universe of values according to cardinality and lexicography. To achieve length-lex bounds consistency...
Meinolf Sellmann
ICMCS
2005
IEEE
83views Multimedia» more  ICMCS 2005»
14 years 2 months ago
Rotation invariant texture classification using Bamberger pyramids
We study the application of the Bamberger directional filter bank to the problem of rotation invariant texture classification. We explore the use of purely directional decomposi...
José-Gerardo Rosiles, Mark J. T. Smith, Rus...
DISOPT
2008
99views more  DISOPT 2008»
13 years 9 months ago
Computing robust basestock levels
This paper considers how to optimally set the basestock level for a single buffer when demand is uncertain, in a robust framework. We present a family of algorithms based on decom...
Daniel Bienstock, Nuri Özbay
CSDA
2002
77views more  CSDA 2002»
13 years 8 months ago
Numerically stable cointegration analysis
Cointegration analysis involves the solution of a generalized eigenproblem involving moment matrices and inverted moment matrices. These formulae are unsuitable for actual computa...
Jurgen A. Doornik, R. J. O'Brien
CSCLP
2007
Springer
14 years 3 months ago
A Global Filtration for Satisfying Goals in Mutual Exclusion Networks
We formulate a problem of goal satisfaction in mutex networks in this paper. The proposed problem is motivated by problems that arise in concurrent planning. For more efficient sol...
Pavel Surynek