Výsledky vyhledávání - "combinatorial algorithms"

A new algorithm for generating integer partitions and its parallel implementations on CPU and FPGA

Autoři: Marek Nałęcz Gustaw Mazurek

Zdroj: International Journal of Electronics and Telecommunications, Vol vol. 71, Iss No 4, Pp 1-8 (2025)

Témata: parallel combinatorial algorithms, integer partitions, field-programmable gate arrays, bitwise operations, Electrical engineering. Electronics. Nuclear engineering, TK1-9971, Telecommunication, TK5101-6720

Popis souboru: electronic resource

Relation: https://journals.pan.pl/Content/136916/14_5229_Na%C5%82ecz_L_sk.pdf; https://doaj.org/toc/2081-8491; https://doaj.org/toc/2300-1933

Přístupová URL adresa: https://doaj.org/article/361483ba98e547e5ab1d0d90c8b23e2f

On the complexity of Client-Waiter and Waiter-Client games ; Complexité des jeux Client-Waiter et Waiter-Client

Autoři: Gledel, Valentin Oijid, Nacim Tavenas, Sébastien a další

Přispěvatelé: Gledel, Valentin Oijid, Nacim Tavenas, Sébastien a další

Zdroj: 52nd International Colloquium on Automata, Languages, and Programming (ICALP 2025)
International Colloquium on Automata, Languages, and Programming (ICALP)
https://hal.science/hal-04643212
International Colloquium on Automata, Languages, and Programming (ICALP), Jul 2025, Aarhus, Denmark. ⟨10.4230/LIPIcs.ICALP.2025.89⟩

Témata: Maker-Breaker, reductions and completeness, Theory of computation → Problems, Mathematics of computing → Hypergraphs, Mathematics of computing → Combinatorial algorithms, PSPACE-complete, Waiter-Client, Client-Waiter, positional games, FPT, Complexity, [INFO.INFO-CC]Computer Science [cs]/Computational Complexity [cs.CC], [MATH.MATH-CO]Mathematics [math]/Combinatorics [math.CO]

Geografické téma: Aarhus, Denmark

Relation: info:eu-repo/semantics/altIdentifier/arxiv/2407.06777; ARXIV: 2407.06777

Dostupnost: https://hal.science/hal-04643212
https://hal.science/hal-04643212v1/document
https://hal.science/hal-04643212v1/file/On%20the%20complexity%20of%20Waiter-Client%20and%20Client-Waiter%20games.pdf
https://doi.org/10.4230/LIPIcs.ICALP.2025.89

Two Approaches for the Cubic Facility Layout Problem

Autoři: Tran, An Baiou, Mourad Colares-Borges, Rafael a další

Přispěvatelé: Tran, An Baiou, Mourad Colares-Borges, Rafael a další

Zdroj: ROADEF 2025 ; https://cnrs.hal.science/hal-04981560 ; ROADEF 2025, Feb 2025, Paris, France

Témata: cubic facility layout problem, Linearization, quadratic assignment problem, volume algorithm, ACM: G.: Mathematics of Computing, ACM: G.: Mathematics of Computing/G.2: DISCRETE MATHEMATICS/G.2.1: Combinatorics/G.2.1.0: Combinatorial algorithms, [MATH.MATH-OC]Mathematics [math]/Optimization and Control [math.OC]

Geografické téma: Paris, France

Dostupnost: https://cnrs.hal.science/hal-04981560
https://cnrs.hal.science/hal-04981560v1/document
https://cnrs.hal.science/hal-04981560v1/file/Roadef2025.pdf

MetNetComp: Database for Minimal and Maximal Gene-Deletion Strategies for Growth-Coupled Production of Genome-Scale Metabolic Networks

Autoři: Takeyuki Tamura 田村, 武幸

Přispěvatelé: Takeyuki Tamura 田村, 武幸

Zdroj: IEEE/ACM Transactions on Computational Biology and Bioinformatics. 20:3748-3758

Témata: combinatorial algorithms, scientific databases, Genome, Databases, Factual, graphs and networks, Biology and genetics, linear programming, Computer Simulation, chemistry, Models, Biological, Gene Deletion, Metabolic Networks and Pathways

