Login / Signup

Design and analysis of asymptotically optimal randomized tree embedding algorithms in static networks.

Keqin Li
Published in: Perform. Evaluation (2005)
Keyphrases
  • asymptotically optimal
  • learning algorithm
  • multi dimensional
  • data structure
  • computational complexity
  • reinforcement learning
  • lower bound
  • np hard