咨询与建议

限定检索结果

文献类型

  • 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 条 记 录,以下是81-90 订阅
Improved and extended locating functionality on compressed suffix arrays
收藏 引用
JOURNAL OF DISCRETE algorithmS 2015年 32卷 53-63页
作者: Gog, Simon Navarro, Gonzalo Petri, Matthias Karlsruhe Inst Technol Inst Theoret Informat D-76021 Karlsruhe Germany Univ Chile Dept Comp Sci Ctr Biotechnol & Bioengn Santiago Chile Univ Melbourne Dept Comp & Informat Syst Melbourne Vic 3010 Australia
Compressed Suffix Arrays (CSAs) offer the same functionality as classical suffix arrays (SAs), and more, within space close to that of the compressed text, and in addition they can reproduce any text fragment. Further... 详细信息
来源: 评论
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... 详细信息
来源: 评论
Optimized succinct data structures for massive data
收藏 引用
SOFTWARE-PRACTICE & EXPERIENCE 2014年 第11期44卷 1287-1314页
作者: Gog, Simon Petri, Matthias Univ Melbourne Dept Comp & Informat Syst Melbourne Vic 3010 Australia RMIT Univ Sch Comp Sci & Informat Technol Melbourne Vic 3001 Australia
Succinct data structures provide the same functionality as their corresponding traditional data structure in compact space. We improve on functions rank and select, which are the basic building blocks of FM-indexes an... 详细信息
来源: 评论
Fully dynamic update of arc-flags
收藏 引用
NETWORKS 2014年 第3期63卷 243-259页
作者: D'Angelo, Gianlorenzo D'Emidio, Mattia Frigioni, Daniele Univ Perugia Dept Math & Informat I-06123 Perugia Italy Univ Pisa Dept Comp Sci I-56127 Pisa Italy Univ Aquila Dept Comp Sci Informat Engn & Math I-67100 Laquila Italy
Best connections in real networks are usually found by applying Dijkstra's shortest paths algorithm. Unfortunately, networks deriving from real-world applications are huge, yielding unsustainable times to compute ... 详细信息
来源: 评论
Towards Optimal and Expressive Kernelization for d-Hitting Set
收藏 引用
algorithmICA 2014年 第1期70卷 129-147页
作者: van Bevern, Rene TU Berlin Inst Softwaretech & Theoret Informat D-10587 Berlin Germany
A sunflower in a hypergraph is a set of hyperedges pairwise intersecting in exactly the same vertex set. Sunflowers are a useful tool in polynomial-time data reduction for problems formalizable as d-Hitting Set, the p... 详细信息
来源: 评论
Candidate sets for alternative routes in road networks
收藏 引用
ACM Journal of Experimental algorithmics 2014年 第2期19卷 1–28页
作者: Luxen, Dennis Schieferdecker, Dennis Institute for Theoretical Informatics Karlsruhe Institute of Technology Am Fasanengarten 5 Karlsruhe 76131 Germany
We study the computation of good alternatives to the shortest path in road networks. Our approach is based on single via-node routing on top of contraction hierarchies and achieves superior quality and efficiency comp... 详细信息
来源: 评论
A practical approach to generating route sketches  2
A practical approach to generating route sketches
收藏 引用
2nd ACM SIGSPATIAL International Workshop on MapInteraction, MapInteract 2014
作者: Luxen, Dennis Niklaus, Patrick Mapbox Inc. 1714 14th St NW Rear Entrance WashingtonDC20009 United States Karlsruhe Institute of Technology Am Fasanengarten 5 Karlsruhe76128 Germany
Online mapping and navigation services are a corner stone of the World Wide Web. While automatically generated car directions have gone from static data to user-specific customizations, automatically generated route g... 详细信息
来源: 评论
Constructing Low Star Discrepancy Point Sets with Genetic algorithms  13
Constructing Low Star Discrepancy Point Sets with Genetic Al...
收藏 引用
15th Genetic and Evolutionary Computation Conference (GECCO)
作者: Doerr, Carola De Rainville, Francois-Michel Univ Paris 07 LIAFA F-75205 Paris 13 France Max Planck Inst Informat D-66123 Saarbrucken Germany Univ Laval Dept Gen Elect & Gen Informat Lab Vis & Syst Numeriques Quebec City PQ G1V 0A6 Canada
Geometric discrepancies are standard measures to quantify the irregularity of distributions. They are an important notion in numerical integration. One of the most important discrepancy notions is the so-called star d... 详细信息
来源: 评论
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 ... 详细信息
来源: 评论
Lossless asymmetric single instruction multiple data codec
收藏 引用
SOFTWARE-PRACTICE & EXPERIENCE 2012年 第9期42卷 1095-1106页
作者: Wassenberg, Jan Fraunhofer IOSB SZA D-76275 Ettlingen Germany
This report introduces a new lossless asymmetric single instruction multiple data codec designed for extremely efficient decompression of large satellite images. A throughput in excess of 3GB/s allows decompression to... 详细信息
来源: 评论