Přístupová URL adresa: https://pubmed.ncbi.nlm.nih.gov/37738189

A sharp lower bound on the independence number of k-regular connected hypergraphs with rank R: A sharp lower bound on the independence number of \(k\)-regular connected hypergraphs with rank \(R\)

Autoři: Tang, Zhongzheng Zou, Haoyang Diao, Zhuo

Zdroj: Acta Informatica. 62

Témata: Connectivity, combinatorial algorithms, Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.), Hypergraphs

Popis souboru: application/xml

Přístupová URL adresa: https://zbmath.org/7962823
https://doi.org/10.1007/s00236-024-00468-6

Trimming Gene Deletion Strategies for Growth-Coupled Production in Constraint-Based Metabolic Networks: TrimGdel

Autoři: Takeyuki Tamura 田村, 武幸

Přispěvatelé: Takeyuki Tamura 田村, 武幸

Zdroj: IEEE/ACM Transactions on Computational Biology and Bioinformatics. 20:1540-1549

Témata: 0301 basic medicine, combinatorial algorithms, Genome, 0206 medical engineering, linear programming, 02 engineering and technology, graphs and network, chemistry, 03 medical and health sciences, Biology and genetics, Genetic Engineering, Gene Deletion, Metabolic Networks and Pathways, Algorithms

Přístupová URL adresa: https://pubmed.ncbi.nlm.nih.gov/35731759

The inverse k-max combinatorial optimization problem

Autoři: Nhan Tran Hoai Ngoc Nguyen Kien Trung Hung Nguyen Thanh a další

Zdroj: Yugoslav Journal of Operations Research, Vol 33, Iss 2, Pp 309-322 (2023)

Témata: bottleneck, k-max, inverse optimization, T58.6-58.62, convex, 0211 other engineering and technologies, combinatorial algorithms, Management information systems, 02 engineering and technology

Přístupová URL adresa: https://doaj.org/article/cc1e7829795b454ab8200c855a3ece3c

Matrices of Optimal Tree-Depth and a Row-Invariant Parameterized Algorithm for Integer Programming

Autoři: Timothy F. Chan Jacob W. Cooper Martin Koutecký a další

Přispěvatelé: Timothy F. Chan Jacob W. Cooper Martin Koutecký a další

Zdroj: SIAM Journal on Computing. 51:664-700

Témata: FOS: Computer and information sciences, Discrete Mathematics (cs.DM), 0211 other engineering and technologies, Mathematics of computing → Combinatorial optimization, 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences, branch-width, width parameters, fixed parameter tractability, Optimization and Control (math.OC), Mathematics of computing → Matroids and greedoids, Computer Science - Data Structures and Algorithms, FOS: Mathematics, Data Structures and Algorithms (cs.DS), Mathematics of computing → Combinatorial algorithms, Matroid algorithms, ddc:004, integer programming, Mathematics - Optimization and Control, branch-depth, Computer Science - Discrete Mathematics

Popis souboru: application/pdf

Přístupová URL adresa: http://arxiv.org/abs/1907.06688
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2020.26

Practical Quantum Combinatorial String Matching

Autoři: Cantone D. Caudullo C. Faro S. a další

Zdroj: Lecture Notes in Networks and Systems ISBN: 9783031731242

Témata: String algorithms, Combinatorial algorithms, Quantum computing

Unveiling the connection between the Lyndon factorization and the Canonical Inverse Lyndon factorization via a border property

Autoři: Paola Bonizzoni Clelia De Felice Brian Riccardi a další

Přispěvatelé: Paola Bonizzoni Clelia De Felice Brian Riccardi a další

Témata: FOS: Computer and information sciences, Lyndon factorization, 13. Climate action, Formal Languages and Automata Theory (cs.FL), Combinatorial algorithms on words, Lyndon words, Computer Science - Formal Languages and Automata Theory, 14. Life underwater, ddc:004, 16. Peace & justice

Popis souboru: application/pdf

