• search
    search
  • reviewers
    reviewers
  • feeds
    feeds
  • assignments
    assignments
  • settings
  • logout

A New Method to Automatically Compute Processing Times for Random Walks Based Distributed Algorithms.

Thibault BernardAlain BuiMarc BuiDevan Sohier
Published in: ISPDC (2003)
Keyphrases
  • random walk
  • processing times
  • clustering method
  • objective function
  • computational complexity
  • learning algorithm
  • directed graph
  • search procedure