Výsledky vyhledávání - "ACM Subject Classification F.2.2 Nonnumerical Algorithms and Problems"

Combinatorics of Local Search: An Optimal 4-Local Hall's Theorem for Planar Graphs

Autoři: Antunes, Daniel Mathieu, Claire Mustafa, Nabil a další

Přispěvatelé: Antunes, Daniel Mathieu, Claire Mustafa, Nabil a další

Zdroj: Leibniz International Proceedings in Informatics (LIPIcs) ; 25th Annual European Symposium on Algorithms (ESA 2017) ; https://hal.science/hal-01740357 ; 25th Annual European Symposium on Algorithms (ESA 2017), Sep 2017, Vienna, Austria. ⟨10.4230/LIPIcs.ESA.2017.8⟩

Témata: Combinatorial Optimization, Expansion, Hall's Theorem, Local Search, Planar Graphs, ACM Subject Classification F.2.2 Nonnumerical Algorithms and Problems, [SCCO.COMP]Cognitive science/Computer science

Geografické téma: Vienna, Austria

Dostupnost: https://hal.science/hal-01740357
https://hal.science/hal-01740357v1/document
https://hal.science/hal-01740357v1/file/radiuslocalsearch.pdf
https://doi.org/10.4230/LIPIcs.ESA.2017.8

Longest Common Substring with Approximately k Mismatches

Autoři: Starikovskaya, Tatiana Département d'informatique - ENS Paris (DI-ENS) École normale supérieure - Paris (ENS-PSL) a další

Přispěvatelé: Starikovskaya, Tatiana Département d'informatique - ENS Paris (DI-ENS) École normale supérieure - Paris (ENS-PSL) a další

Zdroj: 27th Annual Symposium on Combinatorial Pattern Matching CPM 2016
https://hal.science/hal-03942914
27th Annual Symposium on Combinatorial Pattern Matching CPM 2016, 2016, Warsaw, Poland. ⟨10.4230/LIPIcs.CPM.2016.21⟩

Témata: 1998 ACM Subject Classification F.2.2. Nonnumerical Algorithms and Problems phrases Randomised algorithms string similarity measures longest common substring sketching locality-sensitive hashing, string similarity measures, longest common substring, sketching, locality-sensitive hashing, [INFO]Computer Science [cs]

Geografické téma: Warsaw, Poland

Relation: hal-03942914; https://hal.science/hal-03942914; https://hal.science/hal-03942914/document; https://hal.science/hal-03942914/file/LIPIcs-CPM-2016-21.pdf

Dostupnost: https://hal.science/hal-03942914
https://hal.science/hal-03942914/document
https://hal.science/hal-03942914/file/LIPIcs-CPM-2016-21.pdf
https://doi.org/10.4230/LIPIcs.CPM.2016.21

Solutions of twisted word equations, EDT0L languages, and context-free groups

Autoři: Diekert, V Elder, M

Témata: Conference Proceeding

URL: http://hdl.handle.net/10453/110193
http://purl.org/au-research/grants/arc/DP160100486
Leibniz International Proceedings in Informatics, LIPIcs
10.4230/LIPIcs.ICALP.2017.96
http://purl.org/au-research/grants/arc/DP160100486

Good predictions are worth a few comparisons

Autoři: Auger, Nicolas Nicaud, Cyril Pivoteau, Carine a další

Přispěvatelé: Auger, Nicolas Nicaud, Cyril Pivoteau, Carine a další

Zdroj: Leibniz International Proceedings in Informatics (LIPIcs) ; STACS 2016 ; https://hal.science/hal-01212840 ; STACS 2016, Feb 2016, Orléans, France. pp.12:1-12:14, ⟨10.4230/LIPIcs.STACS.2016.12⟩

Témata: [INFO]Computer Science [cs], [INFO.INFO-DS]Computer Science [cs]/Data Structures and Algorithms [cs.DS], [INFO.INFO-CC]Computer Science [cs]/Computational Complexity [cs.CC], [INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM]

Geografické téma: Orléans, France

Dostupnost: https://hal.science/hal-01212840
https://hal.science/hal-01212840v1/document
https://hal.science/hal-01212840v1/file/aunipi2016-branch-predictions.pdf
https://doi.org/10.4230/LIPIcs.STACS.2016.12

Collaborative Delivery with Energy-Constrained Mobile Robots

Autoři: Bärtschi, Andreas Chalopin, Jérémie Das, Shantanu a další

Přispěvatelé: Bärtschi, Andreas Chalopin, Jérémie Das, Shantanu a další

Zdroj: 23rd International Colloquium on Structural Information and Communication Complexity
https://hal.science/hal-01480368
23rd International Colloquium on Structural Information and Communication Complexity, Jun 2016, Helsinki, Finland. pp.258 - 274, ⟨10.1007/978-3-319-48314-6_17⟩

Témata: delivery, mobile agents, limited battery, resource augmentation, budget, [INFO.INFO-DC]Computer Science [cs]/Distributed, Parallel, and Cluster Computing [cs.DC]

Geografické téma: Helsinki, Finland

Dostupnost: https://hal.science/hal-01480368
https://hal.science/hal-01480368v1/document
https://hal.science/hal-01480368v1/file/Collaborative_Delivery_with_Energy-Constrained_Mobile_Robots.pdf
https://doi.org/10.1007/978-3-319-48314-6_17

Robust routing in urban public transportation: How to find reliable journeys based on past observations.

Autoři: Kateřina Böhmová Matúš Mihalák Tobias Pröger a další

Přispěvatelé: Kateřina Böhmová Matúš Mihalák Tobias Pröger a další

Zdroj: http://drops.dagstuhl.de/opus/volltexte/2013/4242/pdf/4.pdf.

Popis souboru: application/pdf

Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.1074.9073; http://drops.dagstuhl.de/opus/volltexte/2013/4242/pdf/4.pdf

Dostupnost: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.1074.9073
http://drops.dagstuhl.de/opus/volltexte/2013/4242/pdf/4.pdf

testing generalised freeness of words

Autoři: Gawrychowski, Pawel Manea, Florin Nowotka, Dirk a další

Přispěvatelé: Gawrychowski, Pawel Manea, Florin Nowotka, Dirk a další

Zdroj: 31st International Symposium on Theoretical Aspects of Computer Science
Leibniz International Proceedings in Informatics

Témata: Repetition, Pseudo-repetition, ddc:004, Pattern matching, Stringology

Popis souboru: application/pdf

Přístupová URL adresa: https://pure.mpg.de/pubman/faces/ViewItemOverviewPage.jsp?itemId=item_2069477
https://drops.dagstuhl.de/opus/volltexte/2014/4469/pdf/27.pdf
https://drops.dagstuhl.de/opus/volltexte/2014/4469/
http://pubman.mpdl.mpg.de/pubman/item/escidoc:2069477
https://dblp.uni-trier.de/db/conf/stacs/stacs2014.html#GawrychowskiMN14
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2014.337
http://hdl.handle.net/11858/00-001M-0000-0024-24DB-A

Geometric Spanners for Points Inside a Polygonal Domain

Autoři: Mohammad Ali Abam Marjan Adeli Hamid Homapour a další

Přispěvatelé: Mohammad Ali Abam Marjan Adeli Hamid Homapour a další

Zdroj: http://drops.dagstuhl.de/opus/volltexte/2015/5137/pdf/54.pdf.

Popis souboru: application/pdf

Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.1069.2102; http://drops.dagstuhl.de/opus/volltexte/2015/5137/pdf/54.pdf

Dostupnost: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.1069.2102
http://drops.dagstuhl.de/opus/volltexte/2015/5137/pdf/54.pdf

Total space in resolution is at least width squared

Autoři: Bonacina, I.

Zdroj: Leibniz International Proceedings in Informatics, LIPIcs.

Témata: Resolution, Total space, Width, Automata theory, Optical resolving power, Trees (mathematics), Complexity measures, Complexity of proof procedures, K-CNF formulas, Nonnumerical algorithms and problems, Resolution refutation, Subject classification, Computational complexity

Popis souboru: print

Přístupová URL adresa: https://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-207493