咨询与建议

限定检索结果

文献类型

  • 90 篇 期刊文献
  • 57 篇 会议
  • 2 篇 学位论文

馆藏范围

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

日期分布

学科分类号

  • 131 篇 工学
    • 116 篇 计算机科学与技术...
    • 46 篇 软件工程
    • 9 篇 电气工程
    • 7 篇 控制科学与工程
    • 6 篇 信息与通信工程
    • 4 篇 交通运输工程
    • 2 篇 测绘科学与技术
    • 1 篇 机械工程
    • 1 篇 仪器科学与技术
    • 1 篇 电子科学与技术(可...
    • 1 篇 化学工程与技术
    • 1 篇 生物工程
  • 59 篇 理学
    • 56 篇 数学
    • 3 篇 生物学
    • 1 篇 化学
    • 1 篇 系统科学
  • 18 篇 管理学
    • 17 篇 管理科学与工程(可...
    • 2 篇 工商管理
    • 1 篇 图书情报与档案管...
  • 6 篇 法学
    • 6 篇 法学
  • 2 篇 经济学
    • 2 篇 应用经济学
  • 1 篇 文学
    • 1 篇 新闻传播学

主题

  • 149 篇 algorithm engine...
  • 14 篇 graph algorithms
  • 7 篇 route planning
  • 7 篇 computational ge...
  • 6 篇 shortest paths
  • 5 篇 experimental alg...
  • 5 篇 combinatorial op...
  • 4 篇 approximation al...
  • 4 篇 electric vehicle...
  • 4 篇 speedup techniqu...
  • 4 篇 multimodal route...
  • 4 篇 integer linear p...
  • 4 篇 data structures
  • 3 篇 parallel algorit...
  • 3 篇 time-dependent s...
  • 3 篇 exact algorithms
  • 3 篇 metaheuristics
  • 3 篇 journey planning
  • 3 篇 timetable inform...
  • 3 篇 burrows-wheeler ...

机构

  • 5 篇 karlsruhe inst t...
  • 3 篇 max planck inst ...
  • 3 篇 tech univ berlin...
  • 3 篇 karlsruhe inst t...
  • 2 篇 univ saarland le...
  • 2 篇 univ melbourne d...
  • 2 篇 univ copenhagen ...
  • 2 篇 simon fraser uni...
  • 2 篇 univ perugia dip...
  • 2 篇 cti patras
  • 2 篇 univ roma la sap...
  • 2 篇 univ nevada sch ...
  • 2 篇 univ pisa largo ...
  • 2 篇 univ piraeus dep...
  • 2 篇 univ patras dept...
  • 2 篇 karlsruhe inst t...
  • 2 篇 technol educ ins...
  • 2 篇 univ utrecht utr...
  • 2 篇 ecole polytech f...
  • 2 篇 max planck inst ...

作者

  • 9 篇 wagner dorothea
  • 8 篇 d'emidio mattia
  • 8 篇 sanders peter
  • 5 篇 baum moritz
  • 5 篇 dibbelt julian
  • 4 篇 luxen dennis
  • 4 篇 delling daniel
  • 3 篇 meyerhenke henni...
  • 3 篇 geisberger rober...
  • 3 篇 hueffner falk
  • 3 篇 vinciguerra gior...
  • 3 篇 skutella martin
  • 3 篇 ferragina paolo
  • 3 篇 meyer ulrich
  • 3 篇 italiano giusepp...
  • 3 篇 niedermeier rolf
  • 3 篇 vetter christian
  • 3 篇 klau gunnar w.
  • 3 篇 chatzigiannakis ...
  • 3 篇 eisenbrand fried...

语言

  • 141 篇 英文
  • 7 篇 其他
检索条件"主题词=Algorithm engineering"
149 条 记 录,以下是1-10 订阅
Special Issue on "algorithm engineering: Towards Practically Efficient Solutions to Combinatorial Problems"
收藏 引用
algorithmS 2019年 第11期12卷 229-229页
作者: D'Emidio, Mattia Frigioni, Daniele Univ Aquila Dept Informat Engn Comp Sci & Math Via Vetoio I-67100 Laquila Italy
The purpose of this special issue of algorithms was to attract papers presenting original research in the area of algorithm engineering. In particular, submissions concerning the design, analysis, implementation, tuni... 详细信息
来源: 评论
FREIGHT: Fast Streaming Hypergraph Partitioning
收藏 引用
algorithmICA 2025年 第3期87卷 405-428页
作者: Eyubov, Kamal Faraj, Marcelo Fonseca Schulz, Christian Heidelberg Univ Inst Comp Sci D-69120 Heidelberg Baden Wurttembe Germany
Partitioning the vertices of a (hyper)graph into k roughly balanced blocks such that few (hyper)edges run between blocks is a key problem for large-scale distributed processing. A current trend for partitioning huge (... 详细信息
来源: 评论
Two-level massive string dictionaries
收藏 引用
INFORMATION SYSTEMS 2025年 128卷
作者: Ferragina, Paolo Rotundo, Mariagiovanna Vinciguerra, Giorgio Univ Pisa Dept Comp Sci Lgo B Pontecorvo 3 I-56127 Pisa PI Italy
We study the problem of engineering space-time efficient data structures that support membership and rank queries on very large static dictionaries of strings. Our solution is based on a very simple approach that deco... 详细信息
来源: 评论
Mathematical models to analyze Lua hybrid tables
收藏 引用
THEORETICAL COMPUTER SCIENCE 2025年 1044卷
作者: Martinez, Conrado Nicaud, Cyril Rotondo, Pablo Univ Politecn Cataluna Barcelona 08034 Spain Univ Gustave Eiffel LIGM F-77454 Champs Sur Marne France
Lua (Ierusalimschy et al., 1996) is a well-known scripting language, popular among many programmers, most notably in the gaming industry. Remarkably, the only data-structuring mechanism in Lua is given by associative ... 详细信息
来源: 评论
engineering a Textbook Approach to Index Massive String Dictionaries  1
收藏 引用
30th International Symposium on String Processing and Information Retrieval (SPIRE) / 18th Workshop on Compression, Text, and algorithms (WCTA)
作者: Ferragina, Paolo Rotundo, Mariagiovanna Vinciguerra, Giorgio Univ Pisa Dept Comp Sci Pisa Italy
We study the problem of engineering space-time efficient indexes that support membership and lexicographic (rank) queries on very large static dictionaries of strings. Our solution is based on a very simple approach t... 详细信息
来源: 评论
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... 详细信息
来源: 评论
Top-k Distance Queries on Large Time-Evolving Graphs
收藏 引用
IEEE ACCESS 2023年 11卷 102228-102242页
作者: D'Ascenzo, Andrea D'Emidio, Mattia Univ Aquila Dept Informat Engn Comp Sci & Math I-67100 Laquila Italy
Fast extraction of top- k distances from graph data is a primitive of paramount importance in the fields of data mining, network analytics and machine learning, where ranked distances are exploited for several purpose... 详细信息
来源: 评论
Minimum Partition into Plane Subgraphs: The CG:SHOP Challenge 2022
收藏 引用
ACM Journal of Experimental algorithmics 2023年 第3期28卷 1-13页
作者: Fekete, Sándor P. Keldenich, Phillip Krupke, Dominik Schirra, Stefan Department of Computer Science TU Braunschweig Mühlenpfordtstr. 23 Braunschweig38106 Germany Department for Simulation and Graphics OVGU Magdeburg Universitätsplatz 2 Magdeburg39106 Germany
We give an overview of the 2022 Computational Geometry Challenge targeting the problem Minimum Partition into Plane Subsets, which consists of partitioning a given set of line segments into a minimum number of non-cro... 详细信息
来源: 评论
On the Equivalence Between Stochastic Tournament and Power-Law Ranking Selection and How to Implement Them Efficiently  18th
On the Equivalence Between Stochastic Tournament and Power-L...
收藏 引用
18th International Conference on Parallel Problem Solving from Nature (PPSN)
作者: Duc-Cuong Dang Opris, Andre Sudholt, Dirk Univ Passau Passau Germany
Tournament selection is a popular parent selection mechanism in evolutionary algorithms. Bian and Qian (PPSN 2022) proved that choosing the tournament size uniformly at random, called stochastic tournament selection, ... 详细信息
来源: 评论
The All Nearest Smaller Values Problem Revisited in Practice, Parallel and External Memory  24
The All Nearest Smaller Values Problem Revisited in Practice...
收藏 引用
36th ACM Symposium on Parallelism in algorithms and Architectures (SPAA)
作者: Sitchinava, Nodari Svenning, Rolf Univ Hawaii Manoa Honolulu HI 96822 USA Aarhus Univ Aarhus Denmark
We present a thorough investigation of the All Nearest Smaller Values (ANSV) problem from a practical perspective. The ANSV problem is defined as follows: given an array A consisting of n values, for each entry A(i) c... 详细信息
来源: 评论