Výsledky vyhledávání - Combinatorics and discrete structures related to algorithms

Algorithmic Aspects in Information and Management: 18Th International Conference, AAIM 2024, Virtual Event, September 21-23, 2024, Proceedings. Part II

Autoři: Ghosh, Smita Zhang, Zhao

Zdroj: Faculty Book Gallery

Témata: Algorithms and data structures, Algorithmic game theory and incentive analysis, Approximation algorithms and online algorithms, Automata, languages, logic, and computability Blockchain, Combinatorial optimization, Combinatorics and discrete structures related to algorithms, Communication networks and optimization, Complexity theory, Cryptography, reliability, and security, Graph algorithms and theory, Large graph algorithms and social network analysis, Optimization algorithms in economic and operations research, Parallel and distributed computing and multicore algorithms, Quantum computing, Computational learning theory, knowledge discovery, data mining

Relation: https://scholarcommons.scu.edu/faculty_books/644

Dostupnost: https://scholarcommons.scu.edu/faculty_books/644

Domination analysis for scheduling on non preemptive uniformly related machines

Autoři: Idan Eisner Alek Vainshtein

Zdroj: Discrete Mathematics & Theoretical Computer Science, Vol DMTCS Proceedings vol. AQ,..., Iss Proceedings (2012)

Témata: domination analysis, scheduling, combinatorial optimization, [info.info-ds] computer science [cs]/data structures and algorithms [cs.ds], [info.info-dm] computer science [cs]/discrete mathematics [cs.dm], [math.math-co] mathematics [math]/combinatorics [math.co], [info.info-cg] computer science [cs]/computational geometry [cs.cg], Mathematics, QA1-939

Popis souboru: electronic resource

Relation: https://dmtcs.episciences.org/2985/pdf; https://doaj.org/toc/1365-8050

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

Two-anticoloring of planar and related graphs

Autoři: Daniel Berend Ephraim Korach Shira Zucker

Zdroj: Discrete Mathematics & Theoretical Computer Science, Vol DMTCS Proceedings vol. AD,..., Iss Proceedings (2005)

Témata: separation, graph, algorithm, combinatorial optimization, graph anticoloring, [info.info-ds] computer science [cs]/data structures and algorithms [cs.ds], [info.info-dm] computer science [cs]/discrete mathematics [cs.dm], [math.math-co] mathematics [math]/combinatorics [math.co], [info.info-cg] computer science [cs]/computational geometry [cs.cg], Mathematics, QA1-939

Popis souboru: electronic resource

Relation: https://dmtcs.episciences.org/3388/pdf; https://doaj.org/toc/1365-8050

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

On the heapability of finite partial orders

Autoři: János Balogh Cosmin Bonchiş Diana Diniş a další

Zdroj: Discrete Mathematics & Theoretical Computer Science, Vol vol. 22 no. 1, Iss Combinatorics (2020)

Témata: mathematics - combinatorics, computer science - discrete mathematics, computer science - data structures and algorithms, 05a18, 68c05, 60k35, Mathematics, QA1-939

Popis souboru: electronic resource

Relation: https://dmtcs.episciences.org/4510/pdf; https://doaj.org/toc/1365-8050

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

Combinatorial structure of rigid transformations in 2D digital images

Autoři: Ngo, Phuc Kenmochi, Yukiko Passat, Nicolas a další

Zdroj: Computer Vision & Image Understanding. Apr2013, Vol. 117 Issue 4, p393-408. 16p.

Témata: Combinatorics, Mathematical analysis, Mathematical transformations, Digital images, Algorithms, Image analysis

Stable gonality is computable

Autoři: Ragnar Groot Koerkamp Marieke van der Wegen

Zdroj: Discrete Mathematics & Theoretical Computer Science, Vol vol. 21 no. 1, ICGT 2018 (2019)

Témata: computer science - discrete mathematics, computer science - data structures and algorithms, mathematics - combinatorics, mathematics - number theory, Mathematics, QA1-939

Popis souboru: electronic resource

Relation: https://dmtcs.episciences.org/4931/pdf; https://doaj.org/toc/1365-8050

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

Analytic Combinatorics of Lattice Paths: Enumeration and Asymptotics for the Area

Autoři: Cyril Banderier Bernhard Gittenberger

Zdroj: Discrete Mathematics & Theoretical Computer Science, Vol DMTCS Proceedings vol. AG,..., Iss Proceedings (2006)

Témata: algebraic function, kernel method, generating function, analytic combinatorics, lattice path, singularity analysis, brownian excursion, [info.info-ds] computer science [cs]/data structures and algorithms [cs.ds], [info.info-dm] computer science [cs]/discrete mathematics [cs.dm], [math.math-co] mathematics [math]/combinatorics [math.co], [info.info-hc] computer science [cs]/human-computer interaction [cs.hc], Mathematics, QA1-939

Popis souboru: electronic resource

Relation: https://dmtcs.episciences.org/3481/pdf; https://doaj.org/toc/1365-8050

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

A probabilistic analysis of a leader election algorithm

Autoři: Hanene Mohamed

Zdroj: Discrete Mathematics & Theoretical Computer Science, Vol DMTCS Proceedings vol. AG,..., Iss Proceedings (2006)

Témata: election algorithm. randomized selection algorithm. distributed systems. asymptotic oscillating behavior. probabilistic de-poissonization., [info.info-ds] computer science [cs]/data structures and algorithms [cs.ds], [info.info-dm] computer science [cs]/discrete mathematics [cs.dm], [math.math-co] mathematics [math]/combinatorics [math.co], Mathematics, QA1-939

Popis souboru: electronic resource

Relation: https://dmtcs.episciences.org/3516/pdf; https://doaj.org/toc/1365-8050

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

Degree distribution of random Apollonian network structures and Boltzmann sampling

Autoři: Alexis Darrasse Michèle Soria

Zdroj: Discrete Mathematics & Theoretical Computer Science, Vol DMTCS Proceedings vol. AH,..., Iss Proceedings (2007)

Témata: boltzmann sampling, random networks, bivariate generating functions, [info.info-ds] computer science [cs]/data structures and algorithms [cs.ds], [info.info-dm] computer science [cs]/discrete mathematics [cs.dm], [math.math-co] mathematics [math]/combinatorics [math.co], [info.info-cg] computer science [cs]/computational geometry [cs.cg], Mathematics, QA1-939

Popis souboru: electronic resource

Relation: https://dmtcs.episciences.org/3521/pdf; https://doaj.org/toc/1365-8050

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

Cache miss analysis of WHT algorithms

Autoři: Mihai Furis Paweł Hitczenko Jeremy Johnson

Zdroj: Discrete Mathematics & Theoretical Computer Science, Vol DMTCS Proceedings vol. AD,..., Iss Proceedings (2005)

Témata: walsh-hadamard transform, random compositions, performance analysis, cache, divide and conquer recurrences, geometric distributions, memory access patterns, [info.info-ds] computer science [cs]/data structures and algorithms [cs.ds], [info.info-dm] computer science [cs]/discrete mathematics [cs.dm], [math.math-co] mathematics [math]/combinatorics [math.co], [info.info-cg] computer science [cs]/computational geometry [cs.cg], [info.info-hc] computer science [cs]/human-computer interaction [cs.hc], Mathematics, QA1-939

Popis souboru: electronic resource

Relation: https://dmtcs.episciences.org/3363/pdf; https://doaj.org/toc/1365-8050

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

A Cross Entropy Algorithm for Classification with $\delta$−Patterns

Autoři: Gabriela Alexe Gyan Bhanot Adriana Climescu-Haulica

Zdroj: Discrete Mathematics & Theoretical Computer Science, Vol DMTCS Proceedings vol. AG,..., Iss Proceedings (2006)

Témata: classification, delta patterns, genome, [info.info-ds] computer science [cs]/data structures and algorithms [cs.ds], [info.info-dm] computer science [cs]/discrete mathematics [cs.dm], [math.math-co] mathematics [math]/combinatorics [math.co], [info.info-hc] computer science [cs]/human-computer interaction [cs.hc], Mathematics, QA1-939

Popis souboru: electronic resource

Relation: https://dmtcs.episciences.org/3485/pdf; https://doaj.org/toc/1365-8050

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

On the shelling antimatroids of split graphs

Autoři: Jean Cardinal Jean-Paul Doignon Keno Merckx

Zdroj: Discrete Mathematics & Theoretical Computer Science, Vol Vol. 19 no. 1, Iss Combinatorics (2017)

Témata: computer science - discrete mathematics, computer science - data structures and algorithms, mathematics - combinatorics, Mathematics, QA1-939

Popis souboru: electronic resource

Relation: https://dmtcs.episciences.org/1349/pdf; https://doaj.org/toc/1365-8050

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

The study of unfoldable self-avoiding walks - Application to protein structure prediction software.

Autoři: Guyeux, Christophe Nicod, Jean-Marc Philippe, Laurent a další

Zdroj: Journal of Bioinformatics & Computational Biology. Aug2015, Vol. 13 Issue 4, p-1. 36p.

Témata: *PROTEIN structure, *SELF-avoiding walks (Mathematics), *BIOINFORMATICS, *PROTEIN folding, *COMPUTATIONAL biology, *ENUMERATIVE combinatorics

Algorithmic Foundations for Social Advancement

Autoři: Shin-ichi Minato Takeaki Uno Norihito Yasuda a další

Resource Type: eBook.

Témata: Algorithms, Automatic differentiation

Categories: COMPUTERS / Computer Science, COMPUTERS / Programming / Algorithms

Fast Diameter Computation within Split Graphs

Autoři: Guillaume Ducoffe Michel Habib Laurent Viennot

Zdroj: Discrete Mathematics & Theoretical Computer Science, Vol vol. 23, no. 3, Iss Graph Theory (2021)

Témata: computer science - data structures and algorithms, mathematics - combinatorics, Mathematics, QA1-939

Popis souboru: electronic resource

Relation: https://dmtcs.episciences.org/6422/pdf; https://doaj.org/toc/1365-8050

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

Computing and Combinatorics : 18th Annual International Conference, COCOON 2012, Sydney, Australia, August 20-22, 2012, Proceedings

Autoři: Joachim Gudmundsson Julián Mestre Taso Viglas

Resource Type: eBook.

Témata: Combinatorial analysis--Data processing--Congr, Computer science--Mathematics--Congresses

Categories: COMPUTERS / Programming / Algorithms, COMPUTERS / Artificial Intelligence / General, COMPUTERS / Software Development & Engineering / Computer Graphics, COMPUTERS / Computer Science, COMPUTERS / Networking / General, MATHEMATICS / Discrete Mathematics

Mixed Powers of Generating Functions

Autoři: Manuel Lladser

Zdroj: Discrete Mathematics & Theoretical Computer Science, Vol DMTCS Proceedings vol. AG,..., Iss Proceedings (2006)

Témata: uniform asymptotic expansions, saddle point method, discrete random structures, airy phenomena, asymptotic enumeration, analytic combinatorics, large powers of generating functions, [info.info-ds] computer science [cs]/data structures and algorithms [cs.ds], [info.info-dm] computer science [cs]/discrete mathematics [cs.dm], [math.math-co] mathematics [math]/combinatorics [math.co], Mathematics, QA1-939

Popis souboru: electronic resource

Relation: https://dmtcs.episciences.org/3501/pdf; https://doaj.org/toc/1365-8050

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

Computing and Combinatorics : 17th Annual International Conference, COCOON 2011, Dallas, TX, USA, August 14-16, 2011. Proceedings

Autoři: Bin Fu Ding-Zhu Du

Resource Type: eBook.

Témata: Computer science--Congresses, Combinatorial analysis--Congresses

Categories: COMPUTERS / Programming / Algorithms, COMPUTERS / Artificial Intelligence / General, COMPUTERS / Software Development & Engineering / Computer Graphics, COMPUTERS / Computer Science, COMPUTERS / Networking / General, MATHEMATICS / Discrete Mathematics

Some exactly solvable models of urn process theory

Autoři: Philippe Flajolet Philippe Dumas Vincent Puyhaubert

Zdroj: Discrete Mathematics & Theoretical Computer Science, Vol DMTCS Proceedings vol. AG,..., Iss Proceedings (2006)

Témata: urn process, [info.info-ds] computer science [cs]/data structures and algorithms [cs.ds], [info.info-dm] computer science [cs]/discrete mathematics [cs.dm], [math.math-co] mathematics [math]/combinatorics [math.co], Mathematics, QA1-939

Popis souboru: electronic resource

Relation: https://dmtcs.episciences.org/3506/pdf; https://doaj.org/toc/1365-8050

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

Walking Cautiously Into the Collatz Wilderness: Algorithmically, Number Theoretically, Randomly

Autoři: Edward G. Belaga Maurice Mignotte

Zdroj: Discrete Mathematics & Theoretical Computer Science, Vol DMTCS Proceedings vol. AG,..., Iss Proceedings (2006)

Témata: discrete dynamical systems, collatz and conway transforms, or collatz problem, 3n+1, pseudo-rundom walks, diophantine approximations, exponential diophantine equations, algorithmic decidability, [info.info-ds] computer science [cs]/data structures and algorithms [cs.ds], [info.info-dm] computer science [cs]/discrete mathematics [cs.dm], [math.math-co] mathematics [math]/combinatorics [math.co], Mathematics, QA1-939

Popis souboru: electronic resource

Relation: https://dmtcs.episciences.org/3512/pdf; https://doaj.org/toc/1365-8050

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