Výsledky vyhľadávania - "[INFO.INFO-CC]Computer Science [cs]/Computational Complexity [cs.CC]"

Inapproximability of Optimal Multi-Agent Pathfinding Problems

Autori: Tan, Xing Grastien, Alban CEA, Contributeur MAP

Prispievatelia: Tan, Xing Grastien, Alban CEA, Contributeur MAP

Zdroj: Proceedings of the AAAI Conference on Artificial Intelligence. 39:26707-26715

Predmety: [INFO.INFO-AI] Computer Science [cs]/Artificial Intelligence [cs.AI], [INFO.INFO-CC] Computer Science [cs]/Computational Complexity [cs.CC]

Popis súboru: application/pdf

Prístupová URL adresa: https://cea.hal.science/cea-05151662v1

LinA: a faster approach to piecewise linear approximations using corridors and its application to mixed-integer optimization

Autori: Codsi, Julien Ngueveu, Sandra Ulrich Gendron, Bernard a ďalší

Prispievatelia: Codsi, Julien Ngueveu, Sandra Ulrich Gendron, Bernard a ďalší

Zdroj: Mathematical Programming Computation. 17:265-306

Predmety: [INFO.INFO-CC]Computer Science [cs]/Computational Complexity [cs.CC], MINLP, overestimation, [INFO.INFO-GT]Computer Science [cs]/Computer Science and Game Theory [cs.GT], underestimation, piecewise linear regression with bounded error, piecewise linear functions, [MATH.MATH-OC] Mathematics [math]/Optimization and Control [math.OC], [INFO.INFO-RO] Computer Science [cs]/Operations Research [math.OC], MSC 41A15 - 90C59 - 90C30 - 90C11 - 65D07, Julia package, [INFO.INFO-RO]Computer Science [cs]/Operations Research [math.OC], [INFO.INFO-GT] Computer Science [cs]/Computer Science and Game Theory [cs.GT], [INFO.INFO-CC] Computer Science [cs]/Computational Complexity [cs.CC], [MATH.MATH-OC]Mathematics [math]/Optimization and Control [math.OC], guaranteed tolerance, approximation, MILP

Popis súboru: application/pdf

Prístupová URL adresa: https://hal.science/hal-03336003v2/document
https://hal.science/hal-03336003v2
https://doi.org/10.1007/s12532-024-00274-8

Polynomial delay hybrid algorithms to enumerate candidate keys for a relation

Autori: Ennaoui, Karima Nourine, Lhouari

Prispievatelia: Ennaoui, Karima Nourine, Lhouari

Zdroj: Discrete Applied Mathematics. 360:443-450

Predmety: 0202 electrical engineering, electronic engineering, information engineering, [INFO.INFO-DB] Computer Science [cs]/Databases [cs.DB], [INFO.INFO-CC] Computer Science [cs]/Computational Complexity [cs.CC], 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences

Popis súboru: application/pdf

Parameterized Restless Temporal Path

Autori: Cauvi, Justine Viennot, Laurent

Prispievatelia: Cauvi, Justine Viennot, Laurent

Zdroj: Lecture Notes in Computer Science ISBN: 9783032046994

Predmety: FOS: Computer and information sciences, Parameterized algorithms, Temporal graphs, Computational Complexity, Data Structures and Algorithms, Interval-membership-width, Restless temporal paths, [INFO.INFO-CC] Computer Science [cs]/Computational Complexity [cs.CC], [INFO.INFO-DS] Computer Science [cs]/Data Structures and Algorithms [cs.DS], Data Structures and Algorithms (cs.DS), Computational Complexity (cs.CC)

Popis súboru: application/pdf

Prístupová URL adresa: http://arxiv.org/abs/2507.05760
https://inria.hal.science/hal-05144137v1

Partition Based Algorithms for Rearrangement Distances With Flexible Intergenic Regions

Autori: Gabriel Siqueira Alexsandro Oliveira Alexandrino Andre Rodrigues Oliveira a ďalší

Prispievatelia: Gabriel Siqueira Alexsandro Oliveira Alexandrino Andre Rodrigues Oliveira a ďalší

Zdroj: IEEE Transactions on Computational Biology and Bioinformatics. 22:455-468

Predmety: [INFO.INFO-CC]Computer Science [cs]/Computational Complexity [cs.CC], Rearrangement Distance, Bioinformatics, [INFO.INFO-DS]Computer Science [cs]/Data Structures and Algorithms [cs.DS], Genomics, Transforms, Approximation algorithms, Partitioning algorithms, Computational biology, Reversal, Intergenic Regions, Transposition, Heuristic algorithms, [INFO.INFO-BI]Computer Science [cs]/Bioinformatics [q-bio.QM], Partition

Prístupová URL adresa: https://pubmed.ncbi.nlm.nih.gov/39316499

Are Botanical Trees Graph-Theoretic Trees? The Ups and Downs of the Network Approach to Plant Growth

Autori: Varenne, Franck

Prispievatelia: Varenne, Franck

Zdroj: Yearbook for Philosophy of Complex Systems. 1:141-156

Predmety: [SDV.BIBS] Life Sciences [q-bio]/Quantitative Methods [q-bio.QM], Complex system, functional-structural models, Network, theoretical biology, Non-linearity, Topology, Trees, Remathematization of simulations, [SHS.HISPHILSO] Humanities and Social Sciences/History, Philosophy and Sociology of Sciences, [SDV.BDD] Life Sciences [q-bio]/Development Biology, [INFO.INFO-CC] Computer Science [cs]/Computational Complexity [cs.CC], [INFO.INFO-MO] Computer Science [cs]/Modeling and Simulation, Plant modeling, Graphs, Botanical trees

Robust ordinal regression for subsets comparisons with interactions

Autori: Gilbert, Hugo Ouaguenouni, Mohamed Öztürk, Meltem a ďalší

Prispievatelia: Gilbert, Hugo Ouaguenouni, Mohamed Öztürk, Meltem a ďalší

Zdroj: European Journal of Operational Research. 320:146-159

Predmety: [INFO.INFO-AI] Computer Science [cs]/Artificial Intelligence [cs.AI], FOS: Computer and information sciences, Artificial Intelligence (cs.AI), Computer Science - Artificial Intelligence, 0211 other engineering and technologies, 0202 electrical engineering, electronic engineering, information engineering, Subsets comparisons, [INFO.INFO-CC] Computer Science [cs]/Computational Complexity [cs.CC], 02 engineering and technology, Preference elicitation, Robust ordinal regression, Positive and negative interactions

Popis súboru: application/pdf

Prístupová URL adresa: http://arxiv.org/abs/2308.03376

On the Asymptotic Nonnegative Rank of Matrices and its Applications in Information Theory

Autori: Chee, Yeow Meng Le, Quoc-Tung Ta, Duy Hoang a ďalší

Prispievatelia: Chee, Yeow Meng Le, Quoc-Tung Ta, Duy Hoang a ďalší

Zdroj: 2024 IEEE International Symposium on Information Theory (ISIT). :1955-1960

Predmety: [MATH.MATH-AC] Mathematics [math]/Commutative Algebra [math.AC], FOS: Computer and information sciences, Computer Science - Computational Complexity, Computer Science - Information Theory, Information Theory (cs.IT), FOS: Mathematics, [INFO.INFO-CC] Computer Science [cs]/Computational Complexity [cs.CC], [INFO.INFO-IT] Computer Science [cs]/Information Theory [cs.IT], Computational Complexity (cs.CC), Mathematics - Commutative Algebra, Commutative Algebra (math.AC)

Popis súboru: application/pdf

Prístupová URL adresa: http://arxiv.org/abs/2308.07187
https://hal.science/hal-05082382v1
https://doi.org/10.1109/isit57864.2024.10619320
https://hal.science/hal-05082382v1/document

La boucle infernale. Croissance numérique, besoins énergétiques, impacts environnementaux et préoccupations sécuritaires

Autori: Dirks, Gary Grumbach, Stéphane van der Leeuw, Sander a ďalší

Prispievatelia: Dirks, Gary Grumbach, Stéphane van der Leeuw, Sander a ďalší

Zdroj: Hérodote. :25-44

Predmety: [INFO.INFO-CY] Computer Science [cs]/Computers and Society [cs.CY], [INFO.INFO-SI] Computer Science [cs]/Social and Information Networks [cs.SI], [INFO.INFO-DB] Computer Science [cs]/Databases [cs.DB], [INFO.INFO-CC] Computer Science [cs]/Computational Complexity [cs.CC], [SHS] Humanities and Social Sciences, [INFO] Computer Science [cs], [SHS.SCIPO] Humanities and Social Sciences/Political science

