Sciweavers

1258 search results - page 101 / 252
» Architecture-driven Problem Decomposition
Sort
View
AAAI
1994
13 years 10 months ago
Activity Analysis: The Qualitative Analysis of Stationary Points for Optimal Reasoning
We present a theory of a modeler's problem decomposition skills in the context of optimal reasonzng -- the use of qualitative modeling to strategically guide numerical explor...
Brian C. Williams, Jonathan Cagan
PARA
1995
Springer
14 years 19 days ago
Decomposing Linear Programs for Parallel Solution
Coarse grain parallelism inherent in the solution of Linear Programming (LP) problems with block angular constraint matrices has been exploited in recent research works. However, t...
Ali Pinar, Ümit V. Çatalyürek, Ce...
CPAIOR
2011
Springer
13 years 19 days ago
Almost Square Packing
Abstract. The almost square rectangle packing problem involves packing all rectangles with sizes 1 × 2 to n × (n + 1) (almost squares) into an enclosing rectangle of minimal area...
Helmut Simonis, Barry O'Sullivan
ICCAD
2007
IEEE
96views Hardware» more  ICCAD 2007»
14 years 6 months ago
Monte-Carlo driven stochastic optimization framework for handling fabrication variability
Increasing effects of fabrication variability have inspired a growing interest in statistical techniques for design optimization. In this work, we propose a Monte-Carlo driven sto...
Vishal Khandelwal, Ankur Srivastava
SAS
1999
Springer
116views Formal Methods» more  SAS 1999»
14 years 1 months ago
Decomposing Non-redundant Sharing by Complementation
Complementation, the inverse of the reduced product operation, is a technique for systemfinding minimal decompositions of abstract domains. Fil´e and Ranzato advanced the state ...
Enea Zaffanella, Patricia M. Hill, Roberto Bagnara