Sciweavers

3172 search results - page 161 / 635
» On the Random-Self-Reducibility of Complete Sets
Sort
View
DISOPT
2008
81views more  DISOPT 2008»
15 years 6 months ago
Intermediate integer programming representations using value disjunctions
We introduce a general technique to create an extended formulation of a mixed-integer program. We classify the integer variables into blocks, each of which generates a finite set ...
Matthias Köppe, Quentin Louveaux, Robert Weis...
4OR
2005
71views more  4OR 2005»
15 years 6 months ago
On rank-perfect subclasses of near-bipartite graphs
Shepherd (1995) proved that the stable set polytopes of near-bipartite graphs are given by constraints associated with the complete join of antiwebs only. For antiwebs, the facet s...
Annegret Wagler
IEEEPACT
2002
IEEE
15 years 11 months ago
Workload Design: Selecting Representative Program-Input Pairs
Having a representative workload of the target domain of a microprocessor is extremely important throughout its design. The composition of a workload involves two issues: (i) whic...
Lieven Eeckhout, Hans Vandierendonck, Koenraad De ...
TSMC
2002
112views more  TSMC 2002»
15 years 6 months ago
An efficient algorithm for automatically generating multivariable fuzzy systems by Fourier series method
By exploiting the Fourier series expansion, we have developed a new constructive method of automatically generating a multivariable fuzzy inference system from any given sample set...
Liang Chen, Naoyuki Tokuda
VLDB
2007
ACM
118views Database» more  VLDB 2007»
16 years 6 months ago
Inferring XML Schema Definitions from XML Data
Although the presence of a schema enables many optimizations for operations on XML documents, recent studies have shown that many XML documents in practice either do not refer to ...
Geert Jan Bex, Frank Neven, Stijn Vansummeren