Prístupová URL adresa: https://hal.science/hal-04903566v1
https://doi.org/10.3917/her.195.0025

An Efficient and Scalable Approach to Build Co-occurrence Matrix for DNN's Embedding Layer

Autori: Petit, Quentin Li, Chong Emad, Nahid a ďalší

Prispievatelia: Petit, Quentin Li, Chong Emad, Nahid a ďalší

Zdroj: Proceedings of the 38th ACM International Conference on Supercomputing. :286-297

Predmety: [INFO.INFO-CC]Computer Science [cs]/Computational Complexity [cs.CC], [INFO.INFO-DC]Computer Science [cs]/Distributed, Information extraction, Natural language processing, [INFO.INFO-DS]Computer Science [cs]/Data Structures and Algorithms [cs.DS], [INFO.INFO-DS] Computer Science [cs]/Data Structures and Algorithms [cs.DS], Parallel, Distributed computing, Sparse matrix, Computing methodologies → Massively parallel algorithms, and Cluster Computing [cs.DC], Large-scale data analytics, Control methods Deep Learning, [INFO.INFO-DC] Computer Science [cs]/Distributed, Parallel, and Cluster Computing [cs.DC], [INFO.INFO-CC] Computer Science [cs]/Computational Complexity [cs.CC], Co-occurrence matrix, Computing methodologies → Massively parallel algorithms Natural language processing Information extraction Control methods Deep Learning, Embedding

Popis súboru: application/pdf

Prístupová URL adresa: https://hal.science/hal-04719623v1
https://hal.science/hal-04719623v1/document
https://doi.org/10.1145/3650200.3656629

Tightening I/O Lower Bounds through the Hourglass Dependency Pattern

Autori: Lionel Eyraud-Dubois Guillaume Iooss Julien Langou a ďalší

Prispievatelia: Lionel Eyraud-Dubois Guillaume Iooss Julien Langou a ďalší

Zdroj: Proceedings of the 36th ACM Symposium on Parallelism in Algorithms and Architectures. :183-193

Predmety: FOS: Computer and information sciences, Data Movement Lower Bound, Computer Science - Computational Complexity, Computer Science - Distributed, Parallel, and Cluster Computing, [INFO.INFO-DC] Computer Science [cs]/Distributed, Parallel, and Cluster Computing [cs.DC], I/O complexity, [INFO.INFO-CC] Computer Science [cs]/Computational Complexity [cs.CC], 0102 computer and information sciences, Distributed, Parallel, and Cluster Computing (cs.DC), 0101 mathematics, Computational Complexity (cs.CC), 01 natural sciences

Popis súboru: application/pdf

Prístupová URL adresa: http://arxiv.org/abs/2404.16443
https://inria.hal.science/hal-04555744v1

A LOCAL View of the Polynomial Hierarchy

Autori: Reiter, Fabian

Prispievatelia: Reiter, Fabian

Zdroj: Proceedings of the 43rd ACM Symposium on Principles of Distributed Computing. :347-357

Predmety: FOS: Computer and information sciences, [INFO.INFO-LO] Computer Science [cs]/Logic in Computer Science [cs.LO], Computational Complexity, Logic in Computer Science, Formal Languages and Automata Theory (cs.FL), C.2.4, F.1.1, F.1.2, F.1.3, F.4.1, F.4.3, LOCAL model, Distributed decision, Computational Complexity (cs.CC), Descriptive complexity, Logic in Computer Science (cs.LO), [INFO.INFO-DC] Computer Science [cs]/Distributed, Parallel, and Cluster Computing [cs.DC], [INFO.INFO-CC] Computer Science [cs]/Computational Complexity [cs.CC], Distributed, Parallel, and Cluster Computing, Distributed, Parallel, and Cluster Computing (cs.DC), Formal Languages and Automata Theory, Polynomial hierarchy, [INFO.INFO-FL] Computer Science [cs]/Formal Languages and Automata Theory [cs.FL]

Prístupová URL adresa: http://arxiv.org/abs/2305.09538
https://hal.science/hal-04719424v1
https://doi.org/10.1145/3662158.3662774

On the Power of Homogeneous Algebraic Formulas

Autori: Fournier, Hervé Limaye, Nutan Srinivasan, Srikanth a ďalší

Prispievatelia: Fournier, Hervé Limaye, Nutan Srinivasan, Srikanth a ďalší

Zdroj: Fournier, H, Limaye, N, Srinivasan, S & Tavenas, S 2024, On the Power of Homogeneous Algebraic Formulas . in B Mohar, I Shinkar & R O�Donnell (eds), STOC 2024-Proceedings of the 56th Annual ACM Symposium on Theory of Computing . Association for Computing Machinery, pp. 141-151, 56th Annual ACM Symposium on Theory of Computing, STOC 2024, Vancouver, Canada, 24/06/2024 . https://doi.org/10.1145/3618260.3649760

Predmety: Formula Homogenization ACM Reference, Algebraic Formulas, Formula Homogenization, [INFO.INFO-CC] Computer Science [cs]/Computational Complexity [cs.CC], Theory of computation → Algebraic complexity theory, Circuit complexity Algebraic Formulas

Popis súboru: application/pdf

Prístupová URL adresa: https://curis.ku.dk/ws/files/431873603/On_the_Power_of_Homogeneous_Algebraic_Formula.pdf
https://hal.science/hal-04683830v1/document
https://doi.org/10.1145/3618260.3649760
https://hal.science/hal-04683830v1

DeepLSH: Deep Locality-Sensitive Hash Learning for Fast and Efficient Near-Duplicate Crash Report Detection

Autori: Youcef Remil Anes Bendimerad Romain Mathonat a ďalší

Prispievatelia: Youcef Remil Anes Bendimerad Romain Mathonat a ďalší

Zdroj: Proceedings of the IEEE/ACM 46th International Conference on Software Engineering. :1-12

Predmety: Locality-sensitive hashing, [INFO.INFO-AI] Computer Science [cs]/Artificial Intelligence [cs.AI], FOS: Computer and information sciences, Siamese neural networks, Approximate nearest neighbors, Computer Science - Artificial Intelligence, [INFO.INFO-SE] Computer Science [cs]/Software Engineering [cs.SE], 02 engineering and technology, [INFO] Computer Science [cs], 01 natural sciences, Stack trace similarity, Software Engineering (cs.SE), Computer Science - Software Engineering, Artificial Intelligence (cs.AI), 0202 electrical engineering, electronic engineering, information engineering, [INFO.INFO-CC] Computer Science [cs]/Computational Complexity [cs.CC], Crash deduplication Stack trace similarity Approximate nearest neighbors Locality-sensitive hashing Siamese neural networks, 0101 mathematics, Crash deduplication

Popis súboru: application/pdf

Prístupová URL adresa: http://arxiv.org/abs/2310.06703
https://hal.science/hal-04236085v1

Quantum state synthesis: relation with decision complexity classes and impossibility of error reduction

Autori: Delavenne, Hugo Gall, François Le

Prispievatelia: Delavenne, Hugo Gall, François Le

Zdroj: Quantum Information & Computation. 24:745-765

Predmety: FOS: Computer and information sciences, Quantum Physics, Computer Science - Computational Complexity, FOS: Physical sciences, [INFO.INFO-CC] Computer Science [cs]/Computational Complexity [cs.CC], Computational Complexity (cs.CC), Quantum Physics (quant-ph), [PHYS.QPHY] Physics [physics]/Quantum Physics [quant-ph]

Popis súboru: application/pdf

Prístupová URL adresa: http://arxiv.org/abs/2407.02907
https://hal.science/hal-04634958v1
https://doi.org/10.26421/qic24.9-10-3
https://hal.science/hal-04634958v1/document

Nonatomic Non-Cooperative Neighbourhood Balancing Games

Autori: Auger, David Cohen, Johanne Lobstein, Antoine a ďalší

Prispievatelia: Auger, David Cohen, Johanne Lobstein, Antoine a ďalší

Zdroj: Fundamenta Informaticae. 191:239-268

Predmety: [INFO.INFO-CC]Computer Science [cs]/Computational Complexity [cs.CC], FOS: Computer and information sciences, Discrete Mathematics (cs.DM), 0211 other engineering and technologies, [SCCO.COMP]Cognitive science/Computer science, 0102 computer and information sciences, 02 engineering and technology, [INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM], 01 natural sciences, Computer Science - Computer Science and Game Theory, [INFO]Computer Science [cs], Computer Science - Discrete Mathematics, Computer Science and Game Theory (cs.GT)

Popis súboru: application/pdf

Prístupová URL adresa: http://arxiv.org/abs/2303.08507
https://fi.episciences.org/11080

Efficient Simulation of Parametrized Quantum Circuits under Nonunital Noise through Pauli Backpropagation

Autori: Martinez, Victor Angrisani, Armando Pankovets, Ekaterina a ďalší

Prispievatelia: Martinez, Victor Angrisani, Armando Pankovets, Ekaterina a ďalší

Zdroj: Martinez, V, Angrisani, A, Pankovets, E, Fawzi, O & Stilck França, D 2025, ' Efficient Simulation of Parametrized Quantum Circuits under Nonunital Noise through Pauli Backpropagation ', Physical Review Letters, vol. 134, no. 25, 250602 . https://doi.org/10.1103/j1gg-s6zb

Predmety: FOS: Computer and information sciences, Quantum Physics, Computational Complexity, FOS: Physical sciences, [INFO.INFO-CC] Computer Science [cs]/Computational Complexity [cs.CC], Mathematical Physics (math-ph), [PHYS.MPHY] Physics [physics]/Mathematical Physics [math-ph], Computational Complexity (cs.CC), Quantum Physics (quant-ph), [PHYS.QPHY] Physics [physics]/Quantum Physics [quant-ph], Mathematical Physics

Popis súboru: application/pdf

Prístupová URL adresa: http://arxiv.org/abs/2501.13050
https://curis.ku.dk/ws/files/460335571/Efficient_simulation.pdf

Chasing 'strange animals': Network analysis tools for the economic study of supra-dyadic structures

Autori: Delio Lucena-Piquero Stefano Ugolini Jérôme Vicente a ďalší

Prispievatelia: Delio Lucena-Piquero Stefano Ugolini Jérôme Vicente a ďalší

Zdroj: Journal of Evolutionary Economics.

Predmety: Hyperstructures, Structural equivalence, Chains, [INFO.INFO-CC] Computer Science [cs]/Computational Complexity [cs.CC], Higher-order networks, [SHS.ECO] Humanities and Social Sciences/Economics and Finance, Supra-dyadic structures, Places

Prístupová URL adresa: https://hal.science/hal-05238691v1
https://doi.org/10.1007/s00191-025-00903-y

Alignment-free detection and seed-based identification of multi-loci V(D)J recombinations in Vidjil-algo

Autori: Borée, Cyprien Giraud, Mathieu Salson, Mikaël

Prispievatelia: Borée, Cyprien Giraud, Mathieu Salson, Mikaël

Zdroj: Peer Community Journal, Vol 5, Iss, Pp-(2025)

Predmety: Spaced seeds, Immune repertoire, Alignment-free algorithm, [SDV.IMM] Life Sciences [q-bio]/Immunology, Spaced seeds, Aho-Corasick Automaton, Alignment-free algorithm, Immune repertoire, VDJ recombinations, Adaptive immune receptor repertoire, Science, Aho-Corasick Automaton, Archaeology, Adaptive immune receptor repertoire, [INFO.INFO-CC] Computer Science [cs]/Computational Complexity [cs.CC], VDJ recombinations, CC1-960, [INFO.INFO-BI] Computer Science [cs]/Bioinformatics [q-bio.QM]

Popis súboru: application/pdf

Prístupová URL adresa: https://doaj.org/article/7d1c2781708d4737b664cc23bfc22905
https://hal.science/hal-04361907v4/document
https://hal.science/hal-04361907v4
https://doi.org/10.24072/pcjournal.547

Geometric and computational hardness of bilevel programming

Autori: Bolte, Jérôme Le, Quoc-Tung Pauwels, Edouard a ďalší

Prispievatelia: Bolte, Jérôme Le, Quoc-Tung Pauwels, Edouard a ďalší

Zdroj: Mathematical Programming.

Predmety: Computational complexity, Algebraic geometry, FOS: Computer and information sciences, Computer Science - Computational Complexity, Polynomial optimization, Optimization and Control (math.OC), Bilevel optimization problem, FOS: Mathematics, [MATH.MATH-OC] Mathematics [math]/Optimization and Control [math.OC], [INFO.INFO-CC] Computer Science [cs]/Computational Complexity [cs.CC], Expressivity analysis, Computational Complexity (cs.CC), Mathematics - Optimization and Control

Popis súboru: application/pdf

Prístupová URL adresa: http://arxiv.org/abs/2407.12372
https://inria.hal.science/hal-04649435v2
https://inria.hal.science/hal-04649435v2/document