咨询与建议

限定检索结果

文献类型

  • 33 篇 会议
  • 19 篇 期刊文献
  • 3 册 图书

馆藏范围

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

日期分布

学科分类号

  • 27 篇 工学
    • 18 篇 计算机科学与技术...
    • 13 篇 软件工程
    • 4 篇 电子科学与技术(可...
    • 4 篇 生物医学工程(可授...
    • 3 篇 电气工程
    • 3 篇 控制科学与工程
    • 2 篇 机械工程
    • 2 篇 光学工程
    • 2 篇 材料科学与工程(可...
    • 2 篇 信息与通信工程
    • 2 篇 生物工程
    • 1 篇 力学(可授工学、理...
    • 1 篇 仪器科学与技术
    • 1 篇 建筑学
    • 1 篇 土木工程
    • 1 篇 测绘科学与技术
  • 25 篇 理学
    • 20 篇 数学
    • 6 篇 统计学(可授理学、...
    • 5 篇 物理学
    • 3 篇 生物学
    • 1 篇 化学
    • 1 篇 天文学
    • 1 篇 系统科学
  • 5 篇 管理学
    • 3 篇 管理科学与工程(可...
    • 2 篇 工商管理
    • 2 篇 图书情报与档案管...
  • 3 篇 经济学
    • 3 篇 应用经济学
  • 3 篇 医学
    • 2 篇 基础医学(可授医学...
    • 2 篇 临床医学
    • 2 篇 药学(可授医学、理...
  • 1 篇 农学

主题

  • 6 篇 humans
  • 5 篇 evolutionary com...
  • 4 篇 artificial intel...
  • 3 篇 computer science
  • 3 篇 computational in...
  • 3 篇 artificial neura...
  • 3 篇 games
  • 2 篇 filters
  • 2 篇 graph algorithms
  • 2 篇 computer communi...
  • 2 篇 iterative method...
  • 2 篇 self organizing ...
  • 2 篇 visualization
  • 2 篇 programming tech...
  • 2 篇 matrix algebra
  • 2 篇 anisotropy
  • 2 篇 game theory
  • 2 篇 assembly
  • 2 篇 math application...
  • 2 篇 computation by a...

机构

  • 5 篇 algorithm engine...
  • 3 篇 tu darmstadt int...
  • 3 篇 algorithms and c...
  • 3 篇 tu darmstadt alg...
  • 2 篇 department of th...
  • 2 篇 algorithm engine...
  • 2 篇 algorithm and co...
  • 2 篇 fraunhofer igd c...
  • 2 篇 algorithm design...
  • 2 篇 research group v...
  • 2 篇 department of ma...
  • 2 篇 department of co...
  • 2 篇 department of co...
  • 2 篇 department of in...
  • 1 篇 algorithm engine...
  • 1 篇 molecule design ...
  • 1 篇 fakultät elektro...
  • 1 篇 bmw group 80809 ...
  • 1 篇 lehrstuhl für al...
  • 1 篇 eth zürich infor...

作者

  • 8 篇 mike preuss
  • 5 篇 nicola beume
  • 5 篇 lenzner pascal
  • 4 篇 boris naujoks
  • 3 篇 molitor louise
  • 3 篇 preuss mike
  • 2 篇 wessing simon
  • 2 篇 wesarg stefan
  • 2 篇 mička ondřej
  • 2 篇 hendrik richter
  • 2 篇 rothenberger ral...
  • 2 篇 chimani markus
  • 2 篇 friedrich tobias
  • 2 篇 carlos cotta
  • 2 篇 agrawal akanksha
  • 2 篇 tobias hein
  • 2 篇 panolan fahad
  • 2 篇 li guangping
  • 2 篇 nöllenburg marti...
  • 2 篇 keyhani mohammad...

语言

  • 54 篇 英文
  • 1 篇 其他
检索条件"机构=Algorithm Engineering Group"
55 条 记 录,以下是1-10 订阅
排序:
Parameterized Saga of First-Fit and Last-Fit Coloring  42
Parameterized Saga of First-Fit and Last-Fit Coloring
收藏 引用
42nd International Symposium on Theoretical Aspects of Computer Science, STACS 2025
作者: Agrawal, Akanksha Lokshtanov, Daniel Panolan, Fahad Saurabh, Saket Verma, Shaily Indian Institute of Technology Madras India University of California Santa BarbaraCA United States School of Computer Science University of Leeds United Kingdom The Institute of Mathematical Sciences HBNI Chennai India Department of Informatics University of Bergen Norway Algorithm Engineering Group Hasso Plattner Institute Potsdam Germany
The classic greedy coloring algorithm considers the vertices of an input graph G in a given order and assigns the first available color to each vertex v in G. In the Grundy Coloring problem, the task is to find an ord... 详细信息
来源: 评论
Upward planarization layout
收藏 引用
Journal of Graph algorithms and Applications 2011年 第1期15卷 127-155页
作者: Chimani, Markus Gutwenger, Carsten Mutzel, Petra Wong, Hoi-Ming Algorithm Engineering Group Friedrich-Schiller-University Jena Germany Chair for Algorithm Engineering TU Dortmund Germany
Recently, we presented a new practical method for upward crossing mini- mization [8], which clearly outperformed existing approaches for drawing hier- archical graphs in that respect. The outcome of this method is an ... 详细信息
来源: 评论
Quantum-inspired fluid simulation of two-dimensional turbulence with GPU acceleration
收藏 引用
Physical Review Research 2025年 第1期7卷 013112-013112页
作者: Leonhard Hölscher Pooja Rao Lukas Müller Johannes Klepsch Andre Luckow Tobias Stollenwerk Frank K. Wilhelm BMW Group 80809 Munich Germany Theoretical Physics Saarland University 66123 Saarbrücken Germany Institute for Quantum Computing Analytics (PGI 12) Forschungszentrum Jülich 52425 Jülich Germany Quantum Algorithm Engineering NVIDIA Santa Clara 95051 California USA Institute of Computer Science Ludwig Maximilian University Munich 80539 Munich Germany
Tensor network algorithms can efficiently simulate complex quantum many-body systems by utilizing knowledge of their structure and entanglement. These methodologies have been adapted recently for solving the Navier-St... 详细信息
来源: 评论
Analysis of Distributed algorithms on Scale-free Networks  9
Analysis of Distributed Algorithms on Scale-free Networks
收藏 引用
9th Ph. D. Retreat of the HPI Research School on Service-oriented Systems engineering
作者: Rothenberger, Ralf Algorithm Engineering Group Hasso-Plattner-Institut Germany
Processor design has reached the so called "power wall": simply increasing computational power by increasing frequency and power intake of individual processors is not justifiable anymore since the imposed h... 详细信息
来源: 评论
Exploring Game-Theoretic Formation of Realistic Networks  17
Exploring Game-Theoretic Formation of Realistic Networks
收藏 引用
17th HPI Future SOC Lab 2018
作者: Friedrich, Tobias Lenzner, Pascal Schumann, David Algorithm Engineering Group Hasso Plattner Institute for Digital Engineering Germany
Many real world networks from different domains share the same structural properties. So far, there only exist models which reproduce these properties via a random process and thus have only limited explanatory power.... 详细信息
来源: 评论
The satisfiability threshold for non-uniform random 2-SAT  46
The satisfiability threshold for non-uniform random 2-SAT
收藏 引用
46th International Colloquium on Automata, Languages, and Programming, ICALP 2019
作者: Friedrich, Tobias Rothenberger, Ralf Algorithm Engineering Group Hasso Plattner Institute University of Potsdam Germany
Propositional satisfiability (SAT) is one of the most fundamental problems in computer science. Its worst-case hardness lies at the core of computational complexity theory, for example in the form of NP-hardness and t... 详细信息
来源: 评论
Transitions in Dynamic Point Labeling  12
Transitions in Dynamic Point Labeling
收藏 引用
12th International Conference on Geographic Information Science, GIScience 2023
作者: Depian, Thomas Li, Guangping Nöllenburg, Martin Wulms, Jules Algorithms and Complexity Group TU Wien Austria Algorithm Engineering Group TU Dortmund Germany
The labeling of point features on a map is a well-studied topic. In a static setting, the goal is to find a non-overlapping label placement for (a subset of) point features. In a dynamic setting, the set of point feat... 详细信息
来源: 评论
BeatTheBeat music-based procedural content generation in a mobile game
BeatTheBeat music-based procedural content generation in a m...
收藏 引用
2012 IEEE International Conference on Computational Intelligence and Games, CIG 2012
作者: Jordan, Annika Scheftelowitsch, Dimitri Lahni, Jan Hartwecker, Jannic Kuchem, Matthias Walter-Huber, Mirko Vortmeier, Nils Delbrügger, Tim Güler, Ümit Vatolkin, Igor Preuss, Mike Computational Intelligence Group Department of Algorithm Engineering TU Dortmund Germany
We present a multi-player mobile game that employs fully automated music feature extraction to create 'levels' and thereby produce game content procedurally. Starting from a pool of songs (and their features),... 详细信息
来源: 评论
Tuning optimization algorithms for real-world problems by means of surrogate modeling  10
Tuning optimization algorithms for real-world problems by me...
收藏 引用
12th Annual Genetic and Evolutionary Computation Conference, GECCO-2010
作者: Preuss, Mike Rudolph, Günter Wessing, Simon Computational Intelligence Group Department of Algorithm Engineering Technische Universität Dortmund Germany
The case-specific tuning of parameters of optimization metaheuristics like evolutionary algorithms almost always leads to significant improvements in performance. But if the evaluation of the objective function is com... 详细信息
来源: 评论
Measuring multimodal optimization solution sets with a view to multiobjective techniques
Measuring multimodal optimization solution sets with a view ...
收藏 引用
International Conference on EVOLVE
作者: Preuss, Mike Wessing, Simon Computational Intelligence Group Chair of Algorithm Engineering Department of Computer Science TU Dortmund Dortmund Germany
As in multiobjective optimization, multimodal optimization generates solution sets that must be measured in order to compare different optimization algorithms. We discuss similarities and differences in the requiremen... 详细信息
来源: 评论