咨询与建议

限定检索结果

文献类型

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

馆藏范围

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

日期分布

学科分类号

  • 130 篇 工学
    • 115 篇 计算机科学与技术...
    • 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 篇 新闻传播学

主题

  • 148 篇 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...
  • 3 篇 parallel algorit...
  • 3 篇 time-dependent s...
  • 3 篇 exact algorithms
  • 3 篇 metaheuristics
  • 3 篇 journey planning
  • 3 篇 timetable inform...
  • 3 篇 burrows-wheeler ...
  • 3 篇 text indexing

机构

  • 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...

语言

  • 140 篇 英文
  • 8 篇 其他
检索条件"主题词=Algorithm engineering"
148 条 记 录,以下是11-20 订阅
排序:
A software engineering perspective on algorithmics
收藏 引用
ACM COMPUTING SURVEYS 2001年 第1期33卷 89-134页
作者: Weihe, K Forschungsinst Diskrete Math D-53113 Bonn Germany
An algorithm component is an implementation of an algorithm which is not intended to be a stand-alone module, but to perform a specific task within a large software package or even within several distinct software pac... 详细信息
来源: 评论
Reactive and dynamic local search for max-clique: engineering effective building blocks
收藏 引用
COMPUTERS & OPERATIONS RESEARCH 2010年 第3期37卷 534-542页
作者: Battiti, Roberto Mascia, Franco Univ Trent Dipartimento Ingn & Sci Informaz I-38100 Trento Italy
This paper presents the results of an ongoing investigation about how different algorithmic building blocks contribute to solving the maximum clique problem. We consider greedy constructions, plateau searches, and mor... 详细信息
来源: 评论
engineering efficient paging algorithms
收藏 引用
ACM Journal of Experimental algorithmics 2014年 第2期19卷 1-19页
作者: Moruz, Gabriel Negoescu, Andrei Neumann, Christian Weichert, Volker Department of Computer Science Goethe University Frankfurt Am Main Robert-Mayer-Str. 11-15 Frankfurt am Main 60325 Germany
In the field of online algorithms, paging is a well-studied problem. LRU is a simple paging algorithm that incurs few cache misses and supports efficient implementations. algorithms outperforming LRU in terms of cache... 详细信息
来源: 评论
engineering a PTAS for Minimum Feedback Vertex Set in Planar Graphs  1
收藏 引用
Conference on Analysis of Experimental algorithms (SEA2)
作者: Borradaile, Glencora Le, Hung Zheng, Baigong Oregon State Univ Corvallis OR 97331 USA
We investigate the practicality of approximation schemes for optimization problems in planar graphs based on balanced separators. The first polynomial-time approximation schemes (PTASes) for problems in planar graphs ... 详细信息
来源: 评论
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... 详细信息
来源: 评论
engineering efficient error-correcting geocoding  11
Engineering efficient error-correcting geocoding
收藏 引用
19th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems, ACM SIGSPATIAL GIS 2011
作者: Jung, Christian Karch, Daniel Knopp, Sebastian Luxen, Dennis Sanders, Peter PTV AG Stumpfstraße 1 76131 Karlsruhe Germany TU Berlin Straße des 17. Juni 135 10623 Berlin Germany Karlsruhe Institute of Technology Kaiserstraße 12 76131 Karlsruhe Germany
We study the problem of resolving a perhaps misspelled address of a location into geographic coordinates of latitude and longitude. Our solution does not require any prefixed rule set and is able to recover even heavi... 详细信息
来源: 评论
Modeling and engineering algorithms for mobile data
Modeling and engineering algorithms for mobile data
收藏 引用
12th International Symposium on Spatial Data Handling, SDH 2006
作者: Blunck, Henrik Hinrichs, Klaus H. Sondern, Joëlle Vahrenhold, Jan Institut für Informatik Westfälische Wilhelms-Universität Münster 48149 Muenster Germany
In this paper, we present an object-oriented approach to modeling mobile data and algorithms operating on such data. Our model is general enough to capture any kind of continuous motion while at the same time allowing... 详细信息
来源: 评论
Fast local search for the maximum independent set problem
收藏 引用
JOURNAL OF HEURISTICS 2012年 第4期18卷 525-547页
作者: Andrade, Diogo V. Resende, Mauricio G. C. Werneck, Renato F. AT&T Labs Res Florham Pk NJ 07932 USA Google Inc New York NY 10011 USA Microsoft Res Silicon Valley Mountain View CA 94043 USA
Given a graph G=(V,E), the independent set problem is that of finding a maximum-cardinality subset S of V such that no two vertices in S are adjacent. We introduce two fast local search routines for this problem. The ... 详细信息
来源: 评论
Fixed-parameter algorithms for DAG Partitioning
收藏 引用
DISCRETE APPLIED MATHEMATICS 2017年 220卷 134-160页
作者: van Bevern, Rene Bredereck, Robert Chopin, Morgan Hartung, Sepp Hueffner, Falk Nichterlein, Andre Suchy, Ondfej Novosibirsk State Univ Novosibirsk Russia TU Berlin Inst Softwaretech & Theoret Informat Berlin Germany Univ Ulm Inst Optimierung & Operat Res D-89069 Ulm Germany Czech Tech Univ Fac Informat Technol Prague Czech Republic
Finding the origin of short phrases propagating through the web has been formalized by Leskovec et al. (2009) as DAG PARTITIONING: given an arc-weighted directed acyclic graph on n vertices and m arcs, delete arcs wit... 详细信息
来源: 评论
Isolation concepts for clique enumeration: Comparison and computational experiments
收藏 引用
THEORETICAL COMPUTER SCIENCE 2009年 第52期410卷 5384-5397页
作者: Hueffner, Falk Komusiewicz, Christian Moser, Hannes Niedermeier, Rolf Univ Jena Inst Informat D-07743 Jena Germany Tel Aviv Univ Sch Comp Sci IL-69978 Tel Aviv Israel
We do Computational studies concerning the enumeration of isolated cliques in graphs. Isolation, as recently introduced, measures the degree of connectedness of the cliques to the rest of the graph. Isolation helps bo... 详细信息
来源: 评论