Sciweavers

697 search results - page 31 / 140
» Decomposition Structures for Event-B
Sort
View
131
Voted
TALG
2010
110views more  TALG 2010»
15 years 4 months ago
Approximating fractional hypertree width
Fractional hypertree width is a hypergraph measure similar to tree width and hypertree width. Its algorithmic importance comes from the fact that, as shown in previous work [14], ...
Dániel Marx
160
Voted
ICTAI
2010
IEEE
15 years 3 months ago
A New Filtering Based on Decomposition of Constraint Sub-Networks
In this paper, we introduce a new partial consistency for constraint networks which is called Structural Consistency of level w and is denoted w-SC consistency. This consistency i...
Philippe Jégou, Cyril Terrioux
WADS
2009
Springer
291views Algorithms» more  WADS 2009»
16 years 16 days ago
On the Power of the Semi-Separated Pair Decomposition
Abstract. A Semi-Separated Pair Decomposition (SSPD), with parameter s > 1, of a set S ⊂ Rd is a set {(Ai, Bi)} of pairs of subsets of S such that for each i, there are balls ...
Mohammad Ali Abam, Paz Carmi, Mohammad Farshi, Mic...
140
Voted
CP
2009
Springer
16 years 22 days ago
Exploiting Problem Decomposition in Multi-objective Constraint Optimization
Multi-objective optimization is concerned with problems involving multiple measures of performance which should be optimized simultaneously. In this paper, we extend AND/OR Branch-...
Radu Marinescu
ECOOP
2004
Springer
15 years 11 months ago
OASIS: Organic Aspects for System Infrastructure Software Easing Evolution and Adaptation through Natural Decomposition
It is becoming increasingly clear that we are entering a new era in systems software. As the age-old tension between structure and performance acquiesces, we can finally venture b...
Celina Gibbs, Yvonne Coady