Sciweavers

1224 search results - page 104 / 245
» Theory decision by decomposition
Sort
View
HPDC
1994
IEEE
15 years 10 months ago
Network Partitioning of Data Parallel Computations
Partitioning data parallel computations across a network of heterogeneous workstations is a dificult problem for the user: We have developed a runtime partitioning methodfor choos...
Jon B. Weissman, Andrew S. Grimshaw
DBPL
1995
Springer
144views Database» more  DBPL 1995»
15 years 10 months ago
An Algebraic Framework for Physical OODB Design
Physical design for object-oriented databases is still in its infancy. Implementation decisions often intrude into the conceptual design (such as inverse links and object decompos...
Leonidas Fegaras, David Maier
ICALP
1995
Springer
15 years 10 months ago
Parallel Algorithms with Optimal Speedup for Bounded Treewidth
We describe the rst parallel algorithm with optimal speedup for constructing minimum-width tree decompositions of graphs of bounded treewidth. On n-vertex input graphs, the algori...
Hans L. Bodlaender, Torben Hagerup
ANOR
2005
124views more  ANOR 2005»
15 years 6 months ago
On Compact Formulations for Integer Programs Solved by Column Generation
Column generation has become a powerful tool in solving large scale integer programs. It is well known that most of the often reported compatibility issues between pricing subprobl...
Daniel Villeneuve, Jacques Desrosiers, Marco E. L&...
ICMS
2010
15 years 4 months ago
The Reformulation-Optimization Software Engine
Abstract. Most optimization software performs numerical computation, in the sense that the main interest is to find numerical values to assign to the decision variables, e.g. a so...
Leo Liberti, Sonia Cafieri, David Savourey