Výsledky vyhľadávania - "Divide and conquer algorithm"

Optimization problem and efficient partitioning algorithm for transitions to finer-scale models in adaptive resolution simulation of articulated biopolymers Autor Poursina, Mohammad, Anderson, Kurt S.

“… Herein, an optimization-based approach subject to the satisfaction of impulse–momentum balance and desired kinetic…”
Získať plný text

Inverses of Block Tridiagonal Matrices and Rounding Errors Autor Wu, ChiYe, Huang, TingZhu, Li, Liang, Lv, XiaoGuang

“…Based on URV-decomposition in Stewart [An updating algorithm for subspace tracking, IEEE Trans. Signal Processing, 40 (1992): 1535--1541] and the result of…”
Získať plný text

Optimization of differentiated fares and subsidies for different urban rail transit users Autor Wang, Qing, Schonfeld, Paul M., Deng, Lianbo, Xu, Guangming, Ling, Shuai

“…•A social welfare model comprehensively considers multi-stakeholder.•A divide-and-conquer algorithm is designed to solve the proposed model…”
Získať plný text

Near-optimal continuous patrolling with teams of mobile information gathering agents Autor Stranders, R., Munoz de Cote, E., Rogers, A., Jennings, N.R.

“… — the ability to make sense of, and predict what is happening in an environment. Particularly in environments that are subject to continuous change, the use of such teams…”
Získať plný text

A faster algorithm for the resource allocation problem with convex cost functions Autor Shi, Cong, Zhang, Huanan, Qin, Chao

“… In this paper, we propose a novel polynomial-time divide-and-conquer algorithm (called the multi-phase algorithm…”
Získať plný text

Optimal Algorithms for Bounded Weighted Edit Distance Autor Cassis, Alejandro, Kociumaka, Tomasz, Wellnitz, Philip

“…The edit distance (also known as Levenshtein distance) of two strings is the minimum number of insertions, deletions, and substitutions of characters needed to…”
Získať plný text

FGWAS: Functional genome wide association analysis Autor Huang, Chao, Thompson, Paul, Wang, Yalin, Yu, Yang, Zhang, Jingwen, Kong, Dehan, Colen, Rivka R., Knickmeyer, Rebecca C., Zhu, Hongtu

“…Functional phenotypes (e.g., subcortical surface representation), which commonly arise in imaging genetic studies, have been used to detect putative genes for…”
Získať plný text

Scalable Model Counting for Program Analysis Autor Kim, Seonmo

“… These hashing-based algorithms repeatedly check the satisfiability of a formula subject to random parity constraints (XOR streamlining…”
Získať plný text

Algorithms for Discrete Barycenters Autor Patterson, Stephan

“…The subject of this thesis is the computation of exact discrete barycenters. Discrete barycenters are solutions to weighted transport problems in which the input are probability measures with finite support…”
Získať plný text

Fast Exact Algorithms for Optimization Problems in Resource Allocation and Switched Linear Systems Autor Wu, Zeyang

“…Discrete optimization is a branch of mathematical optimization where some of the decision variables are restricted to real values in a discrete set. The use of…”
Získať plný text

Analysis of a Block Arithmetic Coding: Discrete divide and conquer recurrences Autor Drmota, M., Szpankowski, W.

“… The parsing is accomplished through a complete parsing tree whose leaves represent phrases. This tree, in its suboptimal heuristic version, is constructed by a simple divide and conquer algorithm, whose analysis is the subject of this paper…”
Získať plný text

The Divide-And-Conquer Method for the Solution of the Symmetric Tridiagonal Eigenproblem and Transputer Implementations Autor Fachin, Maria Paula Gonҫalves

“…This thesis describes a divide-and-conquer method for solving the symmetric tridiagonal eigenproblem and its parallel implementation on a transputer…”
Získať plný text

Algorithms for central-median paths with bounded length on trees Autor Becker, Ronald I., Lari, Isabella, Scozzari, Andrea

“…The location of path-shaped facilities on trees has been receiving a growing attention in the specialized literature in the recent years. Examples of such…”
Získať plný text

Optimality of HLF for scheduling divide-and-conquer UET task graphs on identical parallel processors Autor Kubiak, Wieslaw, Rebaine, Djamal, Potts, Chris

“… the execution of the recursive control abstraction of divide-and-conquer algorithms. We prove that the Highest Level First (HLF…”
Získať plný text

Solving the Minimum Convex Partition of Point Sets with Integer Programming Autor Sapucaia, Allan, de Rezende, Pedro J, de Souza, Cid C

“…The partition of a problem into smaller sub-problems satisfying certain properties is often a key ingredient in the design of divide-and-conquer algorithms…”
Získať plný text

Computational fractal geometry: New methods for image description, generation and compression Autor Dube, Simant

“…The subject of this dissertation is Computational Fractal Geometry. It is an investigation of a number of methods to describe, generate and encode a wide…”
Získať plný text