Sciweavers

7092 search results - page 1264 / 1419
» Parallelizing constraint programs
Sort
View
MP
2010
94views more  MP 2010»
13 years 6 months ago
MIR closures of polyhedral sets
We study the mixed-integer rounding (MIR) closures of polyhedral sets. The MIR closure of a polyhedral set is equal to its split closure and the associated separation problem is N...
Sanjeeb Dash, Oktay Günlük, Andrea Lodi
PVLDB
2010
115views more  PVLDB 2010»
13 years 6 months ago
CORADD: Correlation Aware Database Designer for Materialized Views and Indexes
We describe an automatic database design tool that exploits correlations between attributes when recommending materialized views (MVs) and indexes. Although there is a substantial...
Hideaki Kimura, George Huo, Alexander Rasin, Samue...
SAS
2010
Springer
149views Formal Methods» more  SAS 2010»
13 years 6 months ago
Boxes: A Symbolic Abstract Domain of Boxes
Symbolic Abstract Domain of Boxes Arie Gurfinkel and Sagar Chaki Carnegie Mellon University Abstract. Numeric abstract domains are widely used in program analyses. The simplest nu...
Arie Gurfinkel, Sagar Chaki
SCHEDULING
2010
116views more  SCHEDULING 2010»
13 years 6 months ago
On supporting Lean methodologies using constraint-based scheduling
Lean Manufacturing often simply referred to as Lean is a process management philosophy that aims to improve the way in which products are manufactured. It does this through ide...
Roman van der Krogt, John Geraghty, Mustafa Ramzi ...
SPIRE
2010
Springer
13 years 6 months ago
Restricted LCS
The Longest Common Subsequence (LCS) of two or more strings is a fundamental well-studied problem which has a wide range of applications throughout computational sciences. When the...
Zvi Gotthilf, Danny Hermelin, Gad M. Landau, Moshe...
« Prev « First page 1264 / 1419 Last » Next »