Přístupová URL adresa: http://arxiv.org/abs/2406.18473
https://hdl.handle.net/10281/514379
https://doi.org/10.4230/LIPIcs.MFCS.2024.31
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2024.31
https://hdl.handle.net/11386/4875691
https://doi.org/10.4230/LIPIcs.MFCS.2024.31

Exact and Approximation Algorithms for Optimal Equipment Selection in Deploying In-Building Distributed Antenna Systems

Autoři: Adjiashvili, David Bosio, Sandro Li, Yuan a další

Zdroj: IEEE Transactions on Mobile Computing. 14(4):702-713

Témata: Wireless communication, combinatorial algorithms, trees

Popis souboru: electronic

Přístupová URL adresa: https://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-117649
https://liu.diva-portal.org/smash/get/diva2:811557/FULLTEXT01.pdf

Unveiling the Connection Between the Lyndon Factorization and the Canonical Inverse Lyndon Factorization via a Border Property

Autoři: Bonizzoni, Paola De Felice, Clelia Riccardi, Brian a další

Přispěvatelé: Bonizzoni, Paola De Felice, Clelia Riccardi, Brian a další

Témata: Lyndon words, Lyndon factorization, Combinatorial algorithms on words

Popis souboru: application/pdf

Relation: Is Part Of LIPIcs, Volume 306, 49th International Symposium on Mathematical Foundations of Computer Science (MFCS 2024); https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2024.31

Dostupnost: https://doi.org/10.4230/LIPIcs.MFCS.2024.31
https://nbn-resolving.org/urn:nbn:de:0030-drops-205879
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2024.31

On the longest common prefix of suffixes in an inverse Lyndon factorization and other properties

Autoři: Bonizzoni, Paola De Felice, Clelia Zaccagnino, Rocco a další

Zdroj: Theoretical Computer Science. 862:24-41

Témata: Combinatorial algorithms on words, Lyndon factorization, Lyndon words, 0102 computer and information sciences, 0101 mathematics, combinatorial algorithms on words, 01 natural sciences

Přístupová URL adresa: http://arxiv.org/pdf/1911.01851
https://arxiv.org/pdf/1911.01851v1
https://www.sciencedirect.com/science/article/pii/S0304397520306253
https://ui.adsabs.harvard.edu/abs/2019arXiv191101851B/abstract
https://arxiv.org/abs/1911.01851
https://www.iris.unisa.it/handle/11386/4752905
https://boa.unimib.it/handle/10281/295802
https://hdl.handle.net/10281/295802
https://doi.org/10.1016/j.tcs.2020.10.034

Simultaneous Identification of Duplications and Lateral Gene Transfers

Autoři: Tofigh, Ali Hallett, Mikael Lagergren, Jens

Zdroj: IEEE/ACM Transactions on Computational Biology & Bioinformatics. 8(2):517-535

Témata: Trees, Biology and genetics, Combinatorial algorithms, Graph algorithms, TECHNOLOGY, Bioengineering, Bioinformatics, TEKNIKVETENSKAP, Bioteknik, Bioinformatik, Information technology, Computer science, Informationsteknik, Datavetenskap, Datalogi

Popis souboru: electronic

Přístupová URL adresa: https://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-10969

Generating m -Ary Gray Codes and Related Algorithms

Autoři: Stefka Bouyuklieva Iliya Bouyukliev Valentin Bakoev a další

Zdroj: Algorithms, Vol 17, Iss 7, p 311 (2024)

Témata: Gray code, m -ary Gray code, combinatorial algorithms, combinatorial generation, ranking, unranking, Industrial engineering. Management engineering, T55.4-60.8, Electronic computers. Computer science, QA75.5-76.95

Relation: https://www.mdpi.com/1999-4893/17/7/311; https://doaj.org/toc/1999-4893; https://doaj.org/article/171e9f0aee06433e92d4a0bcf85ed740

Dostupnost: https://doi.org/10.3390/a17070311
https://doaj.org/article/171e9f0aee06433e92d4a0bcf85ed740

Longest property-preserved common factor: A new string-processing framework

Autoři: Roberto Grossi Solon P. Pissis Giulia Bernardini a další

Přispěvatelé: Roberto Grossi Solon P. Pissis Giulia Bernardini a další

