Taming the complexity of timeline-based planning over dense temporal domains (Q5875669)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7650331
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Taming the complexity of timeline-based planning over dense temporal domains |
scientific article; zbMATH DE number 7650331 |
Statements
3 February 2023
0 references
timeline-based planning
0 references
timed automata
0 references
event-clock automata
0 references
0.9754953980445862
0 references
0.8857976198196411
0 references
0.8515698313713074
0 references
0.7670426964759827
0 references
0.7502503991127014
0 references
