Výsledky vyhledávání - "deterministic parallel algorithms"

  1. 1

    Hybrid Random/Deterministic Parallel Algorithms for Convex and Nonconvex Big Data Optimization Autor Daneshmand, Amir, Facchinei, Francisco, Kungurtsev, Vyacheslav, Scutari, Gesualdo

    ISSN: 1053-587X, 1941-0476
    Vydáno: IEEE 01.08.2015
    “…We propose a decomposition framework for the parallel optimization of the sum of a differentiable (possibly nonconvex) function and a nonsmooth (possibly…”
    Získat plný text
    Journal Article
  2. 2

    Deterministic Parallel Algorithms for Bilinear Objective Functions Autor Harris, David G.

    ISSN: 0178-4617, 1432-0541
    Vydáno: New York Springer US 15.03.2019
    Vydáno v Algorithmica (15.03.2019)
    “…Many randomized algorithms can be derandomized efficiently using either the method of conditional expectations or probability spaces with low independence. A…”
    Získat plný text
    Journal Article
  3. 3

    Deterministic parallel algorithms for bilinear objective functions Autor Harris, David G

    ISSN: 2331-8422
    Vydáno: Ithaca Cornell University Library, arXiv.org 21.06.2018
    Vydáno v arXiv.org (21.06.2018)
    “…Many randomized algorithms can be derandomized efficiently using either the method of conditional expectations or probability spaces with low independence. A…”
    Získat plný text
    Paper
  4. 4

    Hybrid Random/Deterministic Parallel Algorithms for Nonconvex Big Data Optimization Autor Daneshmand, Amir, Facchinei, Francisco, Kungurtsev, Vyacheslav, Scutari, Gesualdo

    ISSN: 2331-8422
    Vydáno: Ithaca Cornell University Library, arXiv.org 02.09.2014
    Vydáno v arXiv.org (02.09.2014)
    “…We propose a decomposition framework for the parallel optimization of the sum of a differentiable {(possibly nonconvex)} function and a nonsmooth (possibly…”
    Získat plný text
    Paper
  5. 5

    Deterministic parallel algorithms for fooling polylogarithmic juntas and the Lovasz Local Lemma Autor Harris, David G

    ISSN: 2331-8422
    Vydáno: Ithaca Cornell University Library, arXiv.org 20.08.2018
    Vydáno v arXiv.org (20.08.2018)
    “… deterministic parallel algorithms for combinatorial optimization problems involving sums of \(w\)-juntas. We improve these algorithms through derandomized variable partitioning and a new code construction for fooling Fourier characters…”
    Získat plný text
    Paper
  6. 6

    The probabilistic method yields deterministic parallel algorithms Autor Motwani, R., Naor, J., Naor, M.

    ISBN: 9780818619823, 0818619821
    Vydáno: IEEE Comput. Soc. Press 1989
    “…A method is provided for converting randomized parallel algorithms into deterministic parallel algorithms…”
    Získat plný text
    Konferenční příspěvek
  7. 7

    An Efficient Deterministic Parallel Algorithm for Adaptive Multidimensional Numerical Integration on GPUs Autor Arumugam, Kamesh, Godunov, Alexander, Ranjan, Desh, Terzic, Bala, Zubair, Mohammad

    ISSN: 0190-3918
    Vydáno: IEEE 01.10.2013
    “… In this study, we present an efficient deterministic parallel algorithm for adaptive multidimensional numerical integration on GPUs…”
    Získat plný text
    Konferenční příspěvek
  8. 8

    An efficient deterministic parallel algorithm for two processors precedence constraint scheduling Autor Jung, Hermann, Serna, Maria, Spirakis, Paul

    ISSN: 0304-3975, 1879-2294
    Vydáno: Amsterdam Elsevier B.V 31.01.2003
    Vydáno v Theoretical computer science (31.01.2003)
    “…We present here a new deterministic parallel algorithm for the two-processor scheduling problem…”
    Získat plný text
    Journal Article
  9. 9

    A deterministic parallel algorithm for the homing sequence problem Autor Ravikumar, B.

    ISBN: 9780818676833, 0818676833
    Vydáno: IEEE 1996
    “… The author present a deterministic parallel algorithm of time complexity O(/spl radic/nlog/sup 2/n…”
    Získat plný text
    Konferenční příspěvek
  10. 10

    A deterministic parallel algorithm for planar graphs isomorphism Autor Gazit, H.

    ISBN: 0818624450, 9780818624452
    Vydáno: IEEE Comput. Soc. Press 1991
    “…A deterministic parallel algorithm for determining whether two planar graphs are isomorphic is presented…”
    Získat plný text
    Konferenční příspěvek
  11. 11

    Non-determinism analyses in a parallel-functional language Autor PEÑA, RICARDO, SEGURA, CLARA

    ISSN: 0956-7968, 1469-7653
    Vydáno: Cambridge, UK Cambridge University Press 01.01.2005
    Vydáno v Journal of functional programming (01.01.2005)
    “… This feature is essential in reactive systems and very useful in some deterministic parallel algorithms…”
    Získat plný text
    Journal Article
  12. 12

    Polynomial Identity Testing: Derandomization Results and Applications to Algebraic Computation Autor Mendes de Oliveira, Rafael

    ISBN: 9780355323344, 0355323346
    Vydáno: ProQuest Dissertations & Theses 01.01.2017
    “… parallel algorithms for such algorithmic problems. The aim of this thesis is to provide new results and new approaches to solving the PIT problem…”
    Získat plný text
    Dissertation
  13. 13

    Scan-First Search and Sparse Certificates: An Improved Parallel Algorithm for k -Vertex Connectivity Autor Cheriyan, Joseph, Kao, Ming-Yang, Thurimella, Ramakrishna

    ISSN: 0097-5397, 1095-7111
    Vydáno: Philadelphia, PA Society for Industrial and Applied Mathematics 01.02.1993
    Vydáno v SIAM journal on computing (01.02.1993)
    “…Given a graph $G = (V,E)$, a certificate of $k$-vertex connectivity is an edge subset $E' \subset E$ such that the subgraph $(V,E')$ is $k$-vertex connected if…”
    Získat plný text
    Journal Article
  14. 14

    Parallel Algorithms with Processor Failures and Delays Autor Buss, Jonathan F., Kanellakis, Paris C., Ragde, Prabhakar L., Shvartsman, Alex Allister

    ISSN: 0196-6774, 1090-2678
    Vydáno: San Diego, CA Elsevier Inc 01.01.1996
    Vydáno v Journal of algorithms (01.01.1996)
    “…We study efficient deterministic parallel algorithms on two models: restartable fail-stop CRCW PRAMs and asynchronous PRAMs…”
    Získat plný text
    Journal Article
  15. 15

    Optimal Parallel Randomized Algorithms for Three-Dimensional Convex Hulls and Related Problems Autor Reif, John H., Sen, Sandeep

    ISSN: 0097-5397, 1095-7111
    Vydáno: Philadelphia, PA Society for Industrial and Applied Mathematics 01.06.1992
    Vydáno v SIAM journal on computing (01.06.1992)
    “…Further applications of random sampling techniques which have been used for deriving efficient parallel algorithms are presented by J. H. Reif and S. Sen…”
    Získat plný text
    Journal Article
  16. 16

    Scan-first search and sparse certificates. An improved parallel algorithm for k-vertex connectivity Autor Cheriyan, Joseph, Kao, Ming-Yang, Thurimella, Ramakrishna

    ISSN: 0097-5397
    Vydáno: 01.01.1993
    Vydáno v SIAM journal on computing (01.01.1993)
    “…Given a graph G = (V,E), a certificate of k-vertex connectivity is an edge subset E' much greater than E such that the subgraph (V, E') is k-vertex connected…”
    Získat plný text
    Journal Article
  17. 17

    Randomness as a computational resource: Issues in efficient computation Autor Chari, Suresh Narayana

    ISBN: 9798728238904
    Vydáno: ProQuest Dissertations & Theses 01.01.1994
    “…Probabilistic methods have become an integral part of theoretical computer science. Typically, the use of randomization leads to solutions which are simple,…”
    Získat plný text
    Dissertation
  18. 18

    Parallel techniques for paths, visibility, and related problems Autor Chen, Ziyi Danny

    ISBN: 9798208474433
    Vydáno: ProQuest Dissertations & Theses 01.01.1992
    “… Specifically, we give techniques for designing efficient deterministic parallel algorithms for solving the following problems…”
    Získat plný text
    Dissertation
  19. 19

    Depth-first search in directed planar graphs, revisited Autor Allender, Eric, Chauhan, Archit, Datta, Samir

    ISSN: 0001-5903, 1432-0525
    Vydáno: Berlin/Heidelberg Springer Berlin Heidelberg 01.08.2022
    Vydáno v Acta informatica (01.08.2022)
    “… to this (for more than a quarter-century), the fastest uniform deterministic parallel algorithm for this problem had a runtime of O ( log 10 n…”
    Získat plný text
    Journal Article
  20. 20

    Deterministic Low-Diameter Decompositions for Weighted Graphs and Distributed and Parallel Applications Autor Rozhon, Vaclav, Elkin, Michael, Grunau, Christoph, Haeupler, Bernhard

    ISSN: 2575-8454
    Vydáno: IEEE 01.10.2022
    “…This paper presents new deterministic and distributed low-diameter decomposition algorithms for weighted graphs. In particular, we show that if one can…”
    Získat plný text
    Konferenční příspěvek