Zdroj: Theoretical Computer Science. 812:244-251

Témata: Palindromic factors, Periodic factors, Square-free factors, palindromic factors, combinatorial algorithms, combinatorial algorithm, Palindromic factors, combinatorial algorithms, Square-free factors, Periodic factors, square-free factors, 0102 computer and information sciences, 02 engineering and technology, [INFO] Computer Science [cs], 01 natural sciences, Palindromic factor, 0203 mechanical engineering, periodic factors, Square-free factor

Popis souboru: application/pdf

Přístupová URL adresa: https://ir.cwi.nl/pub/29482/29482.pdf
http://hdl.handle.net/11368/3019659
https://www.sciencedirect.com/science/article/pii/S0304397520300967
https://ir.cwi.nl/pub/29482
https://doi.org/10.1016/j.tcs.2020.02.012
https://arpi.unipi.it/handle/11568/1034802
https://dblp.uni-trier.de/db/journals/tcs/tcs812.html#AyadBGIPPR20
https://research.vu.nl/en/publications/longest-property-preserved-common-factor-a-new-string-processing-
https://www.narcis.nl/publication/RecordID/oai%3Acwi.nl%3A29482

The Operator Approach to Entropy Games

Autoři: Akian, Marianne Gaubert, Stéphane Grand-Clément, Julien a další

Přispěvatelé: Akian, Marianne Gaubert, Stéphane Grand-Clément, Julien a další

Zdroj: Theory of Computing Systems. 63:1089-1130

Témata: FOS: Computer and information sciences, Policy iteration, F.2.1 Numerical Algorithms and Problems, [MATH.MATH-OC] Mathematics [math]/Optimization and Control [math.OC], Shapley operators, policy iteration, 1991 Mathematics Subject Classification. G.2.1 Combinatorial algorithms, Perron eigenvalues, 91A15, 47H05, 93E20, Computer Science - Computer Science and Game Theory, Optimization and Control (math.OC), FOS: Mathematics, [MATH.MATH-OC]Mathematics [math]/Optimization and Control [math.OC], ddc:004, Stochastic games, Mathematics - Optimization and Control, Risk sensitive control, Computer Science and Game Theory (cs.GT)

Popis souboru: application/pdf

Přístupová URL adresa: https://drops.dagstuhl.de/opus/volltexte/2017/7026/pdf/LIPIcs-STACS-2017-6.pdf
http://arxiv.org/abs/1904.05151
https://inria.hal.science/hal-01676695v1
https://hal.science/hal-02143807v1
https://doi.org/10.1007/s00224-019-09925-z
https://link.springer.com/article/10.1007%2Fs00224-019-09925-z
https://hal.archives-ouvertes.fr/hal-02143807
https://dblp.uni-trier.de/db/journals/corr/corr1904.html#abs-1904-05151
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2017.6

Maximum Flow by Augmenting Paths in n2+o(1) Time

Autoři: Bernstein, Aaron Blikstad, Joakim Saranurak, Thatchaphol a další

Zdroj: Proceedings - 2024 IEEE 65th Annual Symposium on Foundations of Computer Science, FOCS 2024. :2056-2077

Témata: augmenting paths, combinatorial algorithms, directed expander hierarchy, maximum flow

Popis souboru: print

Přístupová URL adresa: https://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-358214

Elementary Combinatorial Algorithms

Autoři: Alzalg, Baha

Témata: Graph representations, Testing bipartiteness, Depth-first search algorithm, Breadth-first search algorithm, Elementary Combinatorial Algorithms, Computing shortest paths, Computing spanning trees, Finding connected components, Detecting cycles, Topological sorting

Pushing the Limits of Computational Combinatorial Constructions (Dagstuhl Seminar 23161)

Autoři: Moura, Lucia Nakic, Anamari Östergård, Patric a další

Přispěvatelé: Moura, Lucia Nakic, Anamari Östergård, Patric a další

Témata: combinatorial algorithms, subspace designs, automorphism groups, ddc:004, finite geometries

Popis souboru: application/pdf

Přístupová URL adresa: https://drops.dagstuhl.de/entities/document/10.4230/DagRep.13.4.40