Výsledky vyhledávání - "randomised approximation algorithm"

A Randomised Approximation Algorithm for Counting the Number of Forests in Dense Graphs: A randomised approximation algorithm for counting the number of forests in dense graphs

Autoři: J. D. Annan

Zdroj: Combinatorics, Probability and Computing. 3:273-283

Témata: dense graph, Combinatorial probability, Graph algorithms (graph-theoretic aspects), Graph theory (including graph drawing) in computer science, Analysis of algorithms and problem complexity, 0102 computer and information sciences, counting the number of forests, 15. Life on land, Enumeration in graph theory, randomised approximation algorithm, 01 natural sciences, Trees, randomised approximation scheme

Popis souboru: application/xml

Přístupová URL adresa: https://zbmath.org/690966
https://doi.org/10.1017/s0963548300001188
https://www.cambridge.org/core/journals/combinatorics-probability-and-computing/article/randomised-approximation-algorithm-for-counting-the-number-of-forests-in-dense-graphs/E61A9E98F5191D737931284AE81DF047
https://www.cambridge.org/core/services/aop-cambridge-core/content/view/S0963548300001188
https://dblp.uni-trier.de/db/journals/cpc/cpc3.html#Annan94

A randomised approximation algorithm for the hitting set problem

Autoři: Anand Srivastav Mourad El Ouali Helena Fohlin

Zdroj: Lecture Notes in Computer Science ISBN: 9783642360640

Témata: 0211 other engineering and technologies, 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences, 7. Clean energy

Přístupová URL adresa: http://www.diva-portal.org/smash/record.jsf?pid=diva2:765671
https://oceanrep.geomar.de/27485/
https://www.sciencedirect.com/science/article/pii/S0304397514002515
https://dblp.uni-trier.de/db/journals/tcs/tcs555.html#OualiFS14
http://eprints.uni-kiel.de/27485/
https://doi.org/10.1016/j.tcs.2014.03.029

A Randomised Approximation Algorithm for the Partial Vertex Cover Problem in Hypergraphs

Autoři: Anand Srivastav Mourad El Ouali Helena Fohlin

Zdroj: Lecture Notes in Computer Science ISBN: 9783642348617

Přístupová URL adresa: https://oceanrep.geomar.de/24137/
https://link.springer.com/chapter/10.1007/978-3-642-34862-4_13
https://rd.springer.com/chapter/10.1007%2F978-3-642-34862-4_13
http://eprints.uni-kiel.de/24137/
https://doi.org/10.1007/978-3-642-34862-4_13

A randomised approximation algorithm for the hitting set problem

Autoři: El Ouali, Mourad Fohlin, Helena Srivastav, Anand

Témata: Approximation algorithms; Probabilistic methods; Randomised rounding; Hitting set; Vertex cover; Greedy algorithms, Computer and Information Sciences, Data- och informationsvetenskap, Mathematics, Matematik, Article in journal, info:eu-repo/semantics/article, text

URL: http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-112302
Theoretical Computer Science, 0304-3975, 2014, 555, s. 23-34

A Randomised Approximation Algorithm for the Hitting Set Problem

Autoři: El Ouali, Mourad Fohlin, Helena Srivastav, Anand

Zdroj: Lecture Notes in Computer Science ; WALCOM: Algorithms and Computation ; page 101-113 ; ISSN 0302-9743 1611-3349 ; ISBN 9783642360640 9783642360657

Dostupnost: http://dx.doi.org/10.1007/978-3-642-36065-7_11
http://link.springer.com/content/pdf/10.1007/978-3-642-36065-7_11

Identifying Global Icebergs in Distributed Streams

Autoři: Anceaume, Emmanuelle Busnel, Yann Rivetti, Nicolò a další

Přispěvatelé: Anceaume, Emmanuelle Busnel, Yann Rivetti, Nicolò a další

Zdroj: 2015 IEEE 34th Symposium on Reliable Distributed Systems (SRDS). :266-275

Témata: [INFO.INFO-DC]Computer Science [cs]/Distributed, oblivious adversary, Index Terms—data stream model, [INFO.INFO-DS]Computer Science [cs]/Data Structures and Algorithms [cs.DS], data stream model, [INFO.INFO-DS] Computer Science [cs]/Data Structures and Algorithms [cs.DS], randomised approximation al-gorithm, 02 engineering and technology, [INFO] Computer Science [cs], 16. Peace & justice, Parallel, and Cluster Computing [cs.DC], [INFO.INFO-IT]Computer Science [cs]/Information Theory [cs.IT], generalised coupon collector problem, [INFO.INFO-DC] Computer Science [cs]/Distributed, Parallel, and Cluster Computing [cs.DC], 0202 electrical engineering, electronic engineering, information engineering, Internet, computer network security, distributed algorithms, telecommunication network routing, distributed Denial of Service attack, distributed algorithm, distributed streams, global iceberg attacks, guaranteed error bounds, routers, single-board computer cluster, Algorithm design and analysis, Analytical models, Approximation algorithms, Computational modeling, Computer crime, Monitoring, Servers, performance analysis, randomised approximation algorithm, [INFO.INFO-IT] Computer Science [cs]/Information Theory [cs.IT]

Popis souboru: application/pdf

Přístupová URL adresa: https://hal.archives-ouvertes.fr/hal-01194511/file/PID3812355.pdf
https://hal.science/hal-01141829v1

A Randomised Approximation Algorithm for the Partial Vertex Cover Problem in Hypergraphs.

Autoři: El Ouali, Mourad Fohlin, Helena Srivastav, Anand

Zdroj: Design & Analysis of Algorithms; 2012, p174-187, 14p

