Search Results - "parallel randomized algorithm"

Refine Results
  1. 1

    Parallel Randomized Algorithm for Chance Constrained Program by Shen, Xun, Zhuang, Jiancang, Zhang, Xingguo

    ISSN: 2331-8422
    Published: Ithaca Cornell University Library, arXiv.org 07.11.2019
    Published in arXiv.org (07.11.2019)
    “…Chance constrained program is computationally intractable due to the existence of chance constraints, which are randomly disturbed and should be satisfied with…”
    Get full text
    Paper
  2. 2

    SERENADE: A Parallel Randomized Algorithm Suite for Crossbar Scheduling in Input-Queued Switches by Long, Gong, Liu, Liang, Sen, Yang, Xu, Jun, Xie, Yi, Wang, Xinbing

    ISSN: 2331-8422
    Published: Ithaca Cornell University Library, arXiv.org 02.07.2018
    Published in arXiv.org (02.07.2018)
    “…Most of today's high-speed switches and routers adopt an input-queued crossbar switch architecture. Such a switch needs to compute a matching (crossbar…”
    Get full text
    Paper
  3. 3

    Fast Parallel Randomized Algorithm for Nonnegative Matrix Factorization with KL Divergence for Large Sparse Datasets by Nguyen, Duy Khuong, Tu, Bao Ho

    ISSN: 2331-8422
    Published: Ithaca Cornell University Library, arXiv.org 14.04.2016
    Published in arXiv.org (14.04.2016)
    “…Nonnegative Matrix Factorization (NMF) with Kullback-Leibler Divergence (NMF-KL) is one of the most significant NMF problems and equivalent to Probabilistic…”
    Get full text
    Paper
  4. 4

    A Parallel Randomized Algorithm for Finding a Maximal Independent Set in a Linear Hypergraph by Łuczak, Tomasz, Szymańska, Edyta

    ISSN: 0196-6774, 1090-2678
    Published: San Diego, CA Elsevier Inc 01.11.1997
    Published in Journal of algorithms (01.11.1997)
    “…We present a randomized parallel algorithm with polylogarithmic expected running time for finding a maximal independent set in a linear hypergraph…”
    Get full text
    Journal Article
  5. 5

    New parallel randomized algorithms for the traveling salesman problem by Shi, Leyuan, Ólafsson, Sigurdur, Sun, Ning

    ISSN: 0305-0548, 1873-765X, 0305-0548
    Published: Oxford Elsevier Ltd 01.04.1999
    Published in Computers & operations research (01.04.1999)
    “…We recently developed a new randomized optimization framework, the Nested Partitions (NP) method. This approach uses partitioning, global random sampling, and…”
    Get full text
    Journal Article
  6. 6

    Optimal Parallel Randomized Algorithms for the Voronoi Diagram of Line Segments in the Plane by Rajasekaran, S., Ramaswami, S.

    ISSN: 0178-4617, 1432-0541
    Published: New York, NY Springer 01.08.2002
    Published in Algorithmica (01.08.2002)
    Get full text
    Journal Article
  7. 7

    Statistical analysis of parallel randomized algorithms for VLSI placement and implementation on workstation networks by Efe, Kemal

    ISSN: 0141-9331, 1872-9436
    Published: Elsevier B.V 01.08.1995
    Published in Microprocessors and microsystems (01.08.1995)
    “…A massively parallel optimization approach based on simple neighbourhood search techniques is developed and applied to the problem of VLSI cell placement…”
    Get full text
    Journal Article
  8. 8

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

    ISSN: 0097-5397, 1095-7111
    Published: Philadelphia, PA Society for Industrial and Applied Mathematics 01.06.1992
    Published in SIAM journal on computing (01.06.1992)
    “… 16th International Conference on Parallel Processing, 1987]. This paper presents an optimal parallel randomized algorithm for computing intersection of half spaces in three dimensions…”
    Get full text
    Journal Article
  9. 9

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

    ISSN: 0097-5397, 1095-7111
    Published: Philadelphia Society for Industrial and Applied Mathematics 01.04.1994
    Published in SIAM journal on computing (01.04.1994)
    Get full text
    Journal Article
  10. 10

    Approximate Uncertain Program by Shen, Xun, Zhuang, Jiancang, Zhang, Xingguo

    ISSN: 2169-3536, 2169-3536
    Published: Piscataway IEEE 2019
    Published in IEEE access (2019)
    “…Chance constrained program where one seeks to minimize an objective over decisions which satisfy randomly disturbed constraints with a given probability is…”
    Get full text
    Journal Article
  11. 11

    A sublinear-time randomized approximation algorithm for matrix games by Grigoriadis, Michael D., Khachiyan, Leonid G.

    ISSN: 0167-6377, 1872-7468
    Published: Amsterdam Elsevier B.V 01.09.1995
    Published in Operations research letters (01.09.1995)
    “…This paper presents a parallel randomized algorithm which computes a pair of ε-optimal strategies for a given ( m, n)-matrix game A = [ a ij ] ϵ [−1, 1] in O( ε −2log 2( n+ m…”
    Get full text
    Journal Article
  12. 12

    Approximate Uncertain Program by Shen, Xun, Zhuang, Jiancang, Zhang, Xingguo

    ISSN: 2331-8422
    Published: Ithaca Cornell University Library, arXiv.org 12.11.2019
    Published in arXiv.org (12.11.2019)
    “…Chance constrained program where one seeks to minimize an objective over decisions which satisfy randomly disturbed constraints with a given probability is…”
    Get full text
    Paper
  13. 13

    An Optimal Randomized Parallel Algorithm for Finding Connected Components in a Graph by Gazit, Hillel

    ISSN: 0097-5397, 1095-7111
    Published: Philadelphia, PA Society for Industrial and Applied Mathematics 01.12.1991
    Published in SIAM journal on computing (01.12.1991)
    “…A parallel randomized algorithm for finding the connected components of an undirected graph is presented…”
    Get full text
    Journal Article
  14. 14

    Parallel Computation of Combinatorial Symmetries by Anders, Markus, Schweitzer, Pascal

    ISSN: 2331-8422
    Published: Ithaca Cornell University Library, arXiv.org 10.08.2021
    Published in arXiv.org (10.08.2021)
    “… However no competitive parallel tools are available for the task. We introduce a new parallel randomized algorithm that is based on a modification of the individualization-refinement paradigm used by sequential solvers…”
    Get full text
    Paper
  15. 15

    A Randomized Parallel Algorithm for Planar Graph Isomorphism by Gazit, Hillel, Reif, John H

    ISSN: 0196-6774, 1090-2678
    Published: San Diego, CA Elsevier Inc 01.08.1998
    Published in Journal of algorithms (01.08.1998)
    “…We present a parallel randomized algorithm running on aCRCW PRAM, to determine whether two planar graphs are isomorphic, and if so to find the isomorphism…”
    Get full text
    Journal Article
  16. 16

    A parallel algorithm for compile-time scheduling of parallel programs on multiprocessors by Yu-Kwong Kwok, Ahmad, I.

    ISBN: 0818680903, 9780818680908
    Published: IEEE 1997
    “…Proposes a parallel randomized algorithm, called PFAST (Parallel Fast Assignment using Search Technique…”
    Get full text
    Conference Proceeding
  17. 17

    A Parallel Algorithm For Compile-Time Scheduling Of Parallel Programs On Multiprocessors by Kwok, Yu-Kwong, Ahmad, I.

    ISBN: 0818680903, 9780818680908
    Published: Washington, DC, USA IEEE Computer Society 11.11.1997
    “…Proposes a parallel randomized algorithm, called PFAST (Parallel Fast Assignment using Search Technique…”
    Get full text
    Conference Proceeding
  18. 18

    An optimal randomized parallel algorithm for finding connected components in a graph by Gazit, Hillel

    ISBN: 0818607408, 9780818607400
    ISSN: 0272-5428
    Published: IEEE 01.10.1986
    “…We present a parallel randomized algorithm for finding the connected components of an undirected graph…”
    Get full text
    Conference Proceeding
  19. 19

    Nearly-Linear Work Parallel SDD Solvers, Low-Diameter Decomposition, and Low-Stretch Subgraphs by Blelloch, Guy E., Gupta, Anupam, Koutis, Ioannis, Miller, Gary L., Peng, Richard, Tangwongsan, Kanat

    ISSN: 1432-4350, 1433-0490
    Published: Boston Springer US 01.10.2014
    Published in Theory of computing systems (01.10.2014)
    “…We present the design and analysis of a nearly-linear work parallel algorithm for solving symmetric diagonally dominant (SDD) linear systems. On input an SDD n…”
    Get full text
    Journal Article
  20. 20

    Robust maximum likelihood estimation for stochastic state space model with observation outliers by AlMutawa, J.

    ISSN: 0020-7721, 1464-5319
    Published: Taylor & Francis 17.08.2016
    Published in International journal of systems science (17.08.2016)
    “…The objective of this paper is to develop a robust maximum likelihood estimation (MLE) for the stochastic state space model via the expectation maximisation…”
    Get full text
    Journal Article