A lower bound on range-free node localization algorithms.
Stuart MacLeanSuprakash DattaPublished in: ISWCS (2008)
Keyphrases
- lower bound
- orders of magnitude
- computational cost
- worst case
- learning algorithm
- wide range
- computational complexity
- upper bound
- computationally efficient
- branch and bound algorithm
- theoretical analysis
- finding optimal solutions
- benchmark datasets
- machine learning algorithms
- constraint satisfaction problems
- optimization problems
- significant improvement
- optimal solution
- social networks