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

On the analysis of stochastic divide and conquer algorithms: Average-Case Analysis of 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

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

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

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

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 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

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

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

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

“… Unlike ER-leap, HiER-leap utilizes a hierarchical or divide-and-conquer organization of reaction channels into tightly coupled "blocks" and is thereby able to speed up systems with many reaction channels…”
Zistit podrobnosti o prístupe

An Efficient Nondominated Sorting Algorithm for Large Number of Fronts Autor Roy, Proteek Chandan, Deb, Kalyanmoy, Islam, Md. Monirul

“… For stochastic algorithms like MOEAs, it is important to devise an algorithm which has better average case performance…”
Získať plný text

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

“… exponential, divide and conquer, and aggregation. We report numerical results that demonstrate the extend of tackling the CME with this combination of tools…”
Zistit podrobnosti o prístupe

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

Reinforcement Learning and Relational Learning with Applicationsin Mobile-health and Knowledge Graph Autor Zhang, Sheng

“…Reinforcement learning is a general technique that allows an agent to learn the policy to interact with an environment. The goodness of a policy is measured by…”
Získať plný text

A Recursively Partitioned Approach to Architecture-Aware ZX Polynomial Synthesis and Optimization Autor Winderl, David, Huang, Qunsheng, Mendl, Christian B.

“…] by replacing the stochastic approach of PauliOpt with a heuristic based search and utilizes a divide and conquer method to synthesize an optimized circuit from a ZX polynomial…”
Získať plný text

A recursively partitioned approach to architecture-aware ZX Polynomial synthesis and optimization Autor Winderl, David, Huang, Qunsheng, Mendl, Christian B

“… a divide and conquer method to synthesize an optimized circuit from a ZX polynomial. We provide a comparison of our algorithm with PauliOpt and other state-of-the-art optimization libraries…”
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

Cost-Efficient and Preference-Aware Mobile Edge Caching in Public Vehicular Networks Autor Chen, Xiaopei, Lin, Zhijian, Wu, Wenhao, Chen, Feng, Chen, Pingping

Získať plný text

Contributions to Bayesian Dimension Reduction Autor Mehrotra, Suchit

“…Often, the variability present in a dataset can be captured by a smaller dataset of lower dimension. In a regression context, a primary dimension reduction…”
Získať plný text