An Efficient Algorithm for Computing Elected Assertions in Partially Preordered Ontologies.
Sihem BelabbesSalem BenferhatPublished in: ICTAI (2021)
Keyphrases
- dynamic programming
- detection algorithm
- theoretical analysis
- optimization algorithm
- recognition algorithm
- times faster
- experimental evaluation
- improved algorithm
- computational complexity
- k means
- np hard
- highly efficient
- computational cost
- search algorithm
- estimation algorithm
- learning algorithm
- objective function
- path planning
- segmentation algorithm
- expectation maximization
- high accuracy
- memory efficient
- simulated annealing
- matching algorithm
- classification algorithm
- semi automatic
- scheduling problem
- search space
- artificial neural networks
- optimal solution
- knowledge base