Výsledky vyhledávání - Theory of computation → Approximation algorithms analysis
-
1
Autoři: a další
Přispěvatelé: a další
Zdroj: Algorithmica. 86:2575-2604
Témata: FOS: Computer and information sciences, flexible graph connectivity, network design, 0211 other engineering and technologies, edge-connectivity of graphs, 0102 computer and information sciences, 02 engineering and technology, Small cuts, 01 natural sciences, Theory of computation → Approximation algorithms analysis, f-connectivity problem, primal-dual method, Edge-connectivity of graphs, Primal-dual method, Minimum cuts, Computer Science - Data Structures and Algorithms, Data Structures and Algorithms (cs.DS), approximation algorithms, Network design, minimum cuts, f-Connectivity problem, Approximation algorithms, Flexible Graph Connectivity, flexible Graph Connectivity, ddc:004, small cuts
Popis souboru: application/pdf
-
2
Autoři:
Přispěvatelé:
Zdroj: Algorithmica. 86:3598-3628
Témata: FOS: Computer and information sciences, Theory of computation → Approximation algorithms analysis phrases Maximum weight matching submodular function maximization streaming matroid matchoid, sublinear and near linear time algorithms, 0211 other engineering and technologies, 2012 ACM Subject Classification Theory of computation → Streaming sublinear and near linear time algorithms, Theory of computation → Approximation algorithms analysis phrases Maximum weight matching, 0102 computer and information sciences, 02 engineering and technology, [INFO] Computer Science [cs], 2012 ACM Subject Classification Theory of computation → Streaming, matchoid, 01 natural sciences, Computer Science - Data Structures and Algorithms, matroid, Data Structures and Algorithms (cs.DS), streaming, submodular function maximization
Popis souboru: application/pdf
Přístupová URL adresa: http://arxiv.org/abs/2107.13071
https://hal.science/hal-03982431v1 -
3
Autoři:
Zdroj: IEEE/ACM Transactions on Networking. 30(4):1865-1878
Témata: computation offloading, decentralized algorithms, Edge computing, game theory, network slicing, resource allocation, Approximation algorithms, Computer games, Heuristic algorithms, Job analysis, Mobile edge computing, Natural resources management, Computational modelling, Decentralized algorithm., Heuristics algorithm, Resource management, Resources allocation, Task analysis, Wireless communications
Popis souboru: print
-
4
Autoři: a další
Přispěvatelé: a další
Zdroj: 30th Annual European Symposium on Algorithms
Leibniz International Proceedings in InformaticsTémata: FOS: Computer and information sciences, Mathematics of computing → Approximation algorithms, exponential approximations, monotone local search, 0211 other engineering and technologies, Mathematics of computing → Probabilistic algorithms, 0102 computer and information sciences, 02 engineering and technology, Computational Complexity (cs.CC), 01 natural sciences, Theory of computation → Approximation algorithms analysis, Computer Science - Computational Complexity, Computer Science - Data Structures and Algorithms, parameterized approximations, Data Structures and Algorithms (cs.DS), ddc:004
Popis souboru: application/pdf
Přístupová URL adresa: http://arxiv.org/abs/2206.13481
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2022.50
http://hdl.handle.net/21.11116/0000-000C-1E71-4
http://hdl.handle.net/21.11116/0000-000C-1E6F-8
http://hdl.handle.net/21.11116/0000-000C-1DA2-D
http://hdl.handle.net/21.11116/0000-000C-1DA4-B -
5
Autoři: a další
Přispěvatelé: a další
Zdroj: Proceeding of the 37th International Symposium on Computational Geometry, SoCG 2021
Témata: Computational Geometry (cs.CG), FOS: Computer and information sciences, Computer Science - Data Structures and Algorithms, Computer Science - Computational Geometry, Data Structures and Algorithms (cs.DS), 0102 computer and information sciences, ddc:004, 01 natural sciences, Theory of computation → Approximation algorithms analysis, Approximation algorithms, two-dimensional knapsack, geometric packing
Popis souboru: application/pdf
Přístupová URL adresa: http://arxiv.org/abs/2103.10406
http://eprints.iisc.ac.in/69046/
https://dblp.uni-trier.de/db/journals/corr/corr2103.html#abs-2103-10406
https://drops.dagstuhl.de/opus/volltexte/2021/13838/pdf/LIPIcs-SoCG-2021-39.pdf/
https://drops.dagstuhl.de/opus/volltexte/2021/13838/
https://research.vu.nl/en/publications/improved-approximation -algorithms -for-2-dimensional-knapsack-pack
https://www.narcis.nl/publication/RecordID/oai%3Aresearch.vu.nl%3Apublications%2F84354690-4f21-4804-a4f2-e3ad3ffe5597
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2021.39 -
6
Autoři: a další
Témata: ddc:004, Min-Plus Convolution, Fine-grained Complexity, Conditional Lower Bounds, DATA processing & computer science, Approximation Schemes, Theory of computation → Approximation algorithms analysis
Popis souboru: application/pdf
-
7
Autoři: a další
Přispěvatelé: a další
Zdroj: Leibniz International Proceedings in Informatics (LIPIcs), 274
31st Annual European Symposium on Algorithms (ESA 2023)Témata: Theory of computation → Approximation algorithms analysis, Theory of computation → Unsupervised learning and clustering, Clustering, K-means, K-means++, Adversarial noise
Popis souboru: application/application/pdf
Přístupová URL adresa: http://hdl.handle.net/20.500.11850/637195
-
8
-
9
Autoři: a další
Přispěvatelé: a další
Témata: FOS: Computer and information sciences, network design, capacitated network design, parametrized algorithms, Steiner cycle problem, 0102 computer and information sciences, 01 natural sciences, Theory of computation → Approximation algorithms analysis, Approximation algorithms, Computer Science - Data Structures and Algorithms, Data Structures and Algorithms (cs.DS), ddc:004, Steiner 2-edge connected subgraphs, approximation algorithms, Network design, Capacitated network design, Parametrized algorithms, Steiner 2-node connected subgraphs
Popis souboru: application/pdf
-
10
Autoři:
Zdroj: Saarbrücken/Wadern : Schloss Dagstuhl - Leibniz-Zentrum für Informatik GmbH, Leibniz international proceedings in informatics 289, 35, [1]-13 (2024). doi:10.4230/LIPICS.STACS.2024.35 ; 41st International Symposium on Theoretical Aspects of Computer Science : STACS 2024, March 12-14, 2024, Clermont-Ferrand, France / edited by Olaf Beyersdorff, Mamadou Moustapha Kanté, Orna Kupferman, Daniel Lokshtanov ; 41st International Symposium on Theoretical Aspects of Computer Science : STACS 2024, March 12-14, 2024, Clermont-Ferrand, France / edited by Olaf Beyersdorff, Mamadou Moustapha Kanté, Orna Kupferman, Daniel Lokshtanov 41. International Symposium on Theoretical Aspects of Computer Science, STACS 2024, Clermont-Ferrand, France, 2024-03-11 - 2024-03-15
Témata: String attractors, Theory of computation → Approximation algorithms analysis, Theory of computation → Data compression, Theory of computation → Problems, reductions and completeness, computational complexity, dictionary compression
Geografické téma: DE
Relation: info:eu-repo/semantics/altIdentifier/isbn/978-3-95977-311-9; info:eu-repo/semantics/altIdentifier/wos/WOS:001300393400035
-
11
Autoři: a další
Přispěvatelé: a další
Zdroj: APPROX/RANDOM ; https://hal.science/hal-03982431 ; APPROX/RANDOM, Aug 2021, Seattle, United States
Témata: 2012 ACM Subject Classification Theory of computation → Streaming sublinear and near linear time algorithms, Theory of computation → Approximation algorithms analysis phrases Maximum weight matching submodular function maximization streaming matroid matchoid, 2012 ACM Subject Classification Theory of computation → Streaming, sublinear and near linear time algorithms, Theory of computation → Approximation algorithms analysis phrases Maximum weight matching, submodular function maximization, streaming, matroid, matchoid, [INFO]Computer Science [cs]
Geografické téma: Seattle, United States
-
12
Autoři:
Přispěvatelé:
Zdroj: Wadern : Schloss Dagstuhl-Leibniz-Zentrum für Informatik GmbH, Leibniz international proceedings in informatics 289, 35, [1]-13 (2024). doi:10.4230/LIPICS.STACS.2024.35
41st International Symposium on Theoretical Aspects of Computer Science : STACS 2024, March 12-14, 2024, Clermont-Ferrand, France / edited by Olaf Beyersdorff, Mamadou Moustapha Kanté, Orna Kupferman, Daniel Lokshtanov
41st International Symposium on Theoretical Aspects of Computer Science : STACS 2024, March 12-14, 2024, Clermont-Ferrand, France / edited by Olaf Beyersdorff, Mamadou Moustapha Kanté, Orna Kupferman, Daniel Lokshtanov41. International Symposium on Theoretical Aspects of Computer Science, STACS 2024, Clermont-Ferrand, France, 2024-03-11-2024-03-14Témata: FOS: Computer and information sciences, Computer Science - Computational Complexity, computational complexity, Theory of computation → Problems, reductions and completeness, ddc:004, Computational Complexity (cs.CC), Theory of computation → Data compression, String attractors, dictionary compression, Theory of computation → Approximation algorithms analysis
Popis souboru: application/pdf
-
13
Autoři: a další
Zdroj: IET Control Theory & Applications, Vol 15, Iss 2, Pp 248-259 (2021)
Témata: Filtering methods in signal processing, Signal processing theory, Interpolation and function approximation (numerical analysis), Markov processes, Control engineering systems. Automatic machinery (General), TJ212-225
Popis souboru: electronic resource
Přístupová URL adresa: https://doaj.org/article/b3dfea75a1b74ae5864014a01212d4f5
-
14
Autoři: a další
Přispěvatelé: a další
Zdroj: 49th EATCS International Conference on Automata, Languages, and Programming
Leibniz International Proceedings in InformaticsTémata: FOS: Computer and information sciences, Hardness of Approximation in P, Fine-grained Complexity Theory, Theory of computation → Problems, reductions and completeness, 0102 computer and information sciences, Computational Complexity (cs.CC), 01 natural sciences, Theory of computation → Approximation algorithms analysis, Computer Science - Computational Complexity, Computer Science - Data Structures and Algorithms, Classification Theorems, Data Structures and Algorithms (cs.DS), ddc:004
Popis souboru: application/pdf
-
15
Autoři: a další
Přispěvatelé: a další
Témata: FOS: Computer and information sciences, 0211 other engineering and technologies, Theory of computation → Discrete optimization, 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences, Theory of computation → Approximation algorithms analysis, Mathematics of computing → Matroids and greedoids, Combinatorial Optimization, Computer Science - Data Structures and Algorithms, Matroid Intersection, Data Structures and Algorithms (cs.DS), ddc:004, Approximation Algorithms
Popis souboru: application/pdf
Přístupová URL adresa: http://arxiv.org/abs/2105.05673
https://arxiv.org/pdf/2105.05673
https://drops.dagstuhl.de/opus/volltexte/2021/14100/
https://arxiv.org/abs/2105.05673
https://drops.dagstuhl.de/opus/volltexte/2021/14100/pdf/LIPIcs-ICALP-2021-31.pdf/
https://dblp.uni-trier.de/db/journals/corr/corr2105.html#abs-2105-05673
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2021.31 -
16
Autoři: a další
Přispěvatelé: a další
Témata: Theory of computation → Parallel computing models, Mathematics of computing → Matroids and greedoids, Combinatorial Optimization, Parallel Algorithms, Theory of computation → Discrete optimization, Matroid Intersection, ddc:004, Theory of computation → Approximation algorithms analysis
Popis souboru: application/pdf
Přístupová URL adresa: https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2022.25
-
17
Computational Learning Theory through a New Lens: Scalability, Uncertainty, Practicality, and beyond
Autoři: Chen Wang
Zdroj: ProQuest LLC. 2024Ph.D. Dissertation, Rutgers The State University of New Jersey, School of Graduate Studies.
Peer Reviewed: N
Page Count: 338
Descriptors: Computation, Learning Theories, Algorithms, Artificial Intelligence, Graphs, Privacy
Přístupová URL adresa: https://gateway.proquest.com/openurl?url_ver=Z39.88-2004&rft_val_fmt=info:ofi/fmt:kev:mtx:dissertation&res_dat=xri:pqm&rft_dat=xri:pqdiss:30993859
-
18
Autoři: a další
Zdroj: Grantee Submission. 2024.
Peer Reviewed: Y
Page Count: 76
Sponsoring Agency: Institute of Education Sciences (ED)
Descriptors: Educational Assessment, Bayesian Statistics, Statistical Inference, Item Response Theory, Educational Testing, Algorithms, Computation, Accuracy, Achievement Tests, Foreign Countries, Secondary School Students, International Assessment, Data Collection, Data Analysis, Data Processing, Evaluation Methods
Assessment and Survey Identifiers: Program for International Student Assessment
IES Funded: Yes
-
19
Autoři: a další
Přispěvatelé: a další
Zdroj: https://hal.science/hal-04143445 ; 2023.
Témata: data-driven wasserstein distributionally robust optimization, optimization under uncertainty, computational complexity, approximability, 2012 ACM Subject Classification Theory of computation → Complexity classes, Mathematics of computing → Combinatorial optimization, Theory of computation → Approximation algorithms analysis phrases distributionally robust optimization, 2012 ACM Subject Classification Theory of computation → Complexity classes Mathematics of computing → Combinatorial optimization Theory of computation → Approximation algorithms analysis phrases distributionally robust optimization, [INFO.INFO-CC]Computer Science [cs]/Computational Complexity [cs.CC]
-
20
Autoři: a další
Zdroj: Grantee Submission. 2020.
Peer Reviewed: Y
Page Count: 56
Sponsoring Agency: National Science Foundation (NSF)
Institute of Education Sciences (ED)Descriptors: Item Response Theory, Mathematics, Statistical Inference, Maximum Likelihood Statistics, Statistical Analysis, Computation, Simulation, Models, Data Analysis
IES Funded: Yes
Full Text Finder 
Nájsť tento článok vo Web of Science