Suchergebnisse - F.2.2 [Analysis of algorithms and problems complexity]: Nonnumerical algorithms and problems

  • Treffer 1 - 4 von 4
Treffer weiter einschränken
  1. 1

    Precise Complexity Analysis for Efficient Datalog Queries

    Autoren: K. Tuncay Tekle Yanhong A. Liu The Pennsylvania State University CiteSeerX Archives

    Weitere Verfasser: K. Tuncay Tekle Yanhong A. Liu The Pennsylvania State University CiteSeerX Archives

    Quelle: http://www.cs.sunysb.edu/%7Eliu/papers/RuleQuery-PPDP10.pdf.

    Schlagwörter: F.2.2 [Analysis of Algorithms and Problems Complexity, Nonnumerical Algorithms and Problems—Computations on discrete structures, H.2.3 [Information Systems, Database Management— Query languages, H.2.4 [Information Systems, Systems—Query processing, Rule-based databases General Terms Languages, Performance Keywords Complexity analysis, Datalog, demand-driven evaluation, program transformation

    Dateibeschreibung: application/pdf

    Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.183.4887

    Verfügbarkeit: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.183.4887
    http://www.cs.sunysb.edu/%7Eliu/papers/RuleQuery-PPDP10.pdf

    View record from BASE Nájsť tento článok vo Web of Science
    Zu den Favoriten
  2. 2

    Convergence Time to Nash Equilibrium in Load Balancing

    Autoren: Eyal Even-Dar Alex Kesselman , Yishay Mansour The Pennsylvania State University CiteSeerX Archives

    Weitere Verfasser: Eyal Even-Dar Alex Kesselman , Yishay Mansour The Pennsylvania State University CiteSeerX Archives

    Quelle: http://www.seas.upenn.edu/~evendar/papers/convergence.pdf.

    Schlagwörter: Categories and Subject Descriptors, F.2.2 [Analysis of Algorithms and Problems Complexity, Nonnumerical Algorithms and Problems General Terms, Algorithms, Theory, Game Theory Additional Key Words and Phrases, Nash Equilibrium

    Dateibeschreibung: application/pdf

    Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.102.5090; http://www.seas.upenn.edu/~evendar/papers/convergence.pdf

    Verfügbarkeit: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.102.5090
    http://www.seas.upenn.edu/~evendar/papers/convergence.pdf

    View record from BASE Nájsť tento článok vo Web of Science
    Zu den Favoriten
  3. 3

    Eigenvalues and Expansion of Regular Graphs

    Autoren: Nabil Kahale The Pennsylvania State University CiteSeerX Archives

    Weitere Verfasser: Nabil Kahale The Pennsylvania State University CiteSeerX Archives

    Quelle: http://www.research.att.com/~kahale/papers/jacm.ps.

    Schlagwörter: Categories and Subject Descriptors, F.2.2 [Analysis of Algorithms and Problems Complexity, Nonnumerical Algorithms and Problems, G.2.2 [Discrete Mathematics, Graph Theory General Terms, Algorithms, Theory Additional Key Words and Phrases, Eigenvalues, Expander graphs, Induced subgraphs, Load balancing, Ramanujan graphs, Random walks, Selection networks

    Dateibeschreibung: application/postscript

    Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.47.7886; http://www.research.att.com/~kahale/papers/jacm.ps

    Verfügbarkeit: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.47.7886
    http://www.research.att.com/~kahale/papers/jacm.ps

    View record from BASE Nájsť tento článok vo Web of Science
    Zu den Favoriten
  4. 4

    Average-Case Lower Bounds for the Plurality Problem.

    Autoren: ALONSO, LAURENT REINGOLD, EDWARD M.

    Quelle: ACM Transactions on Algorithms; 2008, Vol. 4 Issue 3, p27-27:17, 17p, 1 Diagram, 4 Charts

    Schlagwörter: ALGORITHMS, SET theory, MATHEMATICAL analysis, NUMERICAL analysis, PROBLEM solving, THEORY

    Full Text Finder Nájsť tento článok vo Web of Science
    Zu den Favoriten

Suchwerkzeuge: