Sökning: "Bounded exhaustive search"

Hittade 2 uppsatser innehållade orden Bounded exhaustive search.

1. 1. Bounded exhaustive generation of tests in model-based testing

   Master-uppsats, KTH/Skolan för elektroteknik och datavetenskap (EECS)

   Författare :Nour Alhuda Almajni; [2021]
   Nyckelord :Model-based testing; Modbat; Bounded exhaustive search; Random search.; Modellbaserad testning; Modbat; Begränsad uttömmande sökning; Slumpmässig sökning.;

   Sammanfattning : There are some systems (or parts of systems) that are very critical and need especially good test suites to test them. For these critical systems, exhaustive testing may be a good way to test them. Thus, we have implemented two versions of bounded exhaustive search (BES) algorithms in a model-based testing tool called, Modbat. LÄS MER

3. 2. Upper Bounds on the Time Complexity of Temporal CSPs

   Master-uppsats, Linköpings universitet/Institutionen för datavetenskap

   Författare :Peter Stockman; [2016]
   Nyckelord :CSP; Algorithms;

   Sammanfattning : The temporal constraint satisfaction problem (CSP) offers a formalized way to reason about in which order tasks should be accomplished. Using this we can model a wide set of specific problems from scheduling to AI. LÄS MER