Suchergebnisse - "branch‐and‐prune algorithm"

A branch-and-prune algorithm for discrete Nash equilibrium problems von Schwarze, Stefan, Stein, Oliver

“… We present a branch-and-prune procedure for discrete Nash equilibrium problems with a convex description of each player's strategy set. The derived pruning …”
Volltext

An Information-Theoretic Branch-and-Prune Algorithm for Discrete Phase Optimization of RIS in Massive MIMO von Ahmed, I. Zakir, Sadjadpour, Hamid R., Yousefi, Shahram

“… In this paper, we consider passive RIS-assisted multi-user communication between wireless nodes to improve the blocked line-of-sight (LOS) link performance …”
Volltext

The interval Branch-and-Prune algorithm for the discretizable molecular distance geometry problem with inexact distances von Lavor, Carlile, Liberti, Leo, Mucherino, Antonio

“… The Distance Geometry Problem in three dimensions consists in finding an embedding in of a given nonnegatively weighted simple undirected graph such that edge …”
Volltext

Improving the sampling process in the interval Branch-and-Prune algorithm for the discretizable molecular distance geometry problem von Lavor, Carlile, Souza, Michael, Carvalho, Luiz M., Gonçalves, Douglas S., Mucherino, Antonio

“… •The DMDGP is a problem related to 3D protein structure calculations using NMR data.•BP algorithm can be used to solve the problem, but the uncertainties in …”
Volltext

A numerical-and-computational study on the impact of using quaternions in the branch-and-prune algorithm for exact discretizable distance geometry problems von Fidalgo, Felipe, Castelani, Emerson, Philippi, Guilherme

“… Distance geometry is a branch of Mathematics which studies geometric relations having distances as primitive elements. Its fundamental problem, the distance …”
Volltext

A branch and prune algorithm for the computation of generalized aspects of parallel robots von 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. In particular, they often have parallel …”
Volltext

A Branch-and-Prune algorithm for the Molecular Distance Geometry Problem von Liberti, Leo, Lavor, Carlile, Maculan, Nelson

“… We propose a Branch‐and‐Prune algorithm for the solution of this problem and report on very promising computational results …”
Volltext

Constrained global optimization of multivariate polynomials using Bernstein branch and prune algorithm von Nataraj, P. S. V., Arounassalame, M.

“… The proposed Bernstein branch and prune algorithm is based on the Bernstein polynomial approach …”
Volltext

A note on "A branch-and-prune algorithm for the molecular distance geometry problem" von Lavor, Carlile, Liberti, Leo, Maculan, Nelson

Volltext

Clifford algebra and discretizable distance geometry von Alves, R., Lavor, C., Souza, C., Souza, M.

“… Protein structure calculations using nuclear magnetic resonance (NMR) experiments are one of the most important applications of distance geometry. The …”
Volltext

An adaptive branching scheme for the Branch & Prune algorithm applied to Distance Geometry von Goncalves, Douglas, Mucherino, Antonio, Lavor, Carlile

“… The Molecular Distance Geometry Problem (MDGP) is the one of finding molecular conformations that satisfy a set of distance constraints obtained through …”
Volltext

Robust Design Optimization of Permanent Magnet Linear Synchronous Motor Based on Quantified Constraint Satisfaction Problem von Dong, Fei, Zhao, Jiwen, Song, Juncai, Zhao, Jing, Yao, Zheng

“… within their error range by branch-and-prune algorithm. First, an analytical model of thrust ripple for PMLSM is established …”
Volltext

An algorithm to enumerate all possible protein conformations verifying a set of distance constraints von Cassioli, Andrea, Bardiaux, Benjamin, Bouvier, Guillaume, Mucherino, Antonio, Alves, Rafael, Liberti, Leo, Nilges, Michael, Lavor, Carlile, Malliavin, Thérèse E

“… Most of them, however, are designed to find one solution only. Results In order to explore exhaustively the feasible conformational space, we propose here an interval Branch-and-Prune algorithm ( i BP …”
Volltext

Exact algorithms for the feedback length minimisation problem von 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 …”
Volltext

Partial design space exploration strategies applied in preliminary design von Richard de Latour, Thomas, Chenouard, Raphaël, Granvilliers, Laurent

“… Another approach developed in this paper is to partially explore all the areas of the design space using an anytime interval branch-and-prune algorithm called IDFS such that the design criteria …”
Volltext

A double-decomposition based parallel exact algorithm for the feedback length minimization problem von 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 …”
Volltext

Oriented Conformal Geometric Algebra and the Molecular Distance Geometry Problem von Lavor, Carlile, Alves, Rafael

“… The problem of 3D protein structure determination using distance information from nuclear magnetic resonance (NMR) experiments is a classical problem in …”
Volltext

Geometric Algebra to Model Uncertainties in the Discretizable Molecular Distance Geometry Problem von Alves, Rafael, Lavor, Carlile

“… The discretizable molecular distance geometry problem (DMDGP) is related to the determination of 3D protein structure using distance information detected by …”
Volltext

An information-theoretic branch-and-prune algorithm for discrete phase optimization of RIS in massive MIMO von I Zakir Ahmed, Sadjadpour, Hamid R, Yousefi, Shahram

“… In this paper, we consider passive RIS-assisted multi-user communication between wireless nodes to improve the blocked line-of-sight (LOS) link performance …”
Volltext

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

“… We consider the Molecular Distance Geometry Problem (MDGP), which is the problem of finding the conformation of a molecule from some known distances between …”
Volltext