5606 search results - page 284 / 1122 » Randomization Techniques for Graphs. |
192
click to vote
ICST
2009
IEEE
15 years 4 months ago
2009
IEEE
This paper reports an empirical evaluation of four blackbox testing techniques for crashing programs through their GUI interface: SH, AF, DH, and BxT. The techniques vary in their...
167
click to vote
AICOM
2006
15 years 6 months ago
2006
In this work we present a backjumping technique for Disjunctive Logic Programming (DLP) under the Answer Set Semantics. It builds upon related techniques that had originally been p...
203
click to vote
PR
2008
15 years 5 months ago
2008
The randomness of iris pattern makes it one of the most reliable biometric traits. On the other hand, the complex iris image structure and the various sources of intra-class varia...
168
click to vote
FORTE
2004
15 years 8 months ago
2004
This paper proposes an algorithm for the construction of an MSC graph from a given set of actual behaviors of an existing concurrent system which has repetitive subfunctions. Such ...
219
click to vote
AI
2011
Springer
15 years 1 months ago
2011
Springer
Planning graphs have been shown to be a rich source of heuristic information for many kinds of planners. In many cases, planners must compute a planning graph for each element of ...