טוען...
Analysing ProB’s Constraint Solving Backends: What Do They Know? Do They Know Things? Let’s Find Out!
We evaluate the strengths and weaknesses of different backends of the ProB constraint solver. For this, we train a random forest over a database of constraints to classify whether a backend is able to find a solution within a given amount of time or answers unknown. The forest is then analysed in re...
שמור ב:
| הוצא לאור ב: | Rigorous State-Based Methods |
|---|---|
| Main Authors: | , , |
| פורמט: | Artigo |
| שפה: | Inglês |
| יצא לאור: |
2020
|
| נושאים: | |
| גישה מקוונת: | https://ncbi.nlm.nih.gov/pmc/articles/PMC7242045/ https://ncbi.nlm.nih.govhttp://dx.doi.org/10.1007/978-3-030-48077-6_8 |
| תגים: |
הוספת תג
אין תגיות, היה/י הראשונ/ה לתייג את הרשומה!
|