Εμφανίζονται 1 - 10 Αποτελέσματα από 16 για την αναζήτηση '"Approximation algorithms."', χρόνος αναζήτησης: 0,02δλ Περιορισμός αποτελεσμάτων
  1. 1

    Approximate iterative algorithms ανά Almudevar, Anthony

    Έκδοση 2014
    Available for University of the Philippines Diliman College of Engineering via CRCnetBASE. Click here to access
    Also available remotely for University of the Philippines Diliman College of Engineering via CRCnetBASE. Click here to access thru EZproxy
    Electronic Resource

    Approximate iterative algorithms
  2. 2

    Approximation algorithms for complex systems proceedings of the 6th international conference on algorithms for approximation, Ambleside, UK, 31st August - 4th September 2009 ανά Georgoulis, Emmanuil H.

    Έκδοση 2011
    Available for University of the Philippines Diliman via SpringerLink. Click here to access
    Electronic Resource

    Approximation algorithms for complex systems proceedings of the 6th international conference on algorithms for approximation, Ambleside, UK, 31st August - 4th September 2009
  3. 3

    Local ratio: a unified framework for approximation algorithms. In memoriam Shimon Even 1935-2004. ανά Bar-Yehuda, Reuven

    Τόπος έκδοσης ACM computing surveys.
    Άρθρο

    Local ratio: a unified framework for approximation algorithms. In memoriam Shimon Even 1935-2004.
  4. 4

    A Survey of Graph Layout Problems. ανά Diaz, Josep

    Τόπος έκδοσης ACM computing surveys.
    Άρθρο

    A Survey of Graph Layout Problems.
  5. 5

    An approximation result for a duo-processor task scheduling problem. ανά Olmo, P. Dell

    Τόπος έκδοσης Information processing letters.
    Άρθρο

    An approximation result for a duo-processor task scheduling problem.
  6. 6

    On approximating the memory-Constrained Module Allocation Problem. ανά Roupin, Frederic

    Τόπος έκδοσης Information processing letters.
    Άρθρο

    On approximating the memory-Constrained Module Allocation Problem.
  7. 7

    An approximation algorithm for clustering graphs with dominating diametral path. ανά Deogun, Jitender S.

    Τόπος έκδοσης Information processing letters.
    Άρθρο

    An approximation algorithm for clustering graphs with dominating diametral path.
  8. 8

    Coloring k-colorable graphs using relatively small palettes. ανά Halperin, Eran

    Τόπος έκδοσης Journal of algorithms.
    Άρθρο

    Coloring k-colorable graphs using relatively small palettes.
  9. 9

    Optimal Time Bounds for Approximate Clustering. ανά Mettu, Ramgopal R.

    Τόπος έκδοσης Machine learning.
    Άρθρο

    Optimal Time Bounds for Approximate Clustering.
  10. 10

    Correlation clustering. ανά Bansal, Nikhil

    Τόπος έκδοσης Machine learning.
    Άρθρο

    Correlation clustering.

Εργαλεία αναζήτησης: