Brief Annoucement: Analysis of an Optimal Bit Complexity Randomised Distributed Vertex Colouring Algorithm.
Yves MétivierJohn Michael RobsonNasser Saheb-DjahromiAkka ZemmariPublished in: OPODIS (2009)
Keyphrases
- worst case
- dynamic programming
- optimal solution
- computational complexity
- learning algorithm
- detection algorithm
- preprocessing
- np hard
- experimental evaluation
- computational cost
- complexity analysis
- space complexity
- exhaustive search
- optimization algorithm
- objective function
- globally optimal
- matching algorithm
- locally optimal
- linear programming
- upper bound
- k means
- segmentation algorithm
- theoretical analysis
- simulated annealing
- path planning
- hardware implementation
- search procedure
- search space
- optimal strategy
- lower bound
- greedy heuristic
- search algorithm
- error tolerance