Výsledky vyhľadávania - stochastic divide AND conquer algorithms

On the analysis of stochastic divide and conquer algorithms Autor Rösler, U.

Získať plný text

Likelihood Inference for Large Scale Stochastic Blockmodels With Covariates Based on a Divide-and-Conquer Parallelizable Algorithm With Communication Autor Roy, Sandipan, Atchadé, Yves, Michailidis, George

“…We consider a stochastic blockmodel equipped with node covariate information, that is, helpful in analyzing social network data…”
Získať plný text

On the analysis of stochastic divide and conquer algorithms: Average-Case Analysis of Algorithms Autor RÖSLER, U

Získať plný text

Iterative stochastic subspace self-consistent field method Autor Loos, Pierre-François, Rivail, Jean-Louis, Assfeld, Xavier

“…We propose a new self-consistent field (SCF) algorithm based on an iterative, partially stochastic “Divide & Conquer” -type approach…”
Získať plný text

On Kemeny's constant and stochastic complement Autor Bini, Dario Andrea, Durastante, Fabio, Kim, Sooyeong, Meini, Beatrice

“… Bounds to Kemeny's constant of perturbed matrices are given. Relying on these theoretical results, a divide-and-conquer algorithm for the efficient computation of Kemeny's constant of graphs is designed…”
Získať plný text

Likelihood Inference for Large Scale Stochastic Blockmodels with Covariates based on a Divide-and-Conquer Parallelizable Algorithm with Communication Autor Roy, Sandipan, Atchadé, Yves, Michailidis, George

“…We consider a stochastic blockmodel equipped with node covariate information, that is helpful in analyzing social network data…”
Získať plný text

Asymptotic distributions for Random Median Quicksort Autor Okasha, H.M., Rösler, U.

“…The first complete running time analysis of a stochastic divide and conquer algorithm was given for Quicksort, a sorting algorithm invented 1961 by Hoare…”
Získať plný text

Fixed points of the smoothing transform: two-sided solutions Autor Alsmeyer, Gerold, Meiners, Matthias

“… random variables independent of ( C , T ) and with distribution P . We study the fixed points of the smoothing transform, that is, the solutions to the stochastic fixed-point equation…”
Získať plný text

A hierarchical exact accelerated stochastic simulation algorithm Autor Orendorff, David, Mjolsness, Eric

“…A new algorithm, "HiER-leap" (hierarchical exact reaction-leaping), is derived which improves on the computational properties of the ER-leap algorithm for exact accelerated simulation of stochastic chemical kinetics…”
Zistit podrobnosti o prístupe

Divide-and-Conquer Information-Based Optimal Subdata Selection Algorithm Autor Wang, HaiYing

“… This paper develops a divide-and-conquer IBOSS approach to solving this problem, in which the full data set is divided into smaller partitions to be loaded into the memory and then subsets of data…”
Získať plný text

Risk-averse two-stage stochastic programming for assembly line reconfiguration with dynamic lot sizes Autor Li, Yuchen, Liu, Ming, Saldanha-da-Gama, Francisco, Yang, Zaoli

“… To model the problem, a stochastic program with two stages is utilized. A solution approach is devised using a divide-and-conquer algorithm, which incorporates a set of valid inequalities…”
Získať plný text

Two provably consistent divide-and-conquer clustering algorithms for large networks Autor Mukherjee, Soumendu Sundar, Sarkar, Purnamrita, Bickel, Peter J

“…In this article, we advance divide-and-conquer strategies for solving the community detection problem in networks…”
Zistit podrobnosti o prístupe

A posteriori initial imperfection identification in shell buckling problems Autor Stull, Christopher J., Earls, Christopher J., Aquino, Wilkins

“…The current research seeks to demonstrate that an inverse solution approach, leveraging nonlinear finite element analysis with a divide and conquer type stochastic search algorithm, can identify…”
Získať plný text

Divide and conquer algorithm for nondiffracting beams Autor Martínez-Herrera, Alberto F, Céspedes-Mota, Armando, Lopez-Aguayo, Servando

“… The procedure reported is based on a stochastic direct search and global optimization: the differential evolution method…”
Zistit podrobnosti o prístupe

Random sampling of contingency tables via probabilistic divide-and-conquer Autor DeSalvo, Stephen, Zhao, James

“…We present a new approach for random sampling of contingency tables of any size and constraints based on a recently introduced probabilistic divide-and-conquer (PDC) technique…”
Získať plný text

Low-rank updates and divide-and-conquer methods for quadratic matrix equations Autor Kressner, Daniel, Kürschner, Patrick, Massei, Stefano

“… Based on this procedure, we develop a divide-and-conquer method for quadratic matrix equations with coefficients that feature a specific type of hierarchical low-rank structure, which includes banded matrices…”
Získať plný text

A Decomposition-Based Hybrid Algorithm for Large-Scale Project Portfolio Selection and Scheduling With Reaction to Changing Environments Autor Liu, Jing, Sarker, Ruhul, Essam, Daryl, Elsayed, Saber

“… This article proposes a decomposition-based hybrid algorithm with evolutionary algorithm-based global search and exact solver-based local search to optimize large-scale PPSSP, and integrates…”
Získať plný text

Iterative stochastic subspace self-consistent field method Autor Loos, Pierre-François, Jean-Louis Rivail, Assfeld, Xavier

“…We propose a new self-consistent field (SCF) algorithm based on an iterative, partially stochastic \textit{``Divide \& Conquer''}-type approach…”
Získať plný text

Computational study of p53 regulation via the chemical master equation Autor Vo, Huy D, Sidje, Roger B

“…) by an adaptive Krylov-based finite state projection method that combines the stochastic simulation algorithm with other computational strategies, namely Krylov approximation techniques to the matrix…”
Zistit podrobnosti o prístupe

Spectral clustering for divide-and-conquer graph matching Autor Lyzinski, Vince, Sussman, Daniel L., Fishkind, Donniell E., Pao, Henry, Chen, Li, Vogelstein, Joshua T., Park, Youngser, Priebe, Carey E.

“…•We present a novel divide-and-conquer bijective graph matching algorithm.•The algorithm is fully parallelizable, and scales to match “big data” graphs…”
Získať plný text