Suchergebnisse - "experimental algorithms"

Temporal betweenness centrality on shortest walks variants

Autoren: Mehdi Naima

Quelle: Applied Network Science, Vol 10, Iss 1, Pp 1-25 (2025)

Schlagwörter: Graph algorithms, Experimental algorithms, Betweenness centrality, Temporal graphs, Shortest paths, Time centrality, Applied mathematics. Quantitative methods, T57-57.97

Dateibeschreibung: electronic resource

Relation: https://doaj.org/toc/2364-8228

Zugangs-URL: https://doaj.org/article/7b02967f07754eaba4d3034132e27c25

Efficient Exact Online String Matching Through Linked Weak Factors

Autoren: Matthew N. Palmer Simone Faro Stefano Scafiti et al.

Weitere Verfasser: Matthew N. Palmer Simone Faro Stefano Scafiti et al.

Schlagwörter: String matching, text processing, weak recognition, hashing, experimental algorithms, design and analysis of algorithms, design and analysis of algorithms, experimental algorithms, String matching, text processing, ddc:004, weak recognition, hashing

Dateibeschreibung: application/pdf

Zugangs-URL: https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SEA.2024.24
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SEA.2024.24
https://hdl.handle.net/20.500.11769/641810
https://doi.org/10.4230/lipics.sea.2024.24

Scheduling periodic messages on a shared link without buffering

Autoren: Maël Guiraud Yann Strozecki Données et algorithmes pour une ville intelligente et durable - DAVID (DAVID) et al.

Weitere Verfasser: Maël Guiraud Yann Strozecki Données et algorithmes pour une ville intelligente et durable - DAVID (DAVID) et al.

Quelle: Journal of Scheduling. 27:461-484

Schlagwörter: Randomized algorithm, Experimental algorithms, Greedy algorithm, C-RAN, [INFO]Computer Science [cs], Periodic scheduling

Minimum Spanning Tree under Explorable Uncertainty in Theory and Experiments

Autoren: Focke, Jacob Megow, Nicole Meißner, Julie et al.

Weitere Verfasser: Focke, Jacob Megow, Nicole Meißner, Julie et al.

Quelle: ACM Journal of Experimental Algorithmics. 25:1-20

Schlagwörter: MST, competitive ratio, experimental algorithms, 0102 computer and information sciences, ddc:004, 16. Peace & justice, explorable uncertainty, 01 natural sciences

Dateibeschreibung: application/pdf

Zugangs-URL: https://drops.dagstuhl.de/opus/volltexte/2017/7620/pdf/LIPIcs-SEA-2017-22.pdf
https://drops.dagstuhl.de/opus/volltexte/2017/7620/pdf/LIPIcs-SEA-2017-22.pdf/
https://drops.dagstuhl.de/opus/volltexte/2017/7620/
https://doi.org/10.4230/LIPIcs.SEA.2017.22
https://dblp.uni-trier.de/db/conf/wea/sea2017.html#FockeMM17
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SEA.2017.22

The order-preserving pattern matching problem in practice

Autoren: Cantone D. Faro S. Kulekci M. O.

Quelle: Discrete Applied Mathematics. 274:11-25

Schlagwörter: 0202 electrical engineering, electronic engineering, information engineering, Approximate text analysis, Experimental algorithms, Filtering algorithms, Text processing, 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences

Dateibeschreibung: application/pdf

Zugangs-URL: https://www.sciencedirect.com/science/article/abs/pii/S0166218X18305705
http://www.sciencedirect.com/science/article/pii/S0166218X18305705
https://dblp.uni-trier.de/db/journals/dam/dam274.html#CantoneFK20
https://hdl.handle.net/20.500.11769/373769
https://doi.org/10.1016/j.dam.2018.10.023

Improved characters distance sampling for online and offline text searching

Autoren: Pavone, A

Schlagwörter: Settore INF/01 - Informatica, Experimental algorithms, Text processing, String matching

Zugangs-URL: https://hdl.handle.net/10447/640839

Improved characters distance sampling for online and offline text searching

Autoren: Faro S. Marino F. P. Pavone A. et al.

Weitere Verfasser: Faro S. Marino F. P. Pavone A. et al.

Schlagwörter: Experimental algorithms, String matching, Text processing, Settore INF/01 - Informatica

Relation: info:eu-repo/semantics/altIdentifier/wos/WOS:000926027600001; volume:946; numberofpages:18; journal:THEORETICAL COMPUTER SCIENCE; https://hdl.handle.net/10447/640839

Verfügbarkeit: https://hdl.handle.net/10447/640839
https://doi.org/10.1016/j.tcs.2022.12.034

A Parallel Batch-Dynamic Data Structure for the Closest Pair Problem

Autoren: Wang, Yiqiu Yu, Shangdi Gu, Yan et al.

Weitere Verfasser: Wang, Yiqiu Yu, Shangdi Gu, Yan et al.

Schlagwörter: Closest Pair, Parallel Algorithms, Dynamic Algorithms, Experimental Algorithms

Dateibeschreibung: application/pdf

Relation: Is Part Of LIPIcs, Volume 189, 37th International Symposium on Computational Geometry (SoCG 2021); https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2021.60

Verfügbarkeit: https://doi.org/10.4230/LIPIcs.SoCG.2021.60
https://nbn-resolving.org/urn:nbn:de:0030-drops-138594
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2021.60

The Range Automaton: An Efficient Approach to Text-Searching

Autoren: Faro S. Scafiti S.

Quelle: Lecture Notes in Computer Science ISBN: 9783030850876

Schlagwörter: Experimental algorithms, Text processing, 0202 electrical engineering, electronic engineering, information engineering, String matching, 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences, Automata, Design and analysis of algorithms

Zugangs-URL: https://rd.springer.com/chapter/10.1007/978-3-030-85088-3_8
https://dblp.uni-trier.de/db/conf/cwords/words2021.html#FaroS21
https://link.springer.com/chapter/10.1007/978-3-030-85088-3_8

New Instances for Maximum Weight Independent Set From a Vehicle Routing Application

Autoren: Dong, Yuanyuan Goldberg, Andrew V. Noe, Alexander et al.

Quelle: Dong , Y , Goldberg , A V , Noe , A , Parotsidis , N , Resende , M G C & Spaen , Q 2021 , ' New Instances for Maximum Weight Independent Set From a Vehicle Routing Application ' , Operations Research Forum , vol. 2 , no. 4 , 48 . https://doi.org/10.1007/s43069-021-00084-x

Schlagwörter: Experimental algorithms, Maximum weight independent set, Problem instances

Dateibeschreibung: application/pdf

Verfügbarkeit: https://researchprofiles.ku.dk/da/publications/3bed8fdd-357b-49bc-8807-3c7d872fb855
https://doi.org/10.1007/s43069-021-00084-x
https://curis.ku.dk/ws/files/306686570/Dong2021_Article_NewInstancesForMaximumWeightIn.pdf

Bit-Layers Text Encoding for Efficient Text Processing

Autoren: Cantone Domenico Faro Simone Scafiti Stefano

Schlagwörter: representation, 05 social sciences, 0202 electrical engineering, electronic engineering, information engineering, Text processing, experimental algorithms, 02 engineering and technology, 0509 other social sciences

Dateibeschreibung: application/pdf

Zugangs-URL: http://ceur-ws.org/Vol-2568/
https://hdl.handle.net/20.500.11769/497295

A Parallel Batch-Dynamic Data Structure for the Closest Pair Problem

Autoren: Wang, Yiqiu Yu, Shangdi Gu, Yan et al.

Weitere Verfasser: Wang, Yiqiu Yu, Shangdi Gu, Yan et al.

Schlagwörter: Computational Geometry (cs.CG), FOS: Computer and information sciences, Closest Pair, Experimental Algorithms, 0102 computer and information sciences, 02 engineering and technology, Dynamic Algorithms, 01 natural sciences, Parallel Algorithms, Computer Science - Data Structures and Algorithms, 0202 electrical engineering, electronic engineering, information engineering, Computer Science - Computational Geometry, Data Structures and Algorithms (cs.DS), ddc:004, F.2.2

Dateibeschreibung: application/pdf

Zugangs-URL: http://arxiv.org/abs/2010.02379
https://drops.dagstuhl.de/opus/volltexte/2021/13859/
https://doi.org/10.4230/LIPIcs.SoCG.2021.60
https://dblp.uni-trier.de/db/journals/corr/corr2010.html#abs-2010-02379
https://drops.dagstuhl.de/opus/volltexte/2021/13859/pdf/LIPIcs-SoCG-2021-60.pdf/
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2021.60

Flexible and Efficient Algorithms for Abelian Matching in Genome Sequence

Autoren: Faro S. Pavone A.

Quelle: Lecture Notes in Computer Science ISBN: 9783030179373

Schlagwörter: Approximate string matching, Experimental algorithms, 0202 electrical engineering, electronic engineering, information engineering, 0102 computer and information sciences, 02 engineering and technology, Abelian matching jumbled matching, 01 natural sciences

Dateibeschreibung: application/pdf

Zugangs-URL: https://link.springer.com/chapter/10.1007%2F978-3-030-17938-0_28
https://dblp.uni-trier.de/db/conf/iwbbio/iwbbio2019-1.html#FaroP19a
https://rd.springer.com/chapter/10.1007/978-3-030-17938-0_28
https://doi.org/10.1007/978-3-030-17938-0_28
https://link.springer.com/10.1007/978-3-030-17938-0_28
https://www.springer.com/series/558
https://doi.org/10.1007/978-3-030-17938-0_28
https://hdl.handle.net/20.500.11769/365846

Improved and self-tuned occurrence heuristics

Autoren: CANTONE, Domenico FARO, SIMONE

Quelle: Journal of Discrete Algorithms. 28:73-84

Schlagwörter: Experimental algorithms, Frequency of characters, Occurrence heuristics, String matching, Text-processing, Tuned-search approach, 0202 electrical engineering, electronic engineering, information engineering, 0102 computer and information sciences, 02 engineering and technology, Text-processing, Tuned-search, 01 natural sciences

Dateibeschreibung: application/pdf

Zugangs-URL: https://www.stringology.org/event/2013/psc13p09_presentation.pdf
https://dblp.uni-trier.de/db/journals/jda/jda28.html#CantoneF14a
https://www.sciencedirect.com/science/article/abs/pii/S1570866714000501
https://www.sciencedirect.com/science/article/pii/S1570866714000501
http://www.stringology.org/event/2013/p09.html
https://hdl.handle.net/20.500.11769/75212

Minimum Spanning Tree under Explorable Uncertainty in Theory and Experiments

Autoren: Focke, Jacob Megow, Nicole Meißner, Julie et al.

Weitere Verfasser: Focke, Jacob Megow, Nicole Meißner, Julie et al.

Schlagwörter: MST, explorable uncertainty, competitive ratio, experimental algorithms

Dateibeschreibung: application/pdf

Relation: Is Part Of LIPIcs, Volume 75, 16th International Symposium on Experimental Algorithms (SEA 2017); https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SEA.2017.22

Verfügbarkeit: https://doi.org/10.4230/LIPIcs.SEA.2017.22
https://nbn-resolving.org/urn:nbn:de:0030-drops-76202
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SEA.2017.22

Distance-Preserving Approximations of Polygonal Paths

Autoren: Michiel Smid Giri Narasimhan Joachim Gudmundsson

Quelle: Lecture Notes in Computer Science ISBN: 9783540206804

Schlagwörter: Control and Optimization, 0211 other engineering and technologies, 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences, Computer Science Applications, Computational Mathematics, Well-separated pair decomposition, Path simplification, Computational Theory and Mathematics, Experimental algorithms, t-spanners, 0202 electrical engineering, electronic engineering, information engineering, Geometry and Topology

Zugangs-URL: https://research.tue.nl/en/publications/95b66b9a-4316-4b16-a046-ea84e6342dca
https://doi.org/10.1007/978-3-540-24597-1_19
https://core.ac.uk/display/24698137
https://link.springer.com/content/pdf/10.1007%2F978-3-540-24597-1_19.pdf
https://dblp.uni-trier.de/db/conf/fsttcs/fsttcs2003.html#GudmundssonNS03
https://link.springer.com/chapter/10.1007/978-3-540-24597-1_19

Fast and flexible packed string matching

Autoren: FARO, SIMONE KULEKCI O. M.

Quelle: Journal of Discrete Algorithms. 28:61-72

Schlagwörter: Information Retrieval, 0202 electrical engineering, electronic engineering, information engineering, Text Algorithms, Experimental Algorithms, 0102 computer and information sciences, 02 engineering and technology, Online Searching, Exact String Matching, 01 natural sciences

Dateibeschreibung: application/pdf

AN EXPERIMENTAL COMPARISON OF BIASED AND UNBIASED RANDOM-KEY GENETIC ALGORITHMS

Autoren: Gonçalves, José Fernando Resende, Mauricio G.C. Toso, Rodrigo F.

Quelle: Pesquisa Operacional v.34 n.2 2014
Pesquisa operacional
Sociedade Brasileira de Pesquisa Operacional (SOBRAPO)
instacron:SOBRAPO
Pesquisa Operacional, Volume: 34, Issue: 2, Pages: 143-164, Published: AUG 2014

Schlagwörter: random keys, metaheuristics, biased random-key genetic algorithm, genetic algorithm, 0211 other engineering and technologies, 0202 electrical engineering, electronic engineering, information engineering, experimental algorithms, combinatorial optimization, heuristics, 02 engineering and technology, 16. Peace & justice

Dateibeschreibung: text/html

Zugangs-URL: http://www.scielo.br/pdf/pope/v34n2/0101-7438-pope-34-02-0143.pdf
https://core.ac.uk/display/23746387
https://www.scielo.br/scielo.php?pid=S0101-74382014000200143&script=sci_arttext
https://www.scielo.br/scielo.php?pid=S0101-74382014000200143&script=sci_arttext&tlng=pt
http://mauricio.resende.info/doc/brkga-vs-rkga-long.pdf
https://paperity.org/p/189741300/an-experimental-comparison-of-biased-and-unbiased-random-key-genetic-algorithms
https://www.scielo.br/scielo.php?script=sci_arttext&pid=S0101-74382014000200143
http://old.scielo.br/scielo.php?script=sci_arttext&pid=S0101-74382014000200143
http://www.scielo.br/scielo.php?script=sci_arttext&pid=S0101-74382014000200143&lng=en&tlng=en

Faster Betweenness Centrality Based on Data Structure Experimentation

Autoren: David A. Bader Oded Green

Quelle: Procedia Computer Science. 18:399-408

Schlagwörter: Parallel algorithms, Betweenness Centrality, Experimental algorithms, 0202 electrical engineering, electronic engineering, information engineering, Optimizations, 02 engineering and technology, Graph algorithms

Zugangs-URL: https://www.sciencedirect.com/science/article/abs/pii/S1877050913003463
https://www.sciencedirect.com/science/article/pii/S1877050913003463
https://dblp.uni-trier.de/db/conf/iccS/iccS2013.html#GreenB13
https://core.ac.uk/display/82739164

An Experimental Comparison of Speed Scaling Algorithms with Deadline Feasibility Constraints

Autoren: Abousamra, Ahmed Bunde, David P. Pruhs, Kirk et al.

Weitere Verfasser: Abousamra, Ahmed Bunde, David P. Pruhs, Kirk et al.

Schlagwörter: Scheduling, Speed Scaling, Experimental Algorithms, Power Management

Dateibeschreibung: application/pdf

Relation: Is Part Of Dagstuhl Seminar Proceedings, Volume 10261, Algorithm Engineering (2010); https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.10261.3

Verfügbarkeit: https://doi.org/10.4230/DagSemProc.10261.3
https://nbn-resolving.org/urn:nbn:de:0030-drops-27971
https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.10261.3