Sciweavers

1882 search results - page 250 / 377
» Transformational Programming and Forests
Sort
View
ICALP
1990
Springer
15 years 10 months ago
Determining the Separation of Preprocessed Polyhedra - A Unified Approach
We show how (now familiar) hierarchical representations of (convex) polyhedra can be used to answer various separation queries efficiently (in a number of cases, optimally). Our e...
David P. Dobkin, David G. Kirkpatrick
DATE
2004
IEEE
117views Hardware» more  DATE 2004»
15 years 9 months ago
Modeling and Validating Globally Asynchronous Design in Synchronous Frameworks
We lay a foundation for modeling and validation of asynchronous designs in a multi-clock synchronous programming model. This allows us to study properties of globally asynchronous...
Mohammad Reza Mousavi, Paul Le Guernic, Jean-Pierr...
FMCO
2006
Springer
128views Formal Methods» more  FMCO 2006»
15 years 9 months ago
Model-Based Test Selection for Infinite-State Reactive Systems
This paper addresses the problem of off-line selection of test cases for testing the conformance of a black-box implementation with respect to a specification, in the context of re...
Bertrand Jeannet, Thierry Jéron, Vlad Rusu
ICALP
2000
Springer
15 years 9 months ago
Amalgamation of Transition Sequences in the PEPA Formalism
This report presents a formal approach to reducing sequences in PEPA components. Performing the described amalgamation procedure we may remove, from the underlying Markov chain, t...
Jane Hillston, J. Tomasik
PKDD
2000
Springer
120views Data Mining» more  PKDD 2000»
15 years 9 months ago
Multi-Relational Data Mining, Using UML for ILP
Although there is a growing need for multi-relational data mining solutions in KDD, the use of obvious candidates from the field of Inductive Logic Programming (ILP) has been limit...
Arno J. Knobbe, Arno Siebes, Hendrik Blockeel, Dan...