Suchergebnisse - "divide and conquer algorithm"

A divide-and-conquer algorithm for quantum state preparation von Araujo, Israel F., Park, Daniel K., Petruccione, Francesco, da Silva, Adenilton J.

“… Advantages in several fields of research and industry are expected with the rise of quantum computers. However, the computational cost to load classical data …”
Volltext

A divide-and-conquer algorithm for distributed optimization on networks von Emirov, Nazar, Song, Guohui, Sun, Qiyu

“… )} with local objective functions fi depending only on neighboring variables of the vertex i∈V. We introduce a divide-and-conquer algorithm to solve the above optimization problem in a distributed and decentralized manner …”
Volltext

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

“… We put forward a robust technique to encode a plethora of arbitrary images as nondiffracting beams by optimizing their respective phase components. This …”
Weitere Angaben

A divide-and-conquer algorithm for curve fitting von Buchinger, Diego, Rosso, Roberto Silvio Ubertino

“… As guessing such a value is difficult, this paper presents a new method to choose it through a multi-curve fitting method, based on linear least square optimizations, using a divide-and-conquer …”
Volltext

Kart: a divide-and-conquer algorithm for NGS read alignment von Lin, Hsin-Nan, Hsu, Wen-Lian

“… We develop a divide-and-conquer algorithm, called Kart, which can process long reads as fast as short reads by dividing a read into small fragments that can be aligned independently …”
Volltext

Research on regulation strategy of integrated energy system based on game theory and divide-and-conquer algorithm von Wu, Yanjuan, Jin, Pengfei, Li, Qing

“… To address the above issues, an integrated energy system hybrid game model with the participation of the regulatory agency is constructed, and a divide-and-conquer algorithm is proposed to solve …”
Volltext

Parallel structural learning of Bayesian networks: Iterative divide and conquer algorithm based on structural fusion von Laborda, Jorge D., Torrijos, Pablo, Puerta, José M., Gámez, José A.

“… Learning Bayesian Networks (BNs) from high-dimensional data is a complex and time-consuming task. Although the literature includes approaches based on …”
Volltext

A Divide and Conquer Algorithm of Bayesian Density Estimation von Su, Ya

“… ABSTRACT Datasets for statistical analysis become extremely large even when stored on one single machine with some difficulty. Even when the data can be stored …”
Volltext

Evolutionary Divide-and-Conquer Algorithm for Virus Spreading Control Over Networks von Zhao, Tian-Fang, Chen, Wei-Neng, Kwong, Sam, Gu, Tian-Long, Yuan, Hua-Qiang, Zhang, Jie, Zhang, Jun

“… To meet the challenges of increasing network scales and improve the solving efficiency, an evolutionary divide-and-conquer algorithm is proposed, namely, a coevolutionary algorithm with network …”
Volltext

An effective and efficient divide-and-conquer algorithm for energy consumption optimisation problem in long Bernoulli serial lines von Yan, Chao-Bo, Zheng, Ziqian

“… Reducing energy consumption in the energy-intensive production systems is of great significance and attracts more and more attention. Although a lot of efforts …”
Volltext

A parallel structured divide-and-conquer algorithm for symmetric tridiagonal eigenvalue problems von Liao, Xia, Li, Shengguo, Lu, Yutong, Roman, Jose E. E.

“… Computing the eigenvectors via matrix-matrix multiplications is the most computationally expensive part of the divide-and-conquer algorithm, and one of the matrices involved in such multiplications …”
Volltext

EDQWS: an enhanced divide and conquer algorithm for workflow scheduling in cloud von Khojasteh Toussi, Ghazaleh, Naghibzadeh, Mahmoud, Abrishami, Saeid, Taheri, Hoda, Abrishami, Hamid

“… A workflow is an effective way for modeling complex applications and serves as a means for scientists and researchers to better understand the details of …”
Volltext

Exponential convergence of a distributed divide-and-conquer algorithm for constrained convex optimization on networks von Emirov, Nazar, Song, Guohui, Sun, Qiyu

“… We propose a divide-and-conquer (DAC) algorithm for constrained convex optimization over networks, where the global objective is the sum of local objectives …”
Volltext

Improved divide-and-conquer algorithm with ternary ratio for stable MPPT in PV systems under dynamic irradiance conditions von Rouabah, Dhia Elhak, Azri, Maaspaliza, Ramli, Mohd Zulkifli, Lekbir, Abdelhak

“… This study proposes an Improved Divide-and-Conquer Algorithm with Ternary Ratio (IDCA-TR) as a Maximum Power Point Tracking …”
Volltext

Index-3 divide-and-conquer algorithm for efficient multibody system dynamics simulations: theory and parallel implementation von Malczyk, Paweł, Frączek, Janusz, González, Francisco, Cuadrado, Javier

“… Parallel computing is one of the approaches to achieve this objective. This paper presents a novel index-3 divide-and-conquer algorithm for efficient multibody dynamics …”
Volltext

A divide‐and‐conquer algorithm for core‐periphery identification in large networks von Yanchenko, Eric

“… ‐and‐conquer algorithm to identify the core‐periphery structure in large networks. By finding this structure on much smaller sub …”
Volltext

Dynamics and optimal control of multibody systems using fractional generalized divide-and-conquer algorithm von Dabiri, Arman, Poursina, Mohammad, Machado, J. A. Tenreiro

“… The fractional Brunovsky canonical form of the tracking error is proposed for a generalized divide-and-conquer algorithm (GDCA …”
Volltext

A fast divide-and-conquer algorithm for computing the spectra of real symmetric tridiagonal matrices von Coakley, Ed S., Rokhlin, Vladimir

“… We propose a new fast algorithm for computing the spectrum of an N×N symmetric tridiagonal matrix in O(NlnN) operations. Such an algorithm may be combined with …”
Volltext

Computing Puiseux series: a fast divide and conquer algorithm von Poteaux, Adrien, Weimann, Martin

“… Let F ∈ [ X , Y ] be a polynomial of total degree D defined over a perfect field of characteristic zero or greater than D . Assuming F separable with respect …”
Volltext

A divide-and-conquer algorithm for seismic data approximation by the Laguerre series von Terekhov, Andrew V

“… A divide-and-conquer algorithm based on shift operations made it possible to significantly reduce the computational cost of the proposed method …”
Volltext