Sciweavers

692 search results - page 113 / 139
» Understanding Finiteness Analysis Using Abstract Interpretat...
Sort
View
MFCS
2005
Springer
15 years 5 months ago
Nondeterministic Graph Searching: From Pathwidth to Treewidth
Abstract. We introduce nondeterministic graph searching with a controlled amount of nondeterminism and show how this new tool can be used in algorithm design and combinatorial anal...
Fedor V. Fomin, Pierre Fraigniaud, Nicolas Nisse
ER
2008
Springer
179views Database» more  ER 2008»
15 years 1 months ago
Recommendation Based Process Modeling Support: Method and User Experience
Abstract Although most workflow management systems nowadays offer graphical editors for process modeling, the learning curve is still too steep for users who are unexperienced in p...
Thomas Hornung, Agnes Koschmider, Georg Lausen
SLP
1993
110views more  SLP 1993»
15 years 1 months ago
Logic Program Specialisation With Deletion of Useless Clauses
In this paper we describe a method of programspecialisation and give an extended example of its application to specialisation of a refutation proof procedure for rst order logic. ...
D. Andre de Waal, John P. Gallagher
CAISE
2010
Springer
15 years 28 days ago
Monitoring and Analyzing Service-Based Internet Systems through a Model-Aware Service Environment
Abstract As service-based Internet systems get increasingly complex they become harder to manage at design time as well as at runtime. Nowadays, many systems are described in terms...
Ta'id Holmes, Uwe Zdun, Florian Daniel, Schahram D...
TSMC
2008
136views more  TSMC 2008»
14 years 11 months ago
Learning Relational Descriptions of Differentially Expressed Gene Groups
Abstract-- This paper presents a method that uses gene ontologies, together with the paradigm of relational subgroup discovery, to find compactly described groups of genes differen...
Igor Trajkovski, Filip Zelezný, Nada Lavrac...