An Algorithm for Exact Bounds on the Time Separation of Events in Concurrent Systems.
Tod AmonHenrik HulgaardSteven M. BurnsGaetano BorrielloPublished in: ICCD (1993)
Keyphrases
- computational complexity
- optimization algorithm
- optimal solution
- detection algorithm
- experimental evaluation
- theoretical analysis
- lower and upper bounds
- cost function
- preprocessing
- np hard
- dynamic programming
- computational cost
- significant improvement
- upper bound
- recognition algorithm
- worst case
- error bounds
- matching algorithm
- concurrent systems
- brute force
- upper and lower bounds
- learning algorithm
- segmentation algorithm
- particle swarm optimization
- object oriented
- probabilistic model
- lower bound
- similarity measure
- information systems