Sciweavers

1805 search results - page 76 / 361
» Functional programming with structured graphs
Sort
View
ISCIS
2005
Springer
14 years 4 months ago
Recovering the Lattice of Repetitive Sub-functions
Abstract. Given a set of observations of an existing concurrent system with repetitive sub-functions, we consider the construction of an MSC graph representing the functionality of...
Guy-Vincent Jourdan, Hasan Ural, Hüsnü Y...
IOR
2011
152views more  IOR 2011»
13 years 5 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
IEE
2008
115views more  IEE 2008»
13 years 10 months ago
Faithful mapping of model classes to mathematical structures
ion techniques are indispensable for the specification and verification of functional behavior of programs. In object-oriented ation languages like JML, a powerful abstraction tec...
Ádám Darvas, Peter Müller
ADAEUROPE
2004
Springer
14 years 4 months ago
On the Tree Width of Ada Programs
The tree width of a graph G measures how close G is to being a tree or a series-parallel graph. Many well-known problems that are otherwise NP-complete can be solved efficiently if...
Bernd Burgstaller, Johann Blieberger, Bernhard Sch...
ECEASST
2006
305views more  ECEASST 2006»
13 years 10 months ago
The ParMol Package for Frequent Subgraph Mining
Mining for frequent subgraphs in a graph database has become a popular topic in the last years. Algorithms to solve this problem are used in chemoinformatics to find common molecul...
Thorsten Meinl, Marc Wörlein, Olga Urzova, In...