咨询与建议

限定检索结果

文献类型

  • 121 篇 会议
  • 96 篇 期刊文献
  • 10 册 图书

馆藏范围

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

日期分布

学科分类号

  • 122 篇 工学
    • 82 篇 计算机科学与技术...
    • 56 篇 软件工程
    • 22 篇 信息与通信工程
    • 12 篇 生物工程
    • 11 篇 电气工程
    • 10 篇 控制科学与工程
    • 10 篇 土木工程
    • 9 篇 生物医学工程(可授...
    • 8 篇 电子科学与技术(可...
    • 8 篇 建筑学
    • 6 篇 交通运输工程
    • 5 篇 力学(可授工学、理...
    • 5 篇 材料科学与工程(可...
    • 4 篇 机械工程
    • 4 篇 光学工程
    • 4 篇 动力工程及工程热...
    • 4 篇 测绘科学与技术
  • 111 篇 理学
    • 87 篇 数学
    • 15 篇 物理学
    • 14 篇 统计学(可授理学、...
    • 11 篇 生物学
    • 11 篇 系统科学
    • 4 篇 化学
    • 4 篇 地球物理学
  • 34 篇 管理学
    • 26 篇 管理科学与工程(可...
    • 15 篇 工商管理
    • 10 篇 图书情报与档案管...
  • 5 篇 经济学
    • 5 篇 应用经济学
  • 5 篇 农学
    • 5 篇 作物学
  • 4 篇 法学
    • 4 篇 社会学
  • 3 篇 医学
  • 1 篇 军事学

主题

  • 6 篇 genetic programm...
  • 6 篇 convergence
  • 6 篇 computational mo...
  • 6 篇 algorithm design...
  • 5 篇 approximation al...
  • 5 篇 algorithms
  • 5 篇 optimization
  • 4 篇 graphics process...
  • 4 篇 pattern matching
  • 4 篇 graph theory
  • 4 篇 clustering algor...
  • 4 篇 algorithm analys...
  • 3 篇 trees (mathemati...
  • 3 篇 fault tolerance
  • 3 篇 polynomial appro...
  • 3 篇 hamiltonians
  • 3 篇 vectors
  • 3 篇 graphic methods
  • 3 篇 visualization
  • 3 篇 genetic algorith...

机构

  • 19 篇 algorithms and c...
  • 9 篇 indian institute...
  • 9 篇 research group t...
  • 7 篇 research group e...
  • 6 篇 algorithms resea...
  • 6 篇 university of vi...
  • 5 篇 department of co...
  • 5 篇 department of in...
  • 4 篇 algorithms resea...
  • 3 篇 algorithms resea...
  • 3 篇 research group n...
  • 3 篇 parallel archite...
  • 3 篇 telefónica scien...
  • 3 篇 algorithms group...
  • 3 篇 heuristic and ev...
  • 3 篇 department of in...
  • 3 篇 research unit of...
  • 3 篇 department of co...
  • 3 篇 digital enterpri...
  • 3 篇 algorithms resea...

作者

  • 14 篇 nöllenburg marti...
  • 13 篇 bhore sujoy
  • 10 篇 wilfried n. gans...
  • 9 篇 smyth w.f.
  • 9 篇 brill markus
  • 8 篇 affenzeller mich...
  • 7 篇 israel jonas
  • 7 篇 li guangping
  • 7 篇 smyth william f.
  • 6 篇 zavoral filip
  • 6 篇 korpas georgios
  • 6 篇 kruliš martin
  • 5 篇 ganian robert
  • 5 篇 yaghob jakub
  • 4 篇 e.d. goodman
  • 4 篇 franek frantisek
  • 4 篇 schmidt-kraepeli...
  • 3 篇 xian jiayi
  • 3 篇 hana strakova
  • 3 篇 kulkarni janardh...

语言

  • 215 篇 英文
  • 11 篇 其他
  • 1 篇 中文
检索条件"机构=Research Group Algorithms"
227 条 记 录,以下是1-10 订阅
排序:
An Improved Lower Bound on the Number of Pseudoline Arrangements  40
An Improved Lower Bound on the Number of Pseudoline Arrangem...
收藏 引用
40th International Symposium on Computational Geometry, SoCG 2024
作者: Kühnast, Fernando Cortés Dallant, Justin Felsner, Stefan Scheucher, Manfred Institute of Mathematics Technische Universität Berlin Germany Algorithms Research Group Université libre de Bruxelles Belgium
Arrangements of pseudolines are classic objects in discrete and computational geometry. They have been studied with increasing intensity since their introduction almost 100 years ago. The study of the number Bn of non... 详细信息
来源: 评论
The k-Opt Algorithm for the Traveling Salesman Problem Has Exponential Running Time for k ≥ 5  51
The k-Opt Algorithm for the Traveling Salesman Problem Has E...
收藏 引用
51st International Colloquium on Automata, Languages, and Programming, ICALP 2024
作者: Heimann, Sophia Hoang, Hung P. Hougardy, Stefan Research Institute for Discrete Mathematics University of Bonn Germany Algorithms and Complexity Group Faculty of Informatics TU Wien Austria Research Institute for Discrete Mathematics and Hausdorff Center for Mathematics University of Bonn Germany
The k-Opt algorithm is a local search algorithm for the Traveling Salesman Problem. Starting with an initial tour, it iteratively replaces at most k edges in the tour with the same number of edges to obtain a better t... 详细信息
来源: 评论
A Structural Complexity Analysis of Hierarchical Task Network Planning
arXiv
收藏 引用
arXiv 2024年
作者: Brand, Cornelius Ganian, Robert Inerney, Fion Mc Wietheger, Simon Algorithms & Complexity Theory Group Regensburg University Germany Algorithms and Complexity Group TU Wien Austria Telefónica Scientific Research Barcelona Spain
We perform a refined complexity-theoretic analysis of three classical problems in the context of Hierarchical Task Network Planning: the verification of a provided plan, whether an executable plan exists, and whether ... 详细信息
来源: 评论
Problems on group-Labeled Matroid Bases  51
Problems on Group-Labeled Matroid Bases
收藏 引用
51st International Colloquium on Automata, Languages, and Programming, ICALP 2024
作者: Hörsch, Florian Imolay, András Mizutani, Ryuhei Oki, Taihei Schwarcz, Tamás Algorithms and Complexity Group CISPA Saarbrücken Germany MTA-ELTE Matroid Optimization Research Group Department of Operations Research ELTE Eötvös Loránd University Budapest Hungary Department of Mathematical Informatics Graduate School of Information Science and Technology The University of Tokyo Japan
Consider a matroid equipped with a labeling of its ground set to an abelian group. We define the label of a subset of the ground set as the sum of the labels of its elements. We study a collection of problems on findi... 详细信息
来源: 评论
The Computational Complexity of Positive Non-Clashing Teaching in Graphs
arXiv
收藏 引用
arXiv 2025年
作者: Ganian, Robert Khazaliya, Liana Inerney, Fionn Mc Rocton, Mathis Algorithms and Complexity Group TU Wien Austria Telefónica Scientific Research Barcelona Spain
We study the classical and parameterized complexity of computing the positive non-clashing teaching dimension of a set of concepts, that is, the smallest number of examples per concept required to successfully teach a... 详细信息
来源: 评论
Self-organizing Migrating Algorithm (SOMA) for Pumped-Storage Hydrothermal System Scheduling
Self-organizing Migrating Algorithm (SOMA) for Pumped-Storag...
收藏 引用
International Conference on Advanced Engineering Theory and Applications, AETA 2022
作者: Phan, Tan Minh Trong Dao, Tran Power System Optimization Research Group Faculty of Electrical and Electronics Engineering Ton Duc Thang University Ho Chi Minh City Viet Nam Modeling Evolutionary Algorithms Simulation and Artificial Intelligence Research Group Faculty of Electrical and Electronics Engineering Ton Duc Thang University Ho Chi Minh City Viet Nam
This paper presents the results of one power system working over one day by running three algorithms, including Dragonfly algorithm (DA), Salp Swarm Algorithm (SSA) and the self-organizing migrating algorithm (SOMA). ... 详细信息
来源: 评论
Parameterized Complexity of Caching in Networks*
arXiv
收藏 引用
arXiv 2024年
作者: Ganian, Robert Inerney, Fionn Mc Tsigkari, Dimitra Algorithms and Complexity Group TU Wien Vienna Austria Telefónica Scientific Research Barcelona Spain
The fundamental caching problem in networks asks to find an allocation of contents to a network of caches with the aim of maximizing the cache hit rate. Despite the problem's importance to a variety of research ar... 详细信息
来源: 评论
An Algorithmic Study of Fully Dynamic Independent Sets for Map Labeling
收藏 引用
ACM Journal of Experimental Algorithmics 2022年 第1期27卷 1-36页
作者: Bhore, Sujoy Li, Guangping Nöllenburg, Martin Indian Institute of Science Education and Research Bhopal Bypass Road Bhauri Madhya Pradesh Bhopal462066 India TU Wien Algorithms and Complexity Group Favoritenstraße 9-11 Vienna1040 Austria
Map labeling is a classical problem in cartography and geographic information systems that asks to place labels for area, line, and point features, with the goal to select and place the maximum number of independent (... 详细信息
来源: 评论
An Improved Lower Bound on the Number of Pseudoline Arrangements
arXiv
收藏 引用
arXiv 2024年
作者: Kühnast, Fernando Cortés Dallant, Justin Felsner, Stefan Scheucher, Manfred Institute of Mathematics Technische Universität Berlin Germany Algorithms Research Group Université libre de Bruxelles Belgium
Arrangements of pseudolines are classic objects in discrete and computational geometry. They have been studied with increasing intensity since their introduction almost 100 years ago. The study of the number Bn of non... 详细信息
来源: 评论
LLMs as information warriors? Auditing how LLM-powered chatbots tackle disinformation about Russia’s war in Ukraine
arXiv
收藏 引用
arXiv 2024年
作者: Makhortykh, Mykola Baghumyan, Ani Vziatysheva, Victoria Sydorova, Maryna Kuznetsova, Elizaveta Institute of Communication and Media Studies University of Bern Switzerland Research Group Platform Algorithms and Digital Propaganda Weizenbaum Institute Germany
The rise of large language models (LLMs) has a significant impact on information warfare. By facilitating the production of content related to disinformation and propaganda campaigns, LLMs can amplify different types ... 详细信息
来源: 评论