A Case Study in Timed CSP: The Railroad Crossing Problem.
Luming LaiPhil WatsonPublished in: HART (1997)
Keyphrases
- constraint satisfaction problems
- petri net
- constraint satisfaction
- arc consistency
- constraint propagation
- constraint programming
- tree decompositions
- arc consistency algorithm
- discrete event
- np hard
- case study
- test bed
- video sequences
- real time
- bayesian networks
- constraint networks
- search engine
- decomposition methods
- tree decomposition
- distributed constraint satisfaction problems
- backtracking search
- machine learning
- neural network