Erakusten 1.441 - 1.450 emaitzak -- 1.826 bilaketa honetara '"Algorithm"', Bilaketaren denbora: 0,02s Findu emaitzak
  1. 1441

    Monotonic reductions, representative equivalence and compilation of intractable problems. nork Liberatore, P.

    Argitaratua izan da Journal of the ACM
    Artikulua

    Monotonic reductions, representative equivalence and compilation of intractable problems.
  2. 1442

    A Laplace transform algorithm for the volume of a convex polytope. nork Lasserre, Jean B.

    Argitaratua izan da Journal of the ACM
    Artikulua

    A Laplace transform algorithm for the volume of a convex polytope.
  3. 1443

    Deciding first-order properties of locally tree-decomposable structures. nork Frick, Markus

    Argitaratua izan da Journal of the ACM
    Artikulua

    Deciding first-order properties of locally tree-decomposable structures.
  4. 1444

    Static analysis in datalog extensions. nork Halevy, Alon Y.

    Argitaratua izan da Journal of the ACM
    Artikulua

    Static analysis in datalog extensions.
  5. 1445

    Improved implementations of binary universal operations. nork Attiya, Hagit

    Argitaratua izan da Journal of the ACM
    Artikulua

    Improved implementations of binary universal operations.
  6. 1446

    Asymmetric clustering of microarchitectures through dynamic-selective shutdown and sharing of functional units nork Tan, Wilson Mazo

    Thesis

    Asymmetric clustering of microarchitectures through dynamic-selective shutdown and sharing of functional units
  7. 1447

    An efficient algorithm for image segmentation, Markov random fields and related problems. nork Hochbaum, Dorit S.

    Argitaratua izan da Journal of the ACM
    Artikulua

    An efficient algorithm for image segmentation, Markov random fields and related problems.
  8. 1448

    Poly-logarithmic deterministic fully-dynamic algorithms for connectivity, minimum spanning tree, 2-edge, and biconnectivity. nork Holm, Jacob

    Argitaratua izan da Journal of the ACM
    Artikulua

    Poly-logarithmic deterministic fully-dynamic algorithms for connectivity, minimum spanning tree, 2-edge, and biconnectivity.
  9. 1449

    A combinatorial strongly polynomial algorithm for minimizing submodular functions. nork Iwata, Satoru

    Argitaratua izan da Journal of the ACM
    Artikulua

    A combinatorial strongly polynomial algorithm for minimizing submodular functions.
  10. 1450

    Quantum lower bounds by polynomials. nork Beals, Robert

    Argitaratua izan da Journal of the ACM
    Artikulua

    Quantum lower bounds by polynomials.

Bilaketa egiteko lanabesak: