检索结果-内蒙古大学图书馆

您好，读者！请登录

内蒙古大学图书馆

首页
概况
党建
资源
服务
科研支持
- 论文收录引用证明
- 科技查新
知识产权
档案馆
帮助

咨询与建议

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入0个字，您还可以输入200个字

全部搜索
期刊论文
图书
学位论文
标准
纸本馆藏
外文资源发现
数据库导航
超星发现

高级检索

时间限定

出版年份：

文献类型

图书期刊文献学位论文多媒体

馆藏选择

电子馆藏纸本馆藏

核心期刊

全部期刊 SCI 收录期刊 SSCI 收录期刊 EI 收录期刊 CSCD 收录期刊 CSSCI 收录期刊

语言

中文英文

文献类型

期刊文献图书学位论文标准纸本馆藏

帮助

文字说明：

T=题名（书名、题名），A=作者（责任者），K=主题词，P=出版物名称，PU=出版社名称，O=机构（作者单位、学位授予单位、专利申请人），L=中图分类号，C=学科分类号，U=全部字段，Y=年（出版发行年、学位年度、标准发布年）

检索规则说明：

AND代表“并且”；OR代表“或者”；NOT代表“不包含”；(注意必须大写,运算符两边需空一格)

检索范例：

范例一：(K=图书馆学 OR K=情报学) AND A=范并思 AND Y=1982-2016
范例二：P=计算机应用与软件 AND (U=C++ OR U=Basic) NOT K=Visual AND Y=2011-2016

分类表

所选分类

>> <<

限定检索结果

文献类型

4 篇 会议

馆藏范围

4 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

2 篇 理学
- 2 篇 数学
2 篇 工学
- 2 篇 计算机科学与技术...
- 2 篇 软件工程
1 篇 管理学
- 1 篇 管理科学与工程(可...

主题

1 篇 trees (mathemati...
1 篇 consensus algori...
1 篇 branch and bound...

机构

1 篇 heidelberg unive...
1 篇 karlsruhe instit...
1 篇 school of electr...
1 篇 school of engine...
1 篇 amsterdam machin...

作者

1 篇 kragic danica
1 篇 reinstädtler hen...
1 篇 garcía-castellan...
1 篇 marchetti giovan...
1 篇 bekkers erik j.
1 篇 maas nikolai
1 篇 schreiber domini...
1 篇 akram matthew
1 篇 großmann ernesti...
1 篇 sanders peter
1 篇 schulz christian
1 篇 walliser fabian
1 篇 medbouhi aniss a...

语言

4 篇 其他

检索条件"任意字段=2025 SIAM Symposium on Algorithm Engineering and Experiments, ALENEX 2025"

共 4 条记录，以下是1-10 订阅

全选清除本页清除全部题录导出标记到"检索档案"

详细简洁

排序：

siam symposium on algorithm engineering and experiments, alenex 2025

SIAM Symposium on Algorithm Engineering and Experiments, ALE...

引用

2025 siam symposium on algorithm engineering and experiments, alenex 2025

ISBN: (纸本)9798331311995

The proceedings contain 17 papers. The topics discussed include: optimal neighborhood exploration for dynamic independent sets;a simpler approach for monotone parametric minimum cut: finding the breakpoints in order;graph neural networks as ordering heuristics for parallel graph coloring;discrete transforms of quantized persistence diagrams;scalable multilevel and memetic signed graph clustering;batched K-Mer lookup on the spectral burrows-wheeler transform;SpiderDAN: matching augmentation in demand-aware networks;exploring the landscape of distributed graph sketching;the constrained layer tree problem and applications to solar farm cabling;and a greedy algorithm for low-crossing partitions for general set systems.

关键词：

来源：评论

学校读者我要写书评

暂无评论

HyperSteiner: Computing Heuristic Hyperbolic Steiner Minimal Trees

HyperSteiner: Computing Heuristic Hyperbolic Steiner Minimal...

引用

2025 siam symposium on algorithm engineering and experiments, alenex 2025

作者： García-Castellanos, Alejandro Medbouhi, Aniss Aiman Marchetti, Giovanni Luca Bekkers, Erik J. Kragic, Danica Amsterdam Machine Learning Lab University of Amsterdam Netherlands School of Electrical Engineering and Computer Science KTH Royal Institute of Technology Sweden School of Engineering Sciences KTH Royal Institute of Technology Sweden

ISBN: (纸本)9798331311995

We propose HyperSteiner – an efficient heuristic algorithm for computing Steiner minimal trees in the hyperbolic space. HyperSteiner extends the Euclidean Smith-Lee-Liebman algorithm, which is grounded in a divide-and-conquer approach involving the Delaunay triangulation. The central idea is rephrasing Steiner tree problems with three terminals as a system of equations in the Klein-Beltrami model. Motivated by the fact that hyperbolic geometry is well-suited for representing hierarchies, we explore applications to hierarchy discovery in data. Results show that HyperSteiner infers more realistic hierarchies than the Minimum Spanning Tree and is more scalable to large datasets than Neighbor Joining. Copyright © 2025 by siam.

关键词： Trees (mathematics)

来源：评论

学校读者我要写书评

暂无评论

engineering Fully Dynamic Exact ∆-Orientation algorithms

Engineering Fully Dynamic Exact ∆-Orientation Algorithms

引用

2025 siam symposium on algorithm engineering and experiments, alenex 2025

作者： Großmann, Ernestine Reinstädtler, Henrik Schulz, Christian Walliser, Fabian Heidelberg University Germany

ISBN: (纸本)9798331311995

A (fully) dynamic graph algorithm is a data structure that supports edge insertions, edge deletions, and answers specific queries pertinent to the problem at hand. In this work, we address the fully dynamic edge orientation problem, also known as the fully dynamic ∆-orientation problem. The objective is to maintain an orientation of the edges in an undirected graph such that the out-degree of any vertex remains low. When edges are inserted or deleted, it may be necessary to reorient some edges to prevent vertices from having excessively high out-degrees. In this paper, we introduce the first algorithm that maintains an optimal edge orientation during both insertions and deletions. In experiments comparing with recent nearly exact algorithms, we achieve a 32% lower running time. The update time of our algorithm is up to 6 orders of magnitude faster than static exact algorithms. Copyright © 2025 by siam.

关键词： Consensus algorithm

来源：评论

学校读者我要写书评

暂无评论

engineering Optimal Parallel Task Scheduling

Engineering Optimal Parallel Task Scheduling

引用

2025 siam symposium on algorithm engineering and experiments, alenex 2025

作者： Akram, Matthew Maas, Nikolai Sanders, Peter Schreiber, Dominik Karlsruhe Institute of Technology Karlsruhe Germany

ISBN: (纸本)9798331311995

The NP-hard scheduling problem P||Cmax encompasses a set of tasks with known execution time which must be mapped to a set of identical machines such that the overall completion time is minimized. In this work, we improve existing techniques for optimal P||Cmax scheduling with a combination of new theoretical insights and careful practical engineering. Most importantly, we derive techniques to prune vast portions of the search space of branch-and-bound (BnB) approaches and propose improved upper and lower bounding techniques. Moreover, we present new benchmarks for P||Cmax, based on diverse applications, which can shed light on aspects that prior synthetic instances fail to capture. In extensive evaluations, we observe that our pruning reduces the number of explored nodes by 90× and running times by 12×. Compared to a state-of-the-art ILP-based approach, our approach is preferable for short running time limits and for instances with large makespans. Copyright © 2025 by siam.

关键词： Branch and bound method

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

全选清除本页清除全部题录导出标记到“检索档案”

共1页 << < 1 > >>

检索报告对象比较合并检索0

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

电话和邮箱必须正确填写，我们会与您联系确认。

联系人：

所在院系：

联系邮箱：

联系电话：

内蒙古自治区呼和浩特市赛罕区大学西街235号邮编: 010021

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：