Incremental segmentation and landmark-based heuristic repair enable efficient correction of traces exceeding 25,000 entries against temporal behavior tree specifications.
Artificial Life22(1), 23–48 (02 2016)
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
verdicts
UNVERDICTED 2representative citing papers
Recovers factor-graph structure in Napp-Adams CRNs to transport reduction results, yielding smaller networks that preserve belief-propagation fixed points on surviving variables.
citing papers explorer
-
Trace Repair for Temporal Behavior Trees
Incremental segmentation and landmark-based heuristic repair enable efficient correction of traces exceeding 25,000 entries against temporal behavior tree specifications.
-
Reduction of Probabilistic Chemical Reaction Networks
Recovers factor-graph structure in Napp-Adams CRNs to transport reduction results, yielding smaller networks that preserve belief-propagation fixed points on surviving variables.