咨询与建议

限定检索结果

文献类型

  • 19 篇 期刊文献
  • 10 篇 会议

馆藏范围

  • 29 篇 电子文献
  • 0 种 纸本馆藏

日期分布

学科分类号

  • 25 篇 工学
    • 21 篇 计算机科学与技术...
    • 6 篇 软件工程
    • 2 篇 电气工程
    • 2 篇 信息与通信工程
    • 1 篇 测绘科学与技术
    • 1 篇 生物工程
  • 15 篇 理学
    • 9 篇 数学
    • 3 篇 生物学
    • 2 篇 物理学
    • 1 篇 科学技术史(分学科...
    • 1 篇 统计学(可授理学、...
  • 4 篇 法学
    • 4 篇 法学
  • 2 篇 管理学
    • 2 篇 管理科学与工程(可...
  • 1 篇 哲学
    • 1 篇 哲学
  • 1 篇 教育学
    • 1 篇 教育学
  • 1 篇 文学
    • 1 篇 新闻传播学

主题

  • 29 篇 experimental alg...
  • 5 篇 algorithm engine...
  • 4 篇 graph algorithms
  • 4 篇 sorting
  • 3 篇 computing with u...
  • 3 篇 fault injection
  • 3 篇 algorithms
  • 3 篇 performance eval...
  • 3 篇 memory models
  • 3 篇 memory faults
  • 2 篇 d-wave
  • 2 篇 parallel algorit...
  • 2 篇 performance
  • 2 篇 journey planning
  • 2 篇 data streams
  • 2 篇 graph spanners
  • 2 篇 statistical anal...
  • 2 篇 network analysis
  • 2 篇 quantum annealin...
  • 1 篇 minimum spanning...

机构

  • 4 篇 univ roma la sap...
  • 2 篇 univ rostock ins...
  • 2 篇 univ aquila dept...
  • 2 篇 univ roma tor ve...
  • 2 篇 univ roma la sap...
  • 2 篇 univ roma la sap...
  • 1 篇 virginia polytec...
  • 1 篇 rey juan carlos ...
  • 1 篇 ohio state univ ...
  • 1 篇 humboldt univ de...
  • 1 篇 univ fed flumine...
  • 1 篇 univ ottawa dept...
  • 1 篇 univ palermo dip...
  • 1 篇 dipartimento di ...
  • 1 篇 department of co...
  • 1 篇 univ montreal de...
  • 1 篇 princess margare...
  • 1 篇 univ passau fac ...
  • 1 篇 d wave syst inc ...
  • 1 篇 amherst coll amh...

作者

  • 5 篇 italiano giusepp...
  • 4 篇 d'emidio mattia
  • 3 篇 finocchi irene
  • 3 篇 ferraro-petrillo...
  • 2 篇 himmelspach jan
  • 2 篇 frigioni daniele
  • 2 篇 mcgeoch catherin...
  • 2 篇 demetrescu camil
  • 2 篇 franciosa paolo ...
  • 2 篇 ausiello giorgio
  • 2 篇 ribichini andrea
  • 1 篇 von looz moritz
  • 1 篇 ramakrishnan n
  • 1 篇 resende mauricio...
  • 1 篇 tzovas charilaos
  • 1 篇 sankoff d.
  • 1 篇 meyerhenke henni...
  • 1 篇 bartz-beielstein...
  • 1 篇 fernandez proces...
  • 1 篇 ewald roland

语言

  • 28 篇 英文
  • 1 篇 其他
检索条件"主题词=experimental algorithmics"
29 条 记 录,以下是1-10 订阅
排序:
Note on generalization in experimental algorithmics
收藏 引用
ACM TRANSACTIONS ON MATHEMATICAL SOFTWARE 2000年 第4期26卷 568-580页
作者: Ramakrishnan, N Valdés-Pérez, RE Virginia Polytech Inst & State Univ Dept Comp Sci Blacksburg VA 24061 USA Carnegie Mellon Univ Dept Comp Sci Pittsburgh PA 15213 USA
A recurring theme in mathematical software evaluation is the generalization of rankings of algorithms on test problems to build knowledge-based recommender systems for algorithm selection. A key issue is to profile al... 详细信息
来源: 评论
How experimental algorithmics can benefit from Mayo's extensions to Neyman-Pearson theory of testing
收藏 引用
SYNTHESE 2008年 第3期163卷 385-396页
作者: Bartz-Beielstein, Thomas Cologne Univ Appl Sci Fac Comp Sci & Engn Sci D-51643 Gummersbach Germany
Although theoretical results for several algorithms in many application domains were presented during the last decades, not all algorithms can be analyzed fully theoretically. Experimentation is necessary. The analysi... 详细信息
来源: 评论
Guidelines for experimental algorithmics: A Case Study in Network Analysis
收藏 引用
ALGORITHMS 2019年 第7期12卷 127-127页
作者: Angriman, Eugenio van der Grinten, Alexander von Looz, Moritz Meyerhenke, Henning Noellenburg, Martin Predari, Maria Tzovas, Charilaos Humboldt Univ Dept Comp Sci D-10099 Berlin Germany TU Wien Inst Log & Computat Algorithms & Complex Grp A-1040 Vienna Austria
The field of network science is a highly interdisciplinary area;for the empirical analysis of network data, it draws algorithmic methodologies from several research fields. Hence, research procedures and descriptions ... 详细信息
来源: 评论
On Mining Dynamic Graphs for k Shortest Paths  16th
On Mining Dynamic Graphs for k Shortest Paths
收藏 引用
16th International Conference on Social Networks Analysis and Mining
作者: D'Ascenzo, Andrea D'Emidio, Mattia Luiss Univ Rome Italy Univ Aquila Laquila Italy
Mining graphs, upon query, for k shortest paths between vertex pairs is a prominent primitive to support several analytics tasks on complex networked datasets. The state-of-the-art method to implement this primitive i... 详细信息
来源: 评论
Graph Spanners in the Streaming Model: An experimental Study
收藏 引用
ALGORITHMICA 2009年 第2期55卷 346-374页
作者: Ausiello, Giorgio Demetrescu, Camil Franciosa, Paolo G. Italiano, Giuseppe F. Ribichini, Andrea Univ Roma La Sapienza Dipartimento Informat & Sistemist I-00185 Rome Italy Univ Roma La Sapienza Dipartimento Stat Probabilita & Stat Applicate I-00185 Rome Italy
This article reports the results of an extensive experimental analysis of efficient algorithms for computing graph spanners in the data streaming model, where an (alpha, beta)-spanner of a graph G is a subgraph S subs... 详细信息
来源: 评论
An experimental evaluation of refinement techniques for the subgraph isomorphism backtracking algorithms
收藏 引用
OPEN COMPUTER SCIENCE 2020年 第1期11卷 33-42页
作者: Mihelic, Jurij Cibej, Uros Univ Ljubljana Fac Comp & Informat Sci Vecna Pot 113 Ljubljana 1000 Slovenia
In this paper, we study a well-known computationally hard problem, called the subgraph isomorphism problem where the goal is for a given pattern and target graphs to determine whether the pattern is a sub graph of the... 详细信息
来源: 评论
Graph Spanners in the Streaming Model: An experimental Study
Graph Spanners in the Streaming Model: An Experimental Study
收藏 引用
15th Annual European Symposium on Algorithms (ESA 2007)
作者: Ausiello, Giorgio Demetrescu, Camil Franciosa, Paolo G. Italiano, Giuseppe F. Ribichini, Andrea Univ Roma La Sapienza Dipartimento Informat & Sistemist I-00185 Rome Italy Univ Roma La Sapienza Dipartimento Stat Probabilita & Stat Applicate I-00185 Rome Italy
This article reports the results of an extensive experimental analysis of efficient algorithms for computing graph spanners in the data streaming model, where an (alpha, beta)-spanner of a graph G is a subgraph S subs... 详细信息
来源: 评论
A unified framework to experiment with algorithm optimality and efficiency
收藏 引用
COMPUTER APPLICATIONS IN ENGINEERING EDUCATION 2021年 第6期29卷 1793-1810页
作者: Angel Velazquez-Iturbide, J. Rey Juan Carlos Univ Higher Tech Sch Comp Engn C Tulipan S-N Madrid 28933 Spain
It is common in algorithm courses to assess the correctness of algorithms via testing as well as conducting experiments to measure their run-time performance. However, two severe problems must be addressed: both activ... 详细信息
来源: 评论
The Price of Resiliency: a Case Study on Sorting with Memory Faults
收藏 引用
ALGORITHMICA 2009年 第4期53卷 597-620页
作者: Ferraro-Petrillo, Umberto Finocchi, Irene Italiano, Giuseppe F. Univ Roma La Sapienza Dipartimento Stat Probabilita & Stat Applicate I-00185 Rome Italy Univ Roma La Sapienza Dipartimento Informat I-00198 Rome Italy Univ Roma Tor Vergata Dipartimento Informat Sistemi & Prod I-00133 Rome Italy
We address the problem of sorting in the presence of faults that may arbitrarily corrupt memory locations, and investigate the impact of memory faults both on the correctness and on the running times of mergesort-base... 详细信息
来源: 评论
Restart strategies for GRASP with path-relinking heuristics
收藏 引用
OPTIMIZATION LETTERS 2011年 第3期5卷 467-478页
作者: Resende, Mauricio G. C. Ribeiro, Celso C. AT&T Labs Res Florham Pk NJ 07932 USA Univ Fed Fluminense BR-24210240 Niteroi RJ Brazil
GRASP with path-relinking is a hybrid metaheuristic, or stochastic local search (Monte Carlo) method, for combinatorial optimization. A restart strategy in GRASP with path-relinking heuristics is a set of iterations {... 详细信息
来源: 评论