A Randomised Approximation Algorithm for Counting the Number of Forests in Dense Graphs.

Autoři: Annan, J. D.

Zdroj: Combinatorics, Probability & Computing; Jul1994, Vol. 3 Issue 3, p273-283, 11p

Geometric bounds on the fastest mixing Markov chain.

Autoři: Olesker-Taylor, Sam Zanetti, Luca

Zdroj: Probability Theory & Related Fields; Apr2024, Vol. 188 Issue 3/4, p1017-1062, 46p

Témata: MARKOV processes, RANDOM walks, PROBABILITY theory

Chromatic polynomials:Zeros, algorithms and computational complexity

Autoři: Huijben, J.

Zdroj: Huijben , J 2023 , ' Chromatic polynomials : Zeros, algorithms and computational complexity ' , Doctor of Philosophy , Universiteit van Amsterdam .

Popis souboru: application/pdf; image/jpeg

Relation: https://dare.uva.nl/personal/pure/en/publications/chromatic-polynomials(ab8091cd-0596-41ea-a03a-a35148a04ff3).html; urn:ISBN:9789493330061

Dostupnost: https://dare.uva.nl/personal/pure/en/publications/chromatic-polynomials(ab8091cd-0596-41ea-a03a-a35148a04ff3).html
https://hdl.handle.net/11245.1/ab8091cd-0596-41ea-a03a-a35148a04ff3
https://pure.uva.nl/ws/files/123708781/Thesis.pdf
https://pure.uva.nl/ws/files/123708783/cover.jpg

Chromatic polynomials: Zeros, algorithms and computational complexity

Autoři: Huijben, J.

Popis souboru: application/pdf; image/jpeg

Přístupová URL adresa: https://dare.uva.nl/personal/pure/en/publications/chromatic-polynomials(ab8091cd-0596-41ea-a03a-a35148a04ff3).html
https://hdl.handle.net/11245.1/ab8091cd-0596-41ea-a03a-a35148a04ff3

Zeros and approximations of Holant polynomials on the complex plane.

Autoři: Casel, Katrin Fischbeck, Philipp Friedrich, Tobias a další

Zdroj: Computational Complexity; 2022, Vol. 31 Issue 2, p1-52, 52p

Byzantine-tolerant uniform node sampling service in large-scale networks.

Autoři: Anceaume, Emmanuelle Busnel, Yann Sericola, Bruno

Zdroj: International Journal of Parallel, Emergent & Distributed Systems. Sep2021, Vol. 36 Issue 5, p412-439. 28p.

Témata: *LARGE scale systems, *DELAY-tolerant networks

A Progressive Search Algorithm for the Minimum Hitting Set Problem.

Alternate Title: Minimum İsabet Kümesi Problemi için Aşamalı Arama Algoritması. (Turkish)

Autoři: Arslan, Hilal Uğurlu, Onur Akram, Vahid Khalilpour a další

Zdroj: Dokuz Eylul University Muhendislik Faculty of Engineering Journal of Science & Engineering / Dokuz Eylül Üniversitesi Mühendislik Fakültesi Fen ve Mühendislik Dergisi; say2021, Vol. 23 Issue 69, p867-874, 8p

Témata: SUBSET selection, SEARCH algorithms, MATHEMATICAL bounds, DATA analysis, ALGORITHMS

Approximation algorithm for the multicovering problem.

Autoři: Gorgi, Abbass El Ouali, Mourad Srivastav, Anand a další

Zdroj: Journal of Combinatorial Optimization; 2021, Vol. 41 Issue 2, p433-450, 18p

Zeros of Holant Problems: Locations and Algorithms.

Autoři: HENG GUO CHAO LIAO PINYAN LU a další

Zdroj: ACM Transactions on Algorithms; Dec2020, Vol. 17 Issue 1, p1-25, 25p

Témata: ALGORITHMS, PHASE transitions, COUNTING, APPROXIMATION algorithms

An approximation algorithm for submodular hitting set problem with linear penalties.

Autoři: Du, Shaojing Gao, Suogang Hou, Bo a další

Zdroj: Journal of Combinatorial Optimization; Nov2020, Vol. 40 Issue 4, p1065-1074, 10p

Computing the Shapley value in allocation problems: approximations and bounds, with an application to the Italian VQR research assessment program.

Autoři: Lupia, Francesco Mendicelli, Angelo Ribichini, Andrea a další

Zdroj: Journal of Experimental & Theoretical Artificial Intelligence; Aug2018, Vol. 30 Issue 4, p505-524, 20p

Témata: ASSIGNMENT problems (Programming), GAME theory, APPROXIMATION algorithms, MATHEMATICAL bounds, ALGORITHMS

Mapping n Grid Points Onto a Square Forces an Arbitrarily Large Lipschitz Constant.

Autoři: Dymond, Michael Kaluža, Vojtěch Kopecká, Eva

Zdroj: Geometric & Functional Analysis; Jun2018, Vol. 28 Issue 3, p589-644, 56p

Témata: LIPSCHITZ spaces, CARTOGRAPHY, ENERGY level densities, MATHEMATICAL functions, LATTICE theory

Cognitive radar sequence design under the spectral compatibility requirements.

Autoři: Ge, Peng Cui, Guolong Karbasi, Seyyed Muhammad a další

Zdroj: IET Radar, Sonar & Navigation (Wiley-Blackwell); May2017, Vol. 11 Issue 5, p759-767, 9p

Témata: CONSTRAINED optimization, REMOTE sensing, QUADRATIC programming, ENVIRONMENTAL mapping, PHASE coding