108 search results - page 9 / 22 » Constructing interaction test suites with greedy algorithms |
COORDINATION
2004
Springer
14 years 3 months ago
2004
Springer
A development environment for applications specified in an extended version of a previously developed coordination model based on associatively broadcast interactions is presented....
CONCUR
2006
Springer
14 years 1 months ago
2006
Springer
Boolean programs with recursion are convenient abstractions of sequential imperative programs, and can be represented as recursive state machines (RSMs) or pushdown automata. Motiv...
SIGMOD
2009
ACM
14 years 10 months ago
2009
ACM
In order to enable extensibility, modern query optimizers typically leverage a transformation rule based framework. Testing individual rule correctness as well as correctness of r...
PODS
2007
ACM
14 years 10 months ago
2007
ACM
We consider the problem of constructing decision trees for entity identification from a given relational table. The input is a table containing information about a set of entities...
CIAC
2000
Springer
14 years 2 months ago
2000
Springer
A minimum spanning tree (MST) with a small diameter is required in numerous practical situations. It is needed, for example, in distributed mutual exclusion algorithms in order to ...