Sciweavers

15792 search results - page 140 / 3159
» Computational Abstraction Steps
Sort
View
EDOC
2006
IEEE
14 years 1 months ago
Combining Analysis of Unstructured Workflows with Transformation to Structured Workflows
Abstract-- Analysis of workflows in terms of structural correctness is important for ensuring the quality of workflow models. Typically, this analysis is only one step in a larger ...
Rainer Hauser, Michael Friess, Jochen Malte Kü...
DSVIS
1994
Springer
14 years 1 months ago
A Model-Based Approach to Presentation: A Continuum from Task Analysis to Prototype
This paper presents a complete model-based approach to the building of presentation for a business oriented highly interactive application. This approach is considered complete in...
François Bodart, Anne-Marie Hennebert, Isab...
MP
2010
135views more  MP 2010»
13 years 8 months ago
An inexact Newton method for nonconvex equality constrained optimization
Abstract We present a matrix-free line search algorithm for large-scale equality constrained optimization that allows for inexact step computations. For sufficiently convex problem...
Richard H. Byrd, Frank E. Curtis, Jorge Nocedal
FORMATS
2010
Springer
13 years 7 months ago
Expected Reachability-Time Games
In an expected reachability-time game (ERTG) two players, Min and Max, move a token along the transitions of a probabilistic timed automaton, so as to minimise and maximise, respec...
Vojtech Forejt, Marta Z. Kwiatkowska, Gethin Norma...
ADCM
2011
13 years 4 months ago
The missing Wendland functions
Abstract: The Wendland radial basis functions [8, 9] are piecewise polynomial compactly supported reproducing kernels in Hilbert spaces which are norm–equivalent to Sobolev space...
Robert Schaback