Výsledky vyhledávání - parallel branch‐and‐prune algorithms

An autonomic parallel strategy for exhaustive search tree algorithms on shared or heterogeneous systems Autor Passos, Fernanda G. O., Rebello, Vinod E. F.

“…Summary Backtracking branch‐and‐prune (BP) algorithms and their variants are exhaustive search tree techniques widely employed to solve optimization problems in many scientific areas…”
Získat plný text

A branch and prune algorithm for the computation of generalized aspects of parallel robots Autor Caro, S., Chablat, D., Goldsztejn, A., Ishii, D., Jermann, C.

“…Parallel robots enjoy enhanced mechanical characteristics that have to be contrasted with a more complicated design…”
Získat plný text

A double-decomposition based parallel exact algorithm for the feedback length minimization problem Autor Shang, Zhen, Hao, Jin-Kao, Ma, Fei

“… This study develops a double-decomposition based parallel branch-and-prune algorithm, to determine the optimal activity sequence that minimizes the total feedback length (FLMP…”
Získat plný text

Scheduling interrelated activities in complex projects under high-order rework: A DSM-based approach Autor Wen, Muchen, Lin, Jun, Qian, Yanjun, Huang, Weihao

“…•A parallel branch-and-prune algorithm, which is able to obtain optimal solutions for medium instances…”
Získat plný text

A parallel version of the Branch & Prune algorithm for the Molecular Distance Geometry Problem Autor Mucherino, A, Lavor, C, Liberti, L, Talbi, E.-G

“… When particular assumptions are satisfied, the problem can be discretized, and solved by employing an ad-hoc algorithm called Branch & Prune (BP…”
Získat plný text

Exact algorithms for the feedback length minimisation problem Autor Shang, Zhen, Zhao, Songzheng, Qian, Yanjun, Lin, Jun

“… First, we present two new properties of the problem. Second, based on the properties, we develop an efficient Parallel Branch-and-Prune algorithm (PBP…”
Získat plný text

A double-decomposition based parallel exact algorithm for the feedback length minimization problem Autor Shang, Zhen, Jin-Kao, Hao, Ma, Fei

“… This study develops a double-decomposition based parallel branch-and-prune algorithm, to determine the optimal activity sequence that minimizes the total feedback length (FLMP…”
Získat plný text

A Parallel BP Algorithm for the Discretizable Distance Geometry Problem Autor Gramacho, W., Mucherino, A., Lavor, C., Maculan, N.

“…We propose a parallel version of the Branch & Prune (BP) algorithm for the Discretizable Distance Geometry Problem (DDGP…”
Získat plný text

Interval-Analysis-Based Determination of the Wrench-Feasible Workspace of Parallel Cable-Driven Robots Autor Gouttefarde, Marc, Daney, David, Merlet, Jean-Pierre

“…This paper deals with the wrench-feasible workspace (WFW) of n -degree-of-freedom parallel robots driven by n or more than n cables…”
Získat plný text

Avoiding the singularities of 3-RPR parallel mechanisms via dimensional synthesis and self-reconfigurability Autor Karimi, Amirhossein, Masouleh, Mehdi Tale, Cardou, Philippe

“… To prevent the relaxation from becoming too loose, a branch-and-prune algorithm is proposed, which converges to the globally…”
Získat plný text

Optimal motion planning for parallel robots via convex optimization and receding horizon Autor Novin, Roya Sabbagh, Karimi, Amirhossein, Yazdani, Mojtaba, Tale Masouleh, Mehdi

“…In this paper, the problem of motion planning for parallel robots in the presence of static and dynamic obstacles has been investigated…”
Získat plný text

Interval-analysis-based determination of the trajectory-reachable workspace of planar cable-suspended parallel robots Autor Jin, Xiang, Jiang, Xiaoling, Li, Qinchuan

“… On the basis of these two verifiable sufficient conditions, a TRW determination method using branch-and-prune algorithms is presented…”
Získat plný text

A branch-and-prune algorithm for solving systems of distance constraints Autor Porta, J.M., Thomas, F., Ros, L., Torras, C.

“…, that are unknown a priori, and whose derivation permits solving the problem rather trivially. Finding these distances relies on a branch-and-prune technique that iteratively…”
Získat plný text

Dynamic load balancing for parallel interval-Newton using message passing Autor Gau, Chao-Yang, Stadtherr, Mark A

“…Branch-and-prune and branch-and-bound techniques are commonly used for intelligent search in finding all solutions, or the optimal solution, within a space of interest…”
Získat plný text

Parallel interval-Newton using message passing: dynamic load balancing strategies Autor Gau, Chao-Yang, Stadtherr, Mark A.

“…Branch-and-prune and branch-and-bound techniques are commonly used for intelligent search in finding all solutions, or the optimal solution, within a space of interest…”
Získat plný text

Solving geometric constraints by iterative projections and backprojections Autor Thomas, F.

“… and proceeds recursively for both subproblems. This branch-and-prune strategy is shown to converge to all solutions…”
Získat plný text

Efficient Enumeration of Large Maximal k-Plexes Autor Cheng, Qihao, Yan, Da, Wu, Tianhao, Yuan, Lyuheng, Cheng, Ji, Huang, Zhongyi, Zhou, Yang

“… In this paper, we propose a fast branch-and-bound algorithm as well as its task-based parallel version to enumerate all maximal \(k…”
Získat plný text