Výsledky vyhledávání - analysis of algorithms AND problems complexity general terms*

Distributed consensus algorithms for wireless sensor networks: convergence analysis and optimization

Autoři: Silva Pereira, Silvana

Přispěvatelé: University/Department: Universitat Politècnica de Catalunya. Departament de Teoria del Senyal i Comunicacions

Thesis Advisors: Pagès Zamora, Alba Maria

Zdroj: TDX (Tesis Doctorals en Xarxa)

Time: 621.3

Popis souboru: application/pdf

Přístupová URL adresa: http://hdl.handle.net/10803/131997
https://dx.doi.org/10.5821/dissertation-2117-95184

Position analysis based on multi-affine formulations

Autoři: Shabani, Arya

Thesis Advisors: Thomas, Federico, Porta Pleite, Josep Maria, Institut de Robòtica i Informàtica Industrial

Zdroj: TDX (Tesis Doctorals en Xarxa)

Témata: Àrees temàtiques de la UPC::Informàtica

Popis souboru: application/pdf

Přístupová URL adresa: http://hdl.handle.net/10803/674371
https://dx.doi.org/10.5821/dissertation-2117-368008

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.

Algorithm for filling curves on surfaces

Autoři: Monika Kudlinska

Zdroj: Geometriae Dedicata. 208:49-59

Témata: Fundamental group, presentations, free differential calculus, Dehn-Thurston coordinates, Analysis of algorithms and problem complexity, Geometric Topology (math.GT), 06 humanities and the arts, 01 natural sciences, Mathematics - Geometric Topology, filling curves, General geometric structures on low-dimensional manifolds, FOS: Mathematics, 0101 mathematics, Covering spaces and low-dimensional topology, hyperbolic surface, 0604 arts, geodesics

Popis souboru: application/xml

Přístupová URL adresa: https://link.springer.com/content/pdf/10.1007/s10711-019-00509-2.pdf
http://arxiv.org/abs/1906.02577
https://zbmath.org/7243370
https://doi.org/10.1007/s10711-019-00509-2
https://link.springer.com/article/10.1007/s10711-019-00509-2
https://link.springer.com/content/pdf/10.1007/s10711-019-00509-2.pdf

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

Fixed-parameter evolutionary algorithms and the vertex cover problem

Autoři: Stefan Kratsch Frank Neumann The Pennsylvania State University CiteSeerX Archives

Přispěvatelé: Stefan Kratsch Frank Neumann The Pennsylvania State University CiteSeerX Archives

Zdroj: http://www.mpi-inf.mpg.de/%7Eskratsch/papers/KratschN09_FixedParameterEvolutionaryAlgorithmsAndTheVertexCoverProblem.pdf.

Témata: Computation, Analysis of Algorithms and Problem Complexity General Terms, Theory, Algorithms, Performance Keywords, Combinatorial Optimization, Evolutionary Algorithms, Multi-Objective Optimization, Runtime Analysis

Popis souboru: application/pdf

Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.174.4997

Dostupnost: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.174.4997
http://www.mpi-inf.mpg.de/%7Eskratsch/papers/KratschN09_FixedParameterEvolutionaryAlgorithmsAndTheVertexCoverProblem.pdf

Precise Complexity Analysis for Efficient Datalog Queries

Autoři: K. Tuncay Tekle Yanhong A. Liu The Pennsylvania State University CiteSeerX Archives

Přispěvatelé: K. Tuncay Tekle Yanhong A. Liu The Pennsylvania State University CiteSeerX Archives

Zdroj: http://www.cs.sunysb.edu/%7Eliu/papers/RuleQuery-PPDP10.pdf.

