Výsledky vyhľadávania - "algorithm engineering"

Swiftly identifying strongly unique k-mers

Autori: Zentgraf, Jens Rahmann, Sven Jens Zentgraf and Sven Rahmann

Prispievatelia: Zentgraf, Jens Rahmann, Sven Jens Zentgraf and Sven Rahmann

Zdroj: Algorithms Mol Biol

Predmety: ddc:004, Hamming distance, parallelization, Research, k-mer, Parallelization, strong uniqueness, algorithm engineering, Strong uniqueness, Algorithm engineering

Popis súboru: application/pdf

Prístupová URL adresa: https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.WABI.2024.15

Exact Minimum Cuts in Hypergraphs at Scale

Autori: Chhabra, Adil Schulz, Christian Uçar, Bora a ďalší

Prispievatelia: Chhabra, Adil Schulz, Christian Uçar, Bora a ďalší

Predmety: [INFO.INFO-DS] Computer Science [cs]/Data Structures and Algorithms [cs.DS], Minimum Cut, Hypergraph Algorithm, Algorithm Engineering

Prístupová URL adresa: https://hal.science/hal-05243769v1

A Comparative Study of Compressed, Learned, and Traditional Indexing Methods for Integer Data

Autori: Lorenzo Bellomo Giuseppe Cianci Luca de Rosa a ďalší

Prispievatelia: Lorenzo Bellomo Giuseppe Cianci Luca de Rosa a ďalší

Predmety: benchmark, indexing data structures, indexing data structures, compression, algorithm engineering, benchmark, ddc:004, algorithm engineering, compression

Popis súboru: application/pdf

Prístupová URL adresa: https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SEA.2025.5
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SEA.2025.5
https://doi.org/10.4230/LIPIcs.SEA.2025.5
https://hdl.handle.net/11382/580213

Improved Dominance Filtering for Unions and Minkowski Sums of Pareto Sets

Autori: Karathanasis, Konstantinos Kontogiannis, Spyros Zaroliagis, Christos a ďalší

Prispievatelia: Karathanasis, Konstantinos Kontogiannis, Spyros Zaroliagis, Christos a ďalší

Predmety: Multi-Dimensional Data Structures, Pareto Sets, FOS: Computer and information sciences, Data Structures and Algorithms, Multi-Objective Optimization, Algorithm Engineering, Data Structures and Algorithms (cs.DS), ddc:004

Popis súboru: application/pdf

Prístupová URL adresa: http://arxiv.org/abs/2508.20689
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2025.59

Concurrent Iterated Local Search for the Maximum Weight Independent Set Problem

Autori: Großmann, Ernestine Langedal, Kenneth Schulz, Christian a ďalší

Prispievatelia: Großmann, Ernestine Langedal, Kenneth Schulz, Christian a ďalší

Predmety: Parallel Computing, Heuristics, Randomized Local Search, Algorithm Engineering, ddc:004, Maximum Weight Independent Set

Popis súboru: application/pdf

Prístupová URL adresa: https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SEA.2025.22

Planar Network Diversion

Autori: Bentert, Matthias Drange, Pål Grønås Fomin, Fedor V. a ďalší

Prispievatelia: Bentert, Matthias Drange, Pål Grønås Fomin, Fedor V. a ďalší

Predmety: Network interdiction, Computational Geometry (cs.CG), FOS: Computer and information sciences, Minimal cuts, Computer Science - Data Structures and Algorithms, Computer Science - Computational Geometry, Data Structures and Algorithms (cs.DS), ddc:004, F.2.2, Bridges, Algorithm engineering

Popis súboru: application/pdf

Prístupová URL adresa: http://arxiv.org/abs/2502.16714
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SEA.2025.6

Exact Algorithms for Minimum Dilation Triangulation

Autori: Fekete, Sándor P. Keldenich, Phillip Perk, Michael a ďalší

Prispievatelia: Fekete, Sándor P. Keldenich, Phillip Perk, Michael a ďalší

Predmety: Computational Geometry (cs.CG), FOS: Computer and information sciences, minimum dilation triangulation, exact algorithms, Computer Science - Computational Geometry, dilation, experimental evaluation, ddc:004, algorithm engineering

Popis súboru: application/pdf

Prístupová URL adresa: http://arxiv.org/abs/2502.18189
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2025.48

Engineering Insights into Biclique Partitions and Fractional Binary Ranks of Matrices

Autori: Ghosal, Angikar Karrenbauer, Andreas Angikar Ghosal and Andreas Karrenbauer

Prispievatelia: Ghosal, Angikar Karrenbauer, Andreas Angikar Ghosal and Andreas Karrenbauer

Predmety: FOS: Computer and information sciences, Computer Science - Data Structures and Algorithms, Algorithm Engineering, Combinatorics of Bipartite Graphs, Data Structures and Algorithms (cs.DS), ddc:004, Linear Programming, Asymptotic Binary Rank

Popis súboru: application/pdf

Prístupová URL adresa: http://arxiv.org/abs/2502.06730
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SEA.2025.18

An Investigation of Machine Learning Solutions to Demonstrate Black Box Software Conformity in Regulated Measuring Instruments

Autori: Levin Ho Marko Esche Martin Nischwitz a ďalší

Zdroj: IEEE Open Journal of Instrumentation and Measurement, Vol 4, Pp 1-13 (2025)

Predmety: Algorithm engineering, automata learning, automatic quality control, functional identification, legal metrology, machine learning, Instruments and machines, QA71-90, Electrical engineering. Electronics. Nuclear engineering, TK1-9971

Popis súboru: electronic resource

Relation: https://ieeexplore.ieee.org/document/11162715/; https://doaj.org/toc/2768-7236

Prístupová URL adresa: https://doaj.org/article/d615fe1e116e466e980eed636cd4a559

Machine Learning Augmented Algorithms for Combinatorial Optimization Problems (Dagstuhl Seminar 24441)

Autori: Ajwani, Deepak Dilkina, Bistra Guns, Tias a ďalší

Prispievatelia: Ajwani, Deepak Dilkina, Bistra Guns, Tias a ďalší

Predmety: Machine Learning, Constraint Solvers, Combinatorial Optimization, Algorithm Engineering, ddc:004

Popis súboru: application/pdf

Prístupová URL adresa: https://drops.dagstuhl.de/entities/document/10.4230/DagRep.14.10.76

Exploring the Potential of JuLeS: A White Box Framework for Local Search Metaheuristics

Autori: Da Ros F Di Gaspero L

Zdroj: Proceedings of the Companion Conference on Genetic and Evolutionary Computation. :191-194

Predmety: Algorithm engineering, Local search, Metaheuristics, Software tools

Prístupová URL adresa: https://hdl.handle.net/11390/1258324
https://doi.org/10.1145/3583133.3590676

Minimum Scan Cover and Variants: Theory and Experiments: Theory and Experiments

Autori: Kevin Buchin Alexander Hill Sándor Fekete a ďalší

Prispievatelia: Kevin Buchin Alexander Hill Sándor Fekete a ďalší

Zdroj: ACM Journal of Experimental Algorithmics. 27:1-28

Predmety: bottleneck, Computational Geometry (cs.CG), FOS: Computer and information sciences, constraint programming, Discrete Mathematics (cs.DM), Mixed-integer programming, 0102 computer and information sciences, Graph scanning, Computational Complexity (cs.CC), 01 natural sciences, Bottleneck, angular metric, FOS: Mathematics, Mathematics - Combinatorics, Constraint programming, algorithm engineering, Approximation, approximation, Algorithm engineering, Energy, Makespan, mixed-integer programming, makespan, Complexity, Computer Science - Computational Complexity, Computer Science - Computational Geometry, Combinatorics (math.CO), ddc:004, Angular metric, complexity, energy, Computer Science - Discrete Mathematics

Popis súboru: application/pdf

Prístupová URL adresa: http://arxiv.org/abs/2103.14599
https://research.tue.nl/en/publications/57b7ab16-e692-47f2-852d-53cc93445c36
https://doi.org/10.4230/LIPIcs.SEA.2021.4
https://arxiv.org/abs/2103.14599
https://drops.dagstuhl.de/opus/volltexte/2021/13776/
https://research.tue.nl/en/publications/minimum-scan-cover-and-variants-theory-and-experiments
https://dblp.uni-trier.de/db/journals/corr/corr2103.html#abs-2103-14599
https://drops.dagstuhl.de/opus/volltexte/2021/13776/pdf/LIPIcs-SEA-2021-4.pdf/
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SEA.2021.4

O’Reach: Even Faster Reachability in Large Graphs: Even faster reachability in large graphs

Autori: Hanauer, Kathrin Schulz, Christian Trummer, Jonathan a ďalší

Prispievatelia: Hanauer, Kathrin Schulz, Christian Trummer, Jonathan a ďalší

Zdroj: ACM Journal of Experimental Algorithmics. 27:1-27

Predmety: graph algorithms, FOS: Computer and information sciences, Static graphs, static graphs, Algorithm Engineering, Graph Algorithms, Reachability, 02 engineering and technology, 102031 Theoretische Informatik, Reachability Index, reachability index, 102031 Theoretical computer science, Reachability index, Computer Science - Data Structures and Algorithms, 0202 electrical engineering, electronic engineering, information engineering, Data Structures and Algorithms (cs.DS), ddc:004, algorithm engineering, Graph algorithms, Algorithm engineering, Static Graphs

Popis súboru: application/pdf

Prístupová URL adresa: http://arxiv.org/abs/2008.10932
https://ucrisportal.univie.ac.at/de/publications/35e68b82-0d6a-4a15-ba84-656ff55b64a9
https://doi.org/10.1145/3556540
https://phaidra.univie.ac.at/o:2085875
https://hdl.handle.net/11353/10.2085875
https://doi.org/10.1145/3556540
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SEA.2021.13

ULTRA: Unlimited Transfers for Efficient Multimodal Journey Planning

Autori: Moritz Baum Valentin Buchhold Jonas Sauer a ďalší

Zdroj: Transportation Science, 57 (6), 1403-1719

Predmety: ddc:004, journey planning, 11. Sustainability, DATA processing & computer science, 05 social sciences, 0211 other engineering and technologies, 02 engineering and technology, algorithm engineering, 0503 education, public transit

Popis súboru: application/pdf

Mathematical models to analyze Lua hybrid tables

Autori: Conrado Martínez Cyril Nicaud Pablo Rotondo

Zdroj: UPCommons. Portal del coneixement obert de la UPC
Universitat Politècnica de Catalunya (UPC)

Predmety: Àrees temàtiques de la UPC::Matemàtiques i estadística, Data structures, Probabilistic analysis of algorithms, Lua, Àrees temàtiques de la UPC::Informàtica, Hash tables, Algorithm engineering

Popis súboru: application/pdf

Prístupová URL adresa: https://hdl.handle.net/2117/441913
https://doi.org/10.1016/j.tcs.2025.115264

Two-level massive string dictionaries

Autori: Ferragina P. Rotundo M. Vinciguerra G. a ďalší

Prispievatelia: Ferragina P. Rotundo M. Vinciguerra G. a ďalší

Predmety: String dictionary problem, Trie data structure, String compression, Algorithm engineering, Key-value stores

Popis súboru: STAMPA

Relation: info:eu-repo/semantics/altIdentifier/wos/WOS:001357313500001; volume:128; numberofpages:14; journal:INFORMATION SYSTEMS; https://hdl.handle.net/11382/575792; https://dx.doi.org/10.1016/j.is.2024.102490

Dostupnosť: https://hdl.handle.net/11382/575792
https://doi.org/10.1016/j.is.2024.102490

Minimum Partition into Plane Subgraphs: The CG:SHOP Challenge 2022: Minimum partition into plane subgraphs: the CG:SHOP challenge 2022

Autori: Sándor P. Fekete Phillip Keldenich Dominik Krupke a ďalší

Zdroj: ACM Journal of Experimental Algorithmics. 28:1-13

Predmety: Computational Geometry (cs.CG), FOS: Computer and information sciences, 0211 other engineering and technologies, 0102 computer and information sciences, 02 engineering and technology, intersection graphs, 01 natural sciences, CG:SHOP, Computer Science - Data Structures and Algorithms, computational geometry, graph coloring, Computer Science - Computational Geometry, geometric optimization, Data Structures and Algorithms (cs.DS), F.2.2, algorithm engineering, plane subgraphs, Algorithms in computer science

Popis súboru: application/xml

Prístupová URL adresa: http://arxiv.org/abs/2203.07444
https://zbmath.org/7887807
https://doi.org/10.1145/3604907

Algorithms for art gallery illumination

Autori: Ernestus, Maximilian Friedrichs, Stephan Hemmer, Michael a ďalší

Zdroj: Journal of Global Optimization. 68(1):23-45

Predmety: Art gallery problem, Fading, Computational geometry, Linear program, Non-linear program, Lipschitz function, Algorithm engineering

Popis súboru: electronic

Prístupová URL adresa: https://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-137382
https://liu.diva-portal.org/smash/get/diva2:1096697/FULLTEXT01.pdf

The PACE 2024 parameterized algorithms and computational experiments challenge: one-sided crossing minimization: One-Sided Crossing Minimization

Autori: Kindermann, Philipp Klute, Fabian Maximilian Terziadis, Soeren a ďalší

Prispievatelia: Kindermann, Philipp Klute, Fabian Maximilian Terziadis, Soeren a ďalší

Zdroj: UPCommons. Portal del coneixement obert de la UPC
Universitat Politècnica de Catalunya (UPC)

Predmety: Àrees temàtiques de la UPC::Matemàtiques i estadística, One-Sided Crossing Minimization, FPT, Crossing minimization, One-sided crossing minimization, Algorithm Engineering, Parameterization, Heuristic, Optimization algorithms, Parameterized problems, Parameterized algorithm, Heuristics, Heuristic algorithms, ddc:004, Computational experiment, Consensus algorithm, Algorithm engineering, Exact algorithms, Minimization problems, Àrees temàtiques de la UPC::Informàtica::Informàtica teòrica

Popis súboru: application/pdf

Prístupová URL adresa: https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2024.26
https://hdl.handle.net/2117/422322
https://research.tue.nl/en/publications/the-pace-2024-parameterized-algorithms-and-computational-experime
https://doi.org/10.4230/lipics.ipec.2024.26

Engineering Nearly Linear-time Algorithms for Small Vertex Connectivity

Autori: Yingchareonthawornchai Sorrachai Franck, Max a ďalší

Prispievatelia: Yingchareonthawornchai Sorrachai Franck, Max a ďalší

Zdroj: SEA

Predmety: ta113, FOS: Computer and information sciences, sublinear algorithms, engineering, Sublinear Algorithms, Algorithm Engineering, 0102 computer and information sciences, 01 natural sciences, Computer Science - Data Structures and Algorithms, Data Structures and Algorithms (cs.DS), ddc:004, Algorithm , algorithmic graph theory, Algorithmic Graph Theory

Popis súboru: application/pdf

Prístupová URL adresa: http://arxiv.org/abs/2103.15703
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SEA.2021.1
https://aaltodoc.aalto.fi/handle/123456789/118483
https://aaltodoc.aalto.fi/handle/123456789/108573