Výsledky vyhľadávania - Algorithm analysis and problems complexity

Subsequences With Gap Constraints: Complexity Bounds for Matching and Analysis Problems

Autori: Day, Joel D. Kosche, Maria Manea, Florin a ďalší

Prispievatelia: Day, Joel D. Kosche, Maria Manea, Florin a ďalší

Predmety: String algorithms, FOS: Computer and information sciences, Formal Languages and Automata Theory (cs.FL), Computer Science - Formal Languages and Automata Theory, 0102 computer and information sciences, 02 engineering and technology, Computational Complexity (cs.CC), 01 natural sciences, Computer Science - Computational Complexity, pattern matching, conditional lower bounds, fine-grained complexity, parameterised complexity, Computer Science - Data Structures and Algorithms, 0202 electrical engineering, electronic engineering, information engineering, Data Structures and Algorithms (cs.DS), ddc:004, subsequences with gap constraints

Popis súboru: application/pdf

Prístupová URL adresa: http://arxiv.org/abs/2206.13896
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2022.64

Time-Step Ratio Theory (TSR): A Formal Proof on the Relationship Between Solving and Checking in NP Problems

Autori: Ochimana, Israel

Predmety: Time-Step Ratio Theory, TSR, NP problems, computational complexity, solving vs checking, formal proof, algorithm analysis

Complexity Analysis for Certain Convex Programming Problems: Complexity analysis for certain convex programming problems

Autori: Marie-Cécile Darracq

Zdroj: Journal of Complexity. 15:282-293

Predmety: Statistics and Probability, Convex programming, Numerical Analysis, Algebra and Number Theory, Control and Optimization, Applied Mathematics, 0211 other engineering and technologies, 02 engineering and technology, convex programming, Complexity and performance of numerical algorithms, barrier method, complexity, optimization, Smale's alpha-theory

Popis súboru: application/xml

Prístupová URL adresa: https://zbmath.org/1439897
https://doi.org/10.1006/jcom.1999.0500
https://core.ac.uk/display/82346762
https://www.sciencedirect.com/science/article/pii/S0885064X99905009
https://dblp.uni-trier.de/db/journals/jc/jc15.html#Darracq99

Complexity and Algorithms for Graph and Hypergraph Sandwich Problems: Complexity and algorithms for graph and hypergraph sandwich problems

Autori: Martin Charles Golumbic Amir Wassermann

Zdroj: Graphs and Combinatorics. 14:223-239

Predmety: Graphs and linear algebra (matrices, eigenvalues, etc.), Graph theory (including graph drawing) in computer science, Graph algorithms (graph-theoretic aspects), Analysis of algorithms and problem complexity, 0102 computer and information sciences, 0101 mathematics, Hypergraphs, 01 natural sciences, hypergraph sandwich problem

Popis súboru: application/xml

Prístupová URL adresa: https://zbmath.org/1211724
https://doi.org/10.1007/s003730050028
https://dblp.uni-trier.de/db/journals/gc/gc14.html#GolumbicW98
https://link.springer.com/article/10.1007/s003730050028

Complexity Analysis of an Interior Cutting Plane Method for Convex Feasibility Problems: Complexity analysis of an interior cutting plane method for convex feasibility problems

Autori: Yinyu Ye Jean-Louis Goffin Zhi-Quan Luo

Zdroj: SIAM Journal on Optimization. 6:638-652

Predmety: Convex programming, separation oracle, convergence, fully polynomial approximation algorithm, potential reduction, convex feasibility problems, dual column generation algorithm, 0211 other engineering and technologies, 02 engineering and technology, Abstract computational complexity for mathematical programming problems, complexity, Nonconvex programming, global optimization, cutting planes

Popis súboru: application/xml

Prístupová URL adresa: https://epubs.siam.org/doi/abs/10.1137/S1052623493258635
https://dl.acm.org/doi/10.1137/S1052623493258635
https://doi.org/10.1137/S1052623493258635
https://dblp.uni-trier.de/db/journals/siamjo/siamjo6.html#GoffinLY96
https://experts.umn.edu/en/publications/complexity-analysis-of-an-interior-cutting-plane-method-for-conve

Algorithmic obstructions in the random number partitioning problem

Autori: Gamarnik, David Kızıldağ, Eren C.

Zdroj: The Annals of Applied Probability. 33

Predmety: Probability in computer science (algorithm analysis, random structures, phase transitions, etc.), Analysis of algorithms and problem complexity, FOS: Physical sciences, statistical physics, Mathematics - Statistics Theory, 0102 computer and information sciences, Statistics Theory (math.ST), free energy wells, 01 natural sciences, discrepancy, FOS: Mathematics, overlap gap property, 0101 mathematics, Disordered systems (random Ising models, random Schrödinger operators, etc.) in equilibrium statistical mechanics, Mathematical Physics, Combinatorial probability, computational complexity, number partitioning, Probability (math.PR), average-case hardness, Mathematical Physics (math-ph), optimization landscape, randomized controlled trials, moment method, Mathematics - Probability, Statistical mechanics of random media, disordered materials (including liquid crystals and spin glasses)

Popis súboru: application/xml

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

The point-to-point delivery and connection problems: complexity and algorithms: The point-to-point delivery and connection problems: Complexity and algorithms

Autori: Chung Lun Li David Simchi-Levi S. Thomas McCormick

Zdroj: Discrete Applied Mathematics. 36:267-292

Predmety: Network design and communication in computer systems, point-to-point connection problems, Analysis of algorithms and problem complexity, Applied Mathematics, strongly NP-hard, 0211 other engineering and technologies, Discrete Mathematics and Combinatorics, point-to-point delivery problems, 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences

Popis súboru: application/xml

Prístupová URL adresa: https://dblp.uni-trier.de/db/journals/dam/dam36.html#LiMS92
https://www.sciencedirect.com/science/article/abs/pii/0166218X9290258C
https://www.sciencedirect.com/science/article/pii/0166218X9290258C
https://api.elsevier.com/content/article/PII:0166218X9290258C?httpAccept=text/xml

On some multicriteria arborescence problems: Complexity and algorithms

Autori: DELL'AMICO, Mauro MAFFIOLI F.

Zdroj: Discrete Applied Mathematics. 65:191-206

Predmety: Arborescence, Computational Complexity, Multicriteria, Analysis of algorithms and problem complexity, Graph theory (including graph drawing) in computer science, Applied Mathematics, 0211 other engineering and technologies, Discrete Mathematics and Combinatorics, 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences, digraph

Popis súboru: application/xml

Prístupová URL adresa: https://zbmath.org/897380
https://doi.org/10.1016/0166-218x(95)00035-p
https://www.sciencedirect.com/science/article/pii/0166218X9500035P
https://iris.unimore.it/handle/11380/451178
https://doi.org/10.1016/0166-218X(95)00035-P
https://dblp.uni-trier.de/db/journals/dam/dam65.html#DellAmicoM96
https://hdl.handle.net/11380/451178

Predicting Data Science Performance from Log Data: Using Machine Learning

Autori: Tenzin Doleck Pedram Agand Dylan Pirrotta

Zdroj: Education and Information Technologies. 2025 30(10):14561-14575.

Peer Reviewed: Y

Počet strán: 15

Descriptors: Prediction, Data Science, Performance, Data Analysis, Artificial Intelligence, Statistics Education, Algorithms, Problem Solving, Accuracy

Managing Redundancy in a Multiple-Robot Orienteering Problem for Equilibrium and Robustness.

Autori: Mi, Zengzhen Jiang, Tong Leng, Wenwen a ďalší

Zdroj: Applied Sciences (2076-3417); Aug2025, Vol. 15 Issue 15, p8217, 18p

Predmety: REDUNDANCY in engineering, ROBOTIC path planning, OPTIMIZATION algorithms, RESOURCE allocation, HEURISTIC, MONTE Carlo method, MATHEMATICAL optimization, ROBUST control

Learning-assisted schedulability analysis: opportunities and limitations.

Autori: Baruah, Sanjoy Ekberg, Pontus Sudvarg, Marion

Zdroj: Real-Time Systems; Dec2025, Vol. 61 Issue 3/4, p332-358, 27p

Average Case Analysis of Gosper’s Algorithm for a Class of Urn Model Inputs

Autori: Milenkovic, Olgica Compton, Kevin J. Department of Electrical Engineering and Computer Science, University of Michigan, Ann Arbor, MI 48109, USA a ďalší

Prispievatelia: Milenkovic, Olgica Compton, Kevin J. Department of Electrical Engineering and Computer Science, University of Michigan, Ann Arbor, MI 48109, USA a ďalší

Zdroj: Algorithmica. 43:211-244

Predmety: Computer Systems Organization and Communication Networks, Algorithm Analysis and Problem Complexity, Cryptology and Information Theory, Science, 4. Education, Theory of Computation, 02 engineering and technology, Data Structures, Computer Hardware, 16. Peace & justice, 01 natural sciences, Software Engineering/Programming and Operating Systems, Philosophy, Humanities, Urn Models, Gosper'S Algorithm, Computer Science, 0202 electrical engineering, electronic engineering, information engineering, 0101 mathematics, Mathematics, Hypergeometric Functions

Popis súboru: 288658 bytes; 3115 bytes; application/pdf; text/plain

Prístupová URL adresa: http://deepblue.lib.umich.edu/bitstream/2027.42/41350/1/453_2005_Article_1173.pdf
https://dblp.uni-trier.de/db/journals/algorithmica/algorithmica43.html#MilenkovicC05
http://core.ac.uk/display/3103380
https://link.springer.com/article/10.1007/s00453-005-1173-y
https://link.springer.com/content/pdf/10.1007%2Fs00453-005-1173-y.pdf
https://experts.illinois.edu/en/publications/average-case-analysis-of-gospers-algorithm-for-a-class-of-urn-mod
https://deepblue.lib.umich.edu/handle/2027.42/41350

Unveiling Dietary Complexity: A Scoping Review and Reporting Guidance for Network Analysis in Dietary Pattern Research.

Autori: Taylor, Rebecca M. J. Moore, Jack A. Griffiths, Amy R. a ďalší

Zdroj: Nutrients. Oct2025, Vol. 17 Issue 20, p3261. 25p.

Self-Improvement for Circuit-Analysis Problems

Autori: R. Ryan Williams Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science

Prispievatelia: R. Ryan Williams Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science

Zdroj: Proceedings of the 56th Annual ACM Symposium on Theory of Computing. :1374-1385

Popis súboru: application/pdf

Complexity of Nilpotent Unification and Matching Problems: Complexity of nilpotent unification and matching problems.

Autori: Guo, Qing Narendran, Paliath Wolfram, David

Zdroj: Information and Computation. 162:3-23

Predmety: Problem solving, Analysis of algorithms and problem complexity, 0102 computer and information sciences, 02 engineering and technology, Polynomials, 01 natural sciences, Theoretical Computer Science, Computer Science Applications, Computational complexity, Matching problems, Mechanization of proofs and logical operations, Computational Theory and Mathematics, Keywords: Algorithms, 0202 electrical engineering, electronic engineering, information engineering, Set theory, Linear equations, equational unification, Pattern matching, Theorem proving (deduction, resolution, etc.), Information Systems

Popis súboru: application/xml

Prístupová URL adresa: https://digitalcollections.anu.edu.au/handle/1885/89088
https://dblp.uni-trier.de/db/journals/iandc/iandc162.html#GuoNW00
https://www.sciencedirect.com/science/article/pii/S0890540199928493
https://openresearch-repository.anu.edu.au/handle/1885/89088
https://core.ac.uk/display/82266128

Body Weight Estimation in Holstein × Zebu Crossbred Heifers: Comparative Analysis of XGBoost and LightGBM Algorithms.

Autori: Herrera‐Camacho, Jose Tırınk, Cem Parra‐Cortés, Rosa Inés a ďalší

Zdroj: Veterinary Medicine & Science. Jul2025, Vol. 11 Issue 4, p1-10. 10p.

Predmet: Machine learning, Milk yield, Body weight, Heifers, Rural geography

Equivalence of Convex Problem Geometry and Computational Complexity in the Separation Oracle Model

Autori: Freund, Robert M. Vera, Jorge R.

Zdroj: Mathematics of Operations Research, 2009 Nov 01. 34(4), 869-879.

Prístupová URL adresa: https://www.jstor.org/stable/40538404

A Simple Algorithm for Global Data Flow Analysis Problems: A simple algorithm for global data flow analysis problems

Autori: Jeffrey D. Ullman Matthew S. Hecht

Zdroj: SIAM Journal on Computing. 4:519-532

Predmety: Analysis of algorithms and problem complexity, 0202 electrical engineering, electronic engineering, information engineering, General topics in the theory of software, 02 engineering and technology, Algorithms in computer science

Popis súboru: application/xml

Prístupová URL adresa: https://dblp.uni-trier.de/db/journals/siamcomp/siamcomp4.html#HechtU75
https://epubs.siam.org/doi/10.1137/0204044
https://doi.org/10.1137/0204044

An efficient algorithm to compute the minimum free energy of interacting nucleic acid strands

Autori: Shalaby, Ahmed Woods, Damien Ahmed Shalaby and Damien Woods

Prispievatelia: Shalaby, Ahmed Woods, Damien Ahmed Shalaby and Damien Woods

Predmety: FOS: Computer and information sciences, F.2, F.2.0, F.2.3, G.2, G.2.1, G.2.2, partition function, Discrete Mathematics (cs.DM), MFE, FOS: Physical sciences, Computational Complexity (cs.CC), Computer Science - Data Structures and Algorithms, Data Structures and Algorithms (cs.DS), Physics - Biological Physics, dynamic programming, computational complexity, secondary structure, Biomolecules (q-bio.BM), DNA, algorithm analysis and design, nucleic acid, Computer Science - Computational Complexity, Quantitative Biology - Biomolecules, Biological Physics (physics.bio-ph), FOS: Biological sciences, Minimum free energy, RNA, ddc:004, Computer Science - Discrete Mathematics

Popis súboru: application/pdf

Prístupová URL adresa: http://arxiv.org/abs/2407.09676
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2025.130

Comprehensive Analysis of Time and Space Complexity in Algorithm Design

Autori: Shifa Khaleel

Zdroj: Journal of Advanced Research in Data Structures Innovations and Computer Science; Vol. 1 No. 1 (2025): Journal of Advanced Research in Data Structures Innovations and Computer Science; 1-5

Predmety: Time complexity, space complexity, algorithm analysis

Popis súboru: application/pdf

Relation: https://www.adrjournalshouse.com/index.php/datastructures/article/view/2304/2272; https://www.adrjournalshouse.com/index.php/datastructures/article/view/2304

Dostupnosť: https://www.adrjournalshouse.com/index.php/datastructures/article/view/2304