Témata: F.2.2 [Analysis of Algorithms and Problems Complexity, Nonnumerical Algorithms and Problems—Computations on discrete structures, H.2.3 [Information Systems, Database Management— Query languages, H.2.4 [Information Systems, Systems—Query processing, Rule-based databases General Terms Languages, Performance Keywords Complexity analysis, Datalog, demand-driven evaluation, program transformation

Popis souboru: application/pdf

Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.183.4887

Dostupnost: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.183.4887
http://www.cs.sunysb.edu/%7Eliu/papers/RuleQuery-PPDP10.pdf

Smoothed analysis of algorithms: why the simplex algorithm usually takes polynomial time

Autoři: Daniel A. Spielman Shang-hua Teng The Pennsylvania State University CiteSeerX Archives

Přispěvatelé: Daniel A. Spielman Shang-hua Teng The Pennsylvania State University CiteSeerX Archives

Zdroj: http://www.cs.duke.edu/courses/spring07/cps296.2/papers/p385-a_spielman.pdf.

Témata: Categories and Subject Descriptors, F.2.1 [Analysis of Algorithms and Problems Complexity, Numerical Algorithms and Problems, G.1.6 [Numerical Analysis, Optimization—linear programming General Terms, Algorithms, Theory Additional Key Words and Phrases, Simplex method, smoothed analysis, complexity, perturbation

Popis souboru: application/pdf

Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.86.4665

Dostupnost: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.86.4665
http://www.cs.duke.edu/courses/spring07/cps296.2/papers/p385-a_spielman.pdf

General Techniques for Analyzing Recursive Algorithms with Applications: General techniques for analyzing recursive algorithms with applications

Autoři: Rakesh M. Verma

Zdroj: SIAM Journal on Computing. 26:568-581

Témata: graph algorithms, recurrences, problem complexity, Analysis of algorithms and problem complexity, Pattern recognition, speech recognition, 0102 computer and information sciences, 01 natural sciences, analysis of algorithms, Hardware implementations of nonnumerical algorithms (VLSI algorithms, etc.), associative-commutative (AC) matching, Graph theory (including graph drawing) in computer science, subtree isomorphism, Recurrences, divide-and-conquer, 0101 mathematics

Popis souboru: application/xml

Analysis of algorithms on problems in general abelian groups

Autoři: Costas S. Iliopoulos

Zdroj: Information Processing Letters. 20:215-220

Témata: intersection, time complexity, Analysis of algorithms and problem complexity, 0102 computer and information sciences, 02 engineering and technology, Symbolic computation and algebraic computation, defining relations, 01 natural sciences, elementary operation, set of generators, 0202 electrical engineering, electronic engineering, information engineering, Software, source code, etc. for problems pertaining to group theory, Abelian groups, complete basis

Popis souboru: application/xml

Přístupová URL adresa: https://dblp.uni-trier.de/db/journals/ipl/ipl20.html#Iliopoulos85
https://doi.org/10.1016/0020-0190(85)90052-3
http://www.sciencedirect.com/science/article/pii/0020019085900523
https://www.sciencedirect.com/science/article/abs/pii/0020019085900523

Markov Bases: Their Complexity and Applications to Network Analysis

Autoři: Almendra Hernandez, Felix

Témata: Mathematics, Statistics, Applied mathematics

Popis souboru: application/pdf

Přístupová URL adresa: https://escholarship.org/uc/item/2pq6k753
https://escholarship.org/content/qt2pq6k753/qt2pq6k753.pdf

Satisfiability algorithms for conjunctive queries over trees

Autoři: James Cheney The Pennsylvania State University CiteSeerX Archives

Přispěvatelé: James Cheney The Pennsylvania State University CiteSeerX Archives

Zdroj: http://www.edbt.org/Proceedings/2011-Uppsala/papers/icdt/a15-cheney.pdf.

Témata: Categories and Subject Descriptors H.2.3 [Database management systems, Languages— query languages, F.2.2 [Analysis of Algorithms and Problem Complexity, Nonnumerical Algorithms and Problems— Complexity of proof procedures General Terms Algorithms, Theory Keywords XPath, trees, satisfiability

Popis souboru: application/pdf

Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.429.3064

Dostupnost: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.429.3064
http://www.edbt.org/Proceedings/2011-Uppsala/papers/icdt/a15-cheney.pdf

Parameterized complexity of DPLL search procedures

Autoři: Olaf Beyersdorff, Nicola Galesi, Massimo Lauria The Pennsylvania State University CiteSeerX Archives

Přispěvatelé: Olaf Beyersdorff, Nicola Galesi, Massimo Lauria The Pennsylvania State University CiteSeerX Archives

Zdroj: http://tocl.acm.org/accepted/beyersdorff-galesi_parameterized.pdf.

Témata: Categories and Subject Descriptors, F.2.2 [Analysis of Algorithms and Problem Complexity, Nonnumerical Algorithms and Problems—Complexity of proof procedures General Terms, Algorithms, Theory Additional Key Words and Phrases, Proof complexity, parameterized complexity, Resolution, Prover-Delayer games ACM Reference Format

Popis souboru: application/pdf

Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.297.3540

Dostupnost: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.297.3540
http://tocl.acm.org/accepted/beyersdorff-galesi_parameterized.pdf

Enhancing computational efficiency in solving Knapsack problem: insights from algorithmic parallelization and optimization

Autoři: Bashar Bin Usman Okeyinka Aderemi Elisha Ibrahim Abdullahi a další

Zdroj: Advances in Computing and Engineering, Vol 4, Iss 2, Pp 52-65 (2024)

Témata: combinatorial, knapsack, heuristics, halstead metrics, time complexity, random number generation., Electronic computers. Computer science, QA75.5-76.95, Technology (General), T1-995, Computer engineering. Computer hardware, TK7885-7895

Popis souboru: electronic resource

Relation: http://apc.aast.edu/ojs/index.php/ACE/article/view/885; https://doaj.org/toc/2735-5977; https://doaj.org/toc/2735-5985

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

Categories and Subject Descriptors F.2 [Theory of Computation]: Analysis of Algorithms and Problem Complexity General Terms

Autoři: Stephan Holzer Yvonne Anne Pignolet Jasmin a další

Přispěvatelé: Stephan Holzer Yvonne Anne Pignolet Jasmin a další

Zdroj: http://www.tik.ee.ethz.ch/file/3310193889c049474006299954d7233c/2010 PODC - paper.pdf.

Témata: Algorithms, Reliability, Theory

Popis souboru: application/pdf

Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.395.7842

Dostupnost: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.395.7842
http://www.tik.ee.ethz.ch/file/3310193889c049474006299954d7233c/2010 PODC - paper.pdf

Beyond proof-of-compliance: security analysis in trust management

Autoři: Ninghui Li John C. Mitchell William H. Winsborough a další

Přispěvatelé: Ninghui Li John C. Mitchell William H. Winsborough a další

Zdroj: http://www.cs.utsa.edu/~winsboro/index_files/Papers/Safety_JACM_AcceptedVersion.pdf.

Témata: and Protection, D.4.6 [Operating Systems, Security and Protection—Access controls, F.2.2 [Analysis of Algorithms and Problem Complexity, Nonnumerical Algorithms and Problems—Complexity of proof procedures General Terms, Security, Theory, Languages Additional Key Words and Phrases, access control, trust management, distributed system security, logic

Popis souboru: application/pdf

Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.119.4238; http://www.cs.utsa.edu/~winsboro/index_files/Papers/Safety_JACM_AcceptedVersion.pdf

Dostupnost: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.119.4238
http://www.cs.utsa.edu/~winsboro/index_files/Papers/Safety_JACM_AcceptedVersion.pdf

Approximating Covering Problems by Randomized Search Heuristics Using Multi-objective Models

Autoři: Tobias Friedrich Jun He Nils Hebbinghaus a další

Přispěvatelé: Tobias Friedrich Jun He Nils Hebbinghaus a další

Zdroj: http://www.cs.bham.ac.uk/~wbl/biblio/gecco2007/docs/p797.pdf.

Témata: Computation, Analysis of Algorithms and Problem Complexity General Terms, Theory, Algorithms, Performance Keywords, Combinatorial Optimization, Covering Problems, Multi-Objective Optimization, Runtime Analysis

Popis souboru: application/pdf

Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.96.4360; http://www.cs.bham.ac.uk/~wbl/biblio/gecco2007/docs/p797.pdf

Dostupnost: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.96.4360
http://www.cs.bham.ac.uk/~wbl/biblio/gecco2007/docs/p797.pdf

Theoretical Analysis of Diversity Mechanisms for Global Exploration

Autoři: Tobias Friedrich Pietro S. Oliveto Dirk Sudholt a další

Přispěvatelé: Tobias Friedrich Pietro S. Oliveto Dirk Sudholt a další

Zdroj: http://www.cs.bham.ac.uk/~wbl/biblio/gecco2008/docs/p945.pdf.

Témata: Computation, Analysis of Algorithms and Problem Complexity General Terms, Theory, Algorithms, Performance Keywords, Diversity, runtime analysis, fitness sharing, deterministic crowding

Popis souboru: application/pdf

Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.153.1693; http://www.cs.bham.ac.uk/~wbl/biblio/gecco2008/docs/p945.pdf

Dostupnost: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.153.1693
http://www.cs.bham.ac.uk/~wbl/biblio/gecco2008/docs/p945.pdf

Rigorous analyses of simple diversity mechanisms

Autoři: Tobias Friedrich Nils Hebbinghaus Frank Neumann a další

Přispěvatelé: Tobias Friedrich Nils Hebbinghaus Frank Neumann a další

Zdroj: http://www.mpi-sb.mpg.de/~tfried/paper/2007GECCO_selection.pdf.

Témata: Computation, Analysis of Algorithms and Problem Complexity General Terms, Theory, Algorithms, Performance Keywords, Diversity, Runtime Analysis, Selection Procedures

Popis souboru: application/pdf

Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.217.2494

Dostupnost: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.217.2494
http://www.mpi-sb.mpg.de/~tfried/paper/2007GECCO_selection.pdf

Categories and Subject Descriptors F.2 [ Theory of Computation]: ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY General Terms Algorithms

Autoři: Piotr Indyk *mit The Pennsylvania State University CiteSeerX Archives

Přispěvatelé: Piotr Indyk *mit The Pennsylvania State University CiteSeerX Archives

Zdroj: http://theory.csail.mit.edu/~indyk/iw05.ps.

Témata: frequency moments

Popis souboru: application/postscript

Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.123.7339; http://theory.csail.mit.edu/~indyk/iw05.ps

Dostupnost: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.123.7339
http://theory.csail.mit.edu/~indyk/iw05.ps