Sciweavers

526 search results - page 8 / 106
» Type Abstractions of Name-Passing Processes
Sort
View
IFL
2007
Springer
221views Formal Methods» more  IFL 2007»
14 years 2 months ago
From Contracts Towards Dependent Types: Proofs by Partial Evaluation
Abstract. The specification and resolution of non-trivial domain constraints has become a well-recognised measure for improving the stability of large software systems. In this pa...
Stephan Herhut, Sven-Bodo Scholz, Robert Bernecky,...
IS
2011
13 years 3 months ago
Time prediction based on process mining
Abstract. Process mining allows for the automated discovery of process models from event logs. These models provide insights and enable various types of model-based analysis. This ...
Wil M. P. van der Aalst, M. H. Schonenberg, Minseo...
TASLP
2011
13 years 3 months ago
Predicting Preference Judgments of Individual Normal and Hearing-Impaired Listeners With Gaussian Processes
Abstract—A probabilistic kernel approach to pairwise preference learning based on Gaussian processes is applied to predict preference judgments for sound quality degradation mech...
Perry Groot, Tom Heskes, Tjeerd Dijkstra, James M....
CORR
2011
Springer
190views Education» more  CORR 2011»
13 years 10 days ago
Doubly Robust Smoothing of Dynamical Processes via Outlier Sparsity Constraints
Abstract—Coping with outliers contaminating dynamical processes is of major importance in various applications because mismatches from nominal models are not uncommon in practice...
Shahrokh Farahmand, Georgios B. Giannakis, Daniele...
ORDER
2007
79views more  ORDER 2007»
13 years 8 months ago
Computable Linearizations of Well-partial-orderings
Abstract. We analyze results on well-partial-orderings from the viewpoint of computability theory, and we answer a question posed by Diana Schmidt. We obtain the following results....
Antonio Montalbán