A distributed algorithm for determining minimal covers of acyclic database schemes.
Xinming YePublished in: J. Comput. Sci. Technol. (1994)
Keyphrases
- detection algorithm
- preprocessing
- matching algorithm
- experimental evaluation
- computational complexity
- k means
- dynamic programming
- objective function
- improved algorithm
- recognition algorithm
- segmentation algorithm
- worst case
- theoretical analysis
- high accuracy
- optimization algorithm
- computationally efficient
- distributed systems
- simulated annealing
- computational cost
- np hard
- cost function
- significant improvement
- times faster
- search space
- multi robot
- optimal solution