Výsledky vyhledávání - algorithm analysis and problems complexity*

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

Autoři: Day, Joel D. Kosche, Maria Manea, Florin a další

Přispěvatelé: Day, Joel D. Kosche, Maria Manea, Florin a další

Témata: 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 souboru: application/pdf

Pří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

Autoři: Ochimana, Israel

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

Algorithmic obstructions in the random number partitioning problem

Autoři: Gamarnik, David Kızıldağ, Eren C.

Zdroj: The Annals of Applied Probability. 33

Témata: 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 souboru: application/xml

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

Predicting Data Science Performance from Log Data: Using Machine Learning

Autoři: Tenzin Doleck Pedram Agand Dylan Pirrotta

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

Peer Reviewed: Y

Page Count: 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.

Autoři: Mi, Zengzhen Jiang, Tong Leng, Wenwen a další

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

Témata: 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.

Autoři: 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

Autoři: Milenkovic, Olgica Compton, Kevin J. Department of Electrical Engineering and Computer Science, University of Michigan, Ann Arbor, MI 48109, USA a další

Přispěvatelé: Milenkovic, Olgica Compton, Kevin J. Department of Electrical Engineering and Computer Science, University of Michigan, Ann Arbor, MI 48109, USA a další

Zdroj: Algorithmica. 43:211-244

Témata: 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 souboru: 288658 bytes; 3115 bytes; application/pdf; text/plain

Pří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.

Autoři: Taylor, Rebecca M. J. Moore, Jack A. Griffiths, Amy R. a další

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

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

Autoři: Jeffrey D. Ullman Matthew S. Hecht

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

Témata: 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 souboru: application/xml

Pří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

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

Autoři: Herrera‐Camacho, Jose Tırınk, Cem Parra‐Cortés, Rosa Inés a další

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

Témata: Machine learning, Milk yield, Body weight, Heifers, Rural geography

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

Autoři: Freund, Robert M. Vera, Jorge R.

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

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

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

Autoři: Shalaby, Ahmed Woods, Damien Ahmed Shalaby and Damien Woods

Přispěvatelé: Shalaby, Ahmed Woods, Damien Ahmed Shalaby and Damien Woods

Témata: 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 souboru: application/pdf

Pří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

Autoři: 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

Témata: Time complexity, space complexity, algorithm analysis

Popis souboru: application/pdf

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

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

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

Autoři: Joel D. Day and Maria Kosche and Florin Manea and Markus L. Schmid Day, Joel D. Kosche, Maria a další

Témata: String algorithms, subsequences with gap constraints, pattern matching, fine-grained complexity, conditional lower bounds, parameterised complexity, InProceedings, Text, doc-type:ResearchArticle, publishedVersion

URL: https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2022.64
Is Part Of LIPIcs, Volume 248, 33rd International Symposium on Algorithms and Computation (ISAAC 2022)

Fine-Grained Complexity of Program Analysis (Invited Talk)

Autoři: Rupak Majumdar Majumdar, Rupak

Témata: Fine-grained complexity, CFL reachability, 2NPDA recognition, PDA emptiness, InProceedings, Text, doc-type:ResearchArticle, publishedVersion

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

Asymptotic Analysis of an Algorithm for Balanced Parallel Processor Scheduling: Asymptotic analysis of an algorithm for balanced parallel processor scheduling

Autoři: Li-Hui Tsai

Zdroj: SIAM Journal on Computing. 21:59-64

Témata: Deterministic scheduling theory in operations research, Analysis of algorithms and problem complexity, makespan scheduling, 0211 other engineering and technologies, 0102 computer and information sciences, 02 engineering and technology, probabilistic algorithm analysis, 01 natural sciences, Performance evaluation, queueing, and scheduling in the context of computer systems

Popis souboru: application/xml

Přístupová URL adresa: https://dlnext.acm.org/doi/abs/10.1137/0221007
https://epubs.siam.org/doi/abs/10.1137/0221007
https://dblp.uni-trier.de/db/journals/siamcomp/siamcomp21.html#Tsai92
https://doi.org/10.1137/0221007

Problems on Algorithms

Autoři: Habib Izadkhah

Resource Type: eBook.

Témata: Engineering—Data processing, Computational intelligence, Machine learning, Engineering mathematics

Categories: COMPUTERS / Data Science / General, COMPUTERS / Artificial Intelligence / General, MATHEMATICS / Applied, MATHEMATICS / Probability & Statistics / General, TECHNOLOGY & ENGINEERING / Engineering (General)

On the sequential nature of interprocedural program-analysis problems

Autoři: Thomas Reps

Zdroj: Acta Informatica. 33:739-757

Témata: Theory of software, interprocedural program-analysis, Analysis of algorithms and problem complexity, 0202 electrical engineering, electronic engineering, information engineering, 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences

Popis souboru: application/xml

Přístupová URL adresa: https://research.cs.wisc.edu/wpis/papers/acta96.pdf
https://link.springer.com/article/10.1007/BF03036473
http://doi.org/10.1007/BF03036473
https://doi.org/10.1007/BF03036473
https://dblp.uni-trier.de/db/journals/acta/acta33.html#Reps96
http://research.cs.wisc.edu/wpis/papers/acta96.pdf

Measurement-Based Probabilistic Timing Analysis for Graphics Processor Units

Autoři: Berezovskyi, Kostiantyn Guet, Fabrice Santinelli, Luca a další

Přispěvatelé: Berezovskyi, Kostiantyn Guet, Fabrice Santinelli, Luca a další

Témata: Computer Communication Networks, Computer System Implementation, Algorithm Analysis and Problem Complexity, Software Engineering

Popis souboru: application/pdf

Dostupnost: http://hdl.handle.net/10400.22/9498

A Deterministic Nonsmooth Frank Wolfe Algorithm with Coreset Guarantees.

Autoři: Ravi, Sathya N. Collins, Maxwell D. Singh, Vikas

Zdroj: INFORMS Journal on Optimization; Spring2019, Vol. 1 Issue 2, p120-142, 23p

Témata: TIME complexity, NONSMOOTH optimization, PRINCIPAL components analysis, SUPPORT vector machines, LEARNING problems