Sciweavers

116 search results - page 6 / 24
» Composition and Decomposition in True-Concurrency
Sort
View
IOR
2011
152views more  IOR 2011»
13 years 2 months ago
Risk-Averse Two-Stage Stochastic Linear Programming: Modeling and Decomposition
We formulate a risk-averse two-stage stochastic linear programming problem in which unresolved uncertainty remains after the second stage. The objective function is formulated as ...
Naomi Miller, Andrzej Ruszczynski
ASM
2008
ASM
13 years 9 months ago
The Composition of Event-B Models
The transition from classical B [2] to the Event-B language and method [3] has seen the removal of some forms of model structuring and composition, with the intention of reinventin...
Michael Poppleton
TVLSI
1998
124views more  TVLSI 1998»
13 years 7 months ago
Computing support-minimal subfunctions during functional decomposition
Abstract— The growing popularity of look-up table (LUT)based field programmable gate arrays (FPGA’s) has renewed the interest in functional or Roth–Karp decomposition techni...
Christian Legl, Bernd Wurth, Klaus Eckl
SOCO
2009
Springer
14 years 2 months ago
A Framework for Testing Model Composition Engines
Model composition helps designers managing complexities by modeling different system views separately, and later compose them into an integrated model. In the past years, researche...
Freddy Munoz, Benoit Baudry
DAC
1995
ACM
13 years 11 months ago
A Method for Finding Good Ashenhurst Decompositions and Its Application to FPGA Synthesis
—In this paper, we present an algorithm for finding a good Ashenhurst decomposition of a switching function. Most current methods for performing this type of decomposition are ba...
Ted Stanion, Carl Sechen