Sciweavers

4488 search results - page 206 / 898
» Properties of NP-Complete Sets
Sort
View
APPROX
2008
Springer
125views Algorithms» more  APPROX 2008»
13 years 10 months ago
On the Degree Sequences of Random Outerplanar and Series-Parallel Graphs
In order to perform an average-case analysis for specific input distributions one needs to derive and understand properties of a 'typical' input instance. In the case of...
Nicla Bernasconi, Konstantinos Panagiotou, Angelik...
BPM
2008
Springer
136views Business» more  BPM 2008»
13 years 10 months ago
A Region-Based Algorithm for Discovering Petri Nets from Event Logs
The paper presents a new method for the synthesis of Petri nets from event logs in the area of Process Mining. The method derives a bounded Petri net that over-approximates the beh...
Josep Carmona, Jordi Cortadella, Michael Kishinevs...
SERVICES
2008
59views more  SERVICES 2008»
13 years 9 months ago
Standardizing Web Services: Overcoming 'Design by Committee'
Web service standards, like several other IT standards, are anticipatory, i.e., they are designed and codified in anticipation of actual adoption and use. As a result, the setting...
Sandeep Purao, John W. Bagby, Karthikeyan Umapathy
FMOODS
2003
13 years 9 months ago
The Kell Calculus: Operational Semantics and Type System
This paper1 presents the Kell calculus, a new distributed process calculus that retains the original insights of the Seal calculus (local actions, process replication) and of the M...
Philippe Bidinger, Jean-Bernard Stefani
COLING
1996
13 years 9 months ago
An Evaluation Semantics for DATR Theories
This paper describes an operational semantics for DATR theories. The semantics is presented as a set of inference rules that axiomatises the evaluation relationship for DATR expre...
Bill Keller