Suchergebnisse - "branch‐and‐prune algorithm"

A numerical-and-computational study on the impact of using quaternions in the branch-and-prune algorithm for exact discretizable distance geometry problems

Autoren: Felipe Fidalgo Emerson Castelani Guilherme Philippi

Quelle: Computational Optimization and Applications. 87:501-530

A branch-and-prune algorithm for discrete Nash equilibrium problems

Autoren: Stefan Schwarze Oliver Stein

Quelle: Computational Optimization and Applications, 86, 491–519

Schlagwörter: ddc:510, 0301 basic medicine, ddc:330, Economics, 0211 other engineering and technologies, Nash equilibrium problem, 02 engineering and technology, Discrete game, Branch and prune, 03 medical and health sciences, Branch and bound

Dateibeschreibung: application/pdf

Zugangs-URL: https://hdl.handle.net/10419/308629
https://publikationen.bibliothek.kit.edu/1000160601
https://doi.org/10.5445/IR/1000160601
https://publikationen.bibliothek.kit.edu/1000160601/151015240

An Information-Theoretic Branch-and-Prune Algorithm for Discrete Phase Optimization of RIS in Massive MIMO

Autoren: I. Zakir Ahmed Hamid R. Sadjadpour Shahram Yousefi

Quelle: IEEE Transactions on Vehicular Technology. 72:7395-7410

Schlagwörter: Signal Processing (eess.SP), FOS: Computer and information sciences, Computer Science - Information Theory, Information Theory (cs.IT), FOS: Electrical engineering, electronic engineering, information engineering, 0202 electrical engineering, electronic engineering, information engineering, 02 engineering and technology, Electrical Engineering and Systems Science - Signal Processing

Zugangs-URL: http://arxiv.org/abs/2301.06228

An information-theoretic branch-and-prune algorithm for discrete phase optimization of RIS in massive MIMO

Autoren: Ahmed, I. Zakir Sadjadpour, Hamid R. Yousefi, Shahram

Index Begriffe: Electrical Engineering and Systems Science - Signal Processing, Computer Science - Information Theory, text

URL: http://arxiv.org/abs/2301.06228

A Fast Branch-and-Prune Algorithm for the Position Analysis of Spherical Mechanisms

Autoren: Shabani, Arya Sarabandi, Soheil Porta Pleite, Josep Maria et al.

Weitere Verfasser: Shabani, Arya Sarabandi, Soheil Porta Pleite, Josep Maria et al.

Quelle: Mechanisms and Machine Science ISBN: 9783030201302
Digital.CSIC. Repositorio Institucional del CSIC
Consejo Superior de Investigaciones Científicas (CSIC)
instname
UPCommons. Portal del coneixement obert de la UPC
Universitat Politècnica de Catalunya (UPC)

Schlagwörter: 0209 industrial biotechnology, Automation::Robots::Robot kinematics [Classificació INSPEC], Informàtica::Automàtica i control [Àrees temàtiques de la UPC], Classificació INSPEC::Automation::Robots::Robot kinematics, 0203 mechanical engineering, Parallel spherical robots, Position analysis, Àrees temàtiques de la UPC::Informàtica::Automàtica i control, 02 engineering and technology, Forward kinematics, Branch-and-prune algorithms, Multi-affine polynomials

Dateibeschreibung: application/pdf

Zugangs-URL: https://upcommons.upc.edu/bitstream/2117/180995/1/2192-A-fast-branch-and-prune-algorithm-for-the-position-analysis-of-spherical-mechanisms.pdf
http://hdl.handle.net/10261/206478
https://upcommons.upc.edu/handle/2117/180995
https://upcommons.upc.edu/bitstream/2117/180995/1/2192-A-fast-branch-and-prune-algorithm-for-the-position-analysis-of-spherical-mechanisms.pdf
https://rd.springer.com/chapter/10.1007/978-3-030-20131-9_55
https://link.springer.com/chapter/10.1007/978-3-030-20131-9_55
https://digital.csic.es/handle/10261/206478

A Branch and Prune Algorithm for the Computation of Generalized Aspects of Parallel Robots

Autoren: Caro, Stéphane Chablat, Damien Goldsztejn, Alexandre et al.

Weitere Verfasser: Caro, Stéphane Chablat, Damien Goldsztejn, Alexandre et al.

Quelle: Lecture Notes in Computer Science ISBN: 9783642335570

Schlagwörter: Numerical constraints, 0209 industrial biotechnology, Parallel robots, 02 engineering and technology, 0101 mathematics, Singularities, Generalized aspects, 01 natural sciences, [SPI.TRON] Engineering Sciences [physics]/Electronics, [SPI.TRON]Engineering Sciences [physics]/Electronics

Dateibeschreibung: application/pdf

Zugangs-URL: https://link.springer.com/chapter/10.1007/978-3-642-33558-7_62
http://www.ueda.info.waseda.ac.jp/~ishii/pub/papers/ccgij-cp2012.pdf
https://hal.archives-ouvertes.fr/hal-02005023
https://waseda.pure.elsevier.com/en/publications/a-branch-and-prune-algorithm-for-the-computation-of-generalized-a
https://link.springer.com/content/pdf/10.1007%2F978-3-642-33558-7_62.pdf
https://rd.springer.com/chapter/10.1007/978-3-642-33558-7_62

A branch and prune algorithm for the approximation of non-linear AE-solution sets

Autoren: Goldsztejn, Alexandre

Weitere Verfasser: Goldsztejn, Alexandre

Quelle: Proceedings of the 2006 ACM symposium on Applied computing. :1650-1654

Schlagwörter: [INFO.INFO-NA] Computer Science [cs]/Numerical Analysis [cs.NA], 0211 other engineering and technologies, 02 engineering and technology, 0101 mathematics, 01 natural sciences

Zugangs-URL: http://www.goldsztejn.com/publications/SAC2006.Goldsztejn.pdf
https://hal.science/hal-00481391v1
https://doi.org/10.1145/1141277.1141665
http://dblp.uni-trier.de/db/conf/sac/sac2006.html#Goldsztejn06
https://dblp.uni-trier.de/db/conf/sac/sac2006.html#Goldsztejn06
http://portal.acm.org/citation.cfm?doid=1141277.1141665
https://doi.acm.org/10.1145/1141277.1141665
http://goldsztejn.com/publications/SAC2006.Goldsztejn.pdf
https://hal.archives-ouvertes.fr/hal-00481391

A branch-and-prune algorithm for solving systems of distance constraints

Autoren: Porta Pleite, J.M. Thomas, F. Ros, L. et al.

Quelle: Digital.CSIC. Repositorio Institucional del CSIC
instname
Consejo Superior de Investigaciones Científicas (CSIC)

Schlagwörter: Automation: Robots, Robotics, Robots, Robots [Automation]

Zugangs-URL: http://digital.csic.es/bitstream/10261/30240/1/doc1.pdf
http://hdl.handle.net/10261/30240
https://hdl.handle.net/11245/1.213388
https://dare.uva.nl/personal/pure/en/publications/a-branchandprune-algorithm-for-solving-systems-of-distance-constraints(3f22df7c-fde7-4220-945b-626b4c022f70).html
https://www.iri.upc.edu/people/porta/Docs/icra03b.pdf
http://www-iri.upc.es/people/ros/Separates/icra7-2003-cuik.pdf
https://dblp.uni-trier.de/db/conf/icra/icra2003.html#PortaTRT03
https://digital.csic.es/handle/10261/30240
http://digital.csic.es/bitstream/10261/30240/1/doc1.pdf

NoC contention analysis using a branch-and-prune algorithm

Autoren: Dasari, Dakshina Nikolic, Borislav Nelis, Vincent et al.

Weitere Verfasser: Dasari, Dakshina Nikolic, Borislav Nelis, Vincent et al.

Quelle: ACM Transactions on Embedded Computing Systems. 13:1-26

Schlagwörter: Many-core systems, wormhole routing, Design, Performance, 0202 electrical engineering, electronic engineering, information engineering, 02 engineering and technology, Real-time systems, Algorithms, Network-on-chip

Dateibeschreibung: application/pdf

Zugangs-URL: http://dblp.uni-trier.de/db/journals/tecs/tecs13.html#DasariNNP14
http://www.cister.isep.ipp.pt/docs/noc_contention_analysis_using_a_branch_and_prune_algorithm/799/view.pdf
https://dblp.uni-trier.de/db/journals/tecs/tecs13.html#DasariNNP14
http://193.136.60.49/docs/noc_contention_analysis_using_a_branch_and_prune_algorithm/799/
https://core.ac.uk/display/47140161
https://dl.acm.org/doi/abs/10.1145/2567937
https://hdl.handle.net/10400.22/5422

Constrained global optimization of multivariate polynomials using Bernstein branch and prune algorithm

Autoren: NATARAJ, PSV AROUNASSALAME, M

Quelle: Journal of Global Optimization. 49:185-212

Schlagwörter: 0209 industrial biotechnology, Bernstein Polynomials, 0211 other engineering and technologies, Subdivision, 02 engineering and technology, Constrained Global Optimization, Pruning

Zugangs-URL: https://EconPapers.repec.org/RePEc:spr:jglopt:v:49:y:2011:i:2:p:185-212
https://link.springer.com/article/10.1007/s10898-009-9485-0
https://ideas.repec.org/a/spr/jglopt/v49y2011i2p185-212.html
https://link.springer.com/content/pdf/10.1007%2Fs10898-009-9485-0.pdf

A Branch‐and‐Prune algorithm for the Molecular Distance Geometry Problem

Autoren: Leo Liberti Carlile Lavor Nelson Maculan

Quelle: International Transactions in Operational Research. 15:1-17

Schlagwörter: 0211 other engineering and technologies, 0202 electrical engineering, electronic engineering, information engineering, 02 engineering and technology

Zugangs-URL: https://onlinelibrary.wiley.com/doi/pdfdirect/10.1111/j.1475-3995.2007.00622.x

A fast branch-and-prune algorithm for the position analysis of spherical mechanisms

Autoren: Universitat Politècnica de Catalunya. Doctorat en Automàtica, Robòtica i Visió Universitat Politècnica de Catalunya. Doctorat en Enginyeria Mecànica, Fluids i Aeronàutica Institut de Robòtica i Informàtica Industrial et al.

Index Begriffe: Àrees temàtiques de la UPC::Informàtica::Automàtica i control, Multi-affine polynomials, Parallel spherical robots, Forward kinematics, Position analysis, Branch-and-prune algorithms, Classificació INSPEC::Automation::Robots::Robot kinematics, Conference report

URL: http://hdl.handle.net/2117/180995
https://link.springer.com/chapter/10.1007%2F978-3-030-20131-9_55
https://link.springer.com/chapter/10.1007%2F978-3-030-20131-9_55

A fast branch-and-prune algorithm for the position analysis of spherical mechanisms

Autoren: Ministerio de Ciencia, Innovación y Universidades (España) Agencia Estatal de Investigación (España) European Commission et al.

Index Begriffe: Multi-affine polynomials, Parallel spherical robots, Forward kinematics, Position analysis, Branch-and-prune algorithms, comunicación de congreso

URL: http://hdl.handle.net/10261/206478
Postprint
http://dx.doi.org/10.1007/978-3-030-20131-9_55
Sí
info:eu-repo/grantAgreement/AEI/Plan Estatal de Investigación Científica y Técnica y de Innovación 2017-2020/DPI2017-88282-P
DPI2017-88282-P/AEI/10.13039/501100011033

The interval Branch-and-Prune algorithm for the discretizable molecular distance geometry problem with inexact distances

Autoren: Lavor, Carlile Liberti, Leo Mucherino, Antonio et al.

Weitere Verfasser: Lavor, Carlile Liberti, Leo Mucherino, Antonio et al.

Quelle: Journal of Global Optimization. 56:855-871

Schlagwörter: 0211 other engineering and technologies, 02 engineering and technology, 0101 mathematics, 01 natural sciences, 7. Clean energy

Zugangs-URL: http://www.lix.polytechnique.fr/~liberti/bp-interval.pdf
https://inria.hal.science/hal-00912660v1
https://EconPapers.repec.org/RePEc:spr:jglopt:v:56:y:2013:i:3:p:855-871
https://hal.inria.fr/hal-00912660
https://link.springer.com/article/10.1007%2Fs10898-011-9799-6
http://www.lix.polytechnique.fr/~liberti/bp-interval.pdf
https://ideas.repec.org/a/spr/jglopt/v56y2013i3p855-871.html
https://link.springer.com/content/pdf/10.1007%2Fs10898-011-9799-6.pdf

A Symbolic-Numerical Branch and Prune Algorithm for Solving Non-linear Polynomial Systems: A symbolic-numerical branch and prune algorithm for solving nonlinear polynomial systems

Autoren: Granvilliers,Laurent

Quelle: JUCS-Journal of Universal Computer Science 4(2): 125-146

Schlagwörter: branch and prune algorithm, Other programming paradigms (object-oriented, sequential, concurrent, automatic, etc.), constraint programming, cooperative constraint solvers, 02 engineering and technology, Branch and prune algorithm, non-linear constraint solving, 01 natural sciences, symbolic simplification, interval Newton methods, polynomial system, 0202 electrical engineering, electronic engineering, information engineering, 0101 mathematics, Groebner basis

Dateibeschreibung: application/xml; text/html

Zugangs-URL: https://zbmath.org/1543278

The Bernstein Branch-and-Prune Algorithm for Constrained Global Optimization of Multivariate Polynomial MINLPs

Autoren: Bhagyesh V. Patil

Quelle: Lecture Notes in Computer Science ISBN: 9783319328584

Zugangs-URL: https://link.springer.com/10.1007/978-3-319-32859-1_48
https://rd.springer.com/chapter/10.1007/978-3-319-32859-1_48
https://link.springer.com/chapter/10.1007%2F978-3-319-32859-1_48

A branch-and-prune algorithm for discrete Nash equilibrium problems

Autoren: Schwarze, Stefan Stein, Oliver

Quelle: Computational Optimization and Applications, 86, 491–519 ; ISSN: 0926-6003, 1573-2894

Schlagwörter: ddc:330, Economics, info:eu-repo/classification/ddc/330

Dateibeschreibung: application/pdf

Relation: info:eu-repo/semantics/altIdentifier/wos/001020712600001; info:eu-repo/semantics/altIdentifier/issn/0926-6003; info:eu-repo/semantics/altIdentifier/issn/1573-2894; https://publikationen.bibliothek.kit.edu/1000160601; https://publikationen.bibliothek.kit.edu/1000160601/151015240; https://doi.org/10.5445/IR/1000160601

Verfügbarkeit: https://publikationen.bibliothek.kit.edu/1000160601
https://publikationen.bibliothek.kit.edu/1000160601/151015240
https://doi.org/10.5445/IR/1000160601

Improving the sampling process in the interval Branch-and-Prune algorithm for the discretizable molecular distance geometry problem

Autoren: Antonio Mucherino Michael Souza Carlile Lavor et al.

Quelle: Applied Mathematics and Computation. 389:125586

Schlagwörter: 0211 other engineering and technologies, 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences

Zugangs-URL: https://www.sciencedirect.com/science/article/pii/S0096300320305312
https://dblp.uni-trier.de/db/journals/amc/amc389.html#LavorSCGM21
https://doi.org/10.1016/j.amc.2020.125586

Adiabatic Quantum Computing for the Subset Sum Problem: Preliminary Studies

Autoren: Freitas Bernardes, Cesar Castellucci, Pedro Gonçalves, Douglas et al.

Weitere Verfasser: Freitas Bernardes, Cesar Castellucci, Pedro Gonçalves, Douglas et al.

Schlagwörter: Branch-and-prune algorithm, [INFO.INFO-ET] Computer Science [cs]/Emerging Technologies [cs.ET], [INFO.INFO-CC] Computer Science [cs]/Computational Complexity [cs.CC], D-Wave quantum annelear, Subset sum problem, [PHYS.QPHY] Physics [physics]/Quantum Physics [quant-ph], Data representations

Dateibeschreibung: application/pdf

Zugangs-URL: https://hal.science/hal-05164717v1

Search Strategies for an Anytime Usage of the Branch and Prune Algorithm

Autoren: Chenouard, Raphaël Goldsztejn, Alexandre Jermann, Christophe

Weitere Verfasser: Chenouard, Raphaël Goldsztejn, Alexandre Jermann, Christophe

Schlagwörter: [INFO.INFO-AI] Computer Science [cs]/Artificial Intelligence [cs.AI], anytime, Numerical CSP, branch and prune

Dateibeschreibung: application/pdf

Zugangs-URL: https://hal.science/hal-00421506v1