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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入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

分类表

所选分类

>> <<

限定检索结果

文献类型

96 篇 期刊文献
89 篇 会议
4 篇 学位论文

馆藏范围

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

日期分布

学科分类号

172 篇 工学
- 148 篇 计算机科学与技术...
- 40 篇 软件工程
- 18 篇 电气工程
- 14 篇 信息与通信工程
- 4 篇 电子科学与技术（可...
- 3 篇 仪器科学与技术
- 3 篇 控制科学与工程
- 2 篇 机械工程
- 2 篇 生物医学工程（可授...
- 1 篇 测绘科学与技术
- 1 篇 化学工程与技术
- 1 篇 石油与天然气工程
- 1 篇 船舶与海洋工程
- 1 篇 航空宇航科学与技...
- 1 篇 生物工程
89 篇 理学
- 84 篇 数学
- 3 篇 生物学
- 3 篇 统计学（可授理学、...
- 1 篇 化学
- 1 篇 地理学
- 1 篇 地球物理学
- 1 篇 系统科学
12 篇 管理学
- 12 篇 管理科学与工程(可...
- 1 篇 工商管理
5 篇 医学
- 2 篇 临床医学
- 1 篇 基础医学(可授医学...
- 1 篇 药学(可授医学、理...
1 篇 经济学
- 1 篇 应用经济学
1 篇 法学
- 1 篇 法学

主题

189 篇 dynamic algorith...
21 篇 graph algorithms
16 篇 data structures
15 篇 shortest paths
14 篇 algorithms
10 篇 computational ge...
9 篇 online algorithm...
8 篇 distributed algo...
6 篇 parallel algorit...
6 篇 planar graphs
6 篇 transitive closu...
6 篇 randomized algor...
5 篇 performance
5 篇 maximum matching
5 篇 heuristic algori...
4 篇 static algorithm...
4 篇 graphs
4 篇 languages
4 篇 visibility
4 篇 matching

机构

8 篇 univ warwick cov...
5 篇 tel aviv univ sc...
5 篇 carnegie mellon ...
4 篇 univ aquila dipa...
4 篇 univ roma la sap...
4 篇 univ vienna aust...
4 篇 toyota technol i...
4 篇 kth royal inst t...
4 篇 tel aviv univ te...
3 篇 univ warsaw inst...
3 篇 bar ilan univ de...
3 篇 bar ilan univ de...
3 篇 max planck inst ...
3 篇 swiss fed inst t...
3 篇 columbia univ de...
3 篇 ben gurion univ ...
3 篇 kings coll londo...
2 篇 univ roma tor ve...
2 篇 univ copenhagen ...
2 篇 cwi

作者

10 篇 bhattacharya say...
6 篇 frigioni daniele
6 篇 henzinger monika
5 篇 frigioni d
5 篇 saranurak thatch...
5 篇 nanongkai danupo...
5 篇 d'angelo gianlor...
4 篇 blelloch guy e.
4 篇 d'emidio mattia
4 篇 kiss peter
4 篇 roditty liam
4 篇 inkulu r.
4 篇 zwick uri
4 篇 nanni u
4 篇 acar umut a.
4 篇 bernstein aaron
3 篇 cicerone serafin...
3 篇 marchetti-spacca...
3 篇 tangwongsan kana...
3 篇 charalampopoulos...

语言

179 篇 英文
9 篇 其他
1 篇 中文

检索条件"主题词=Dynamic algorithms"

共 189 条记录，以下是161-170 订阅

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

详细简洁

排序：

dynamic Construction of Order-k Voronoi Diagram

Dynamic Construction of Order-k Voronoi Diagram

引用

International Conference on Computer Science and Network Technology

作者： Li Ma Guo-Bin Su Department of Information and Engineering Shijiazhuang University of Economics Hebei province talents exchange service center

ISBN: (纸本)9781467329637

The order-k Voronoi diagrams are difficult to construct because of their complicated structures. In traditional algorithm, production process was extremely complex. While dynamic algorithm is only concerned with positions of generators, so it is effective for constructing Voronoi diagrams with complicated shapes of Voronoi polygons. It can be applied to order-k Voronoi diagram with any generators, and can get over most shortcomings of traditional algorithm. So it is more useful and effective. Model is constructed with dynamic algorithm. And the application example shows that the algorithm is both simple and useful, and it is of high potential value in practice.

关键词： Voronoi diagram dynamic Order-k Voronoi diagrams dynamic algorithms dynamos dynamic high potential

来源：评论

学校读者我要写书评

暂无评论

dynamic Structural Analysis for DAEs 14

Dynamic Structural Analysis for DAEs

引用

Simulation Multiconference

作者： Christoph Hoger Department of Software Engineering and Theoretical Computer Science Technische Universitat Berlin

ISBN: (纸本)9781632667335

Efficient simulation of higher-index variable-structure DAE requires index-reduction during simulation. Hence, the performance of the implemented index-reduction method is crucial. When the same algorithm has to be calculated for slightly different inputs, dynamic algorithms can outperform their static counterparts by reusing common elements of the solutions. We present the dynamic Σ-method, a correct and efficient index-reduction method for dynamic systems. The dynamic Σ-method provides large performance gains for large, homogeneous models.

关键词： DAE Index Reduction Hybrid System Structural Variability hybrid systems dynamic structural analysis REDUCTION METHODS dynamic algorithms dynamic systems

来源：评论

学校读者我要写书评

暂无评论

Online Decentralised Mechanisms for dynamic Ridesharing 24

Online Decentralised Mechanisms for Dynamic Ridesharing

引用

Proceedings of the 23rd International Conference on Autonomous Agents and Multiagent Systems

作者： Nicos Protopapas Vahid Yazdanpanah Enrico H. Gerding Sebastian Stein Archimedes/RC Athena Athens Greece University of Southampton Southampton United Kingdom

ISBN: (纸本)9798400704864

Ridesharing services promise an exciting new future for urban mobility. A carefully designed ridesharing system will decrease congestion levels and increase air quality. However, an effective system needs to capture online demand, where users do not schedule their trips in advance, but instead appear and ask for a ride right away. Such online demands require rerouting to be efficient. We call this setting with online demands and available rerouting "dynamic ridesharing'' and propose a market-based mechanism where the prospective riders are provided with a menu of choices between several available cars. Our algorithm incentivises users to share their rides and guarantees riders' utility by properly compensating riders whose routes change during their journey. We provide numerical results, comparing our algorithm against natural benchmarks representing real-world ridesharing services for several cases and with respect to efficiency, fairness, and environmental impact.

关键词： dynamic algorithms mechanism design ridesharing

来源：评论

学校读者我要写书评

暂无评论

Deterministic Incremental APSP with Polylogarithmic Update Time and Stretch 2023

Deterministic Incremental APSP with Polylogarithmic Update T...

引用

55th Annual ACM Symposium on Theory of Computing (STOC) part of the ACM Federated Computing Research Conference (FCRC)

作者： Forster, Sebastian Nazari, Yasamin Gutenberg, Maximilian Probst Salzburg Univ Salzburg Austria Swiss Fed Inst Technol Zurich Switzerland

ISBN: (纸本)9781450399135

We provide the first deterministic data structure that given a weighted undirected graph undergoing edge insertions, processes each update with polylogarithmic amortized update time and answers queries for the distance between any pair of vertices in the current graph with a polylogarithmic approximation in O(log log n) time. Prior to this work, no data structure was known for partially dynamic graphs, i.e., graphs undergoing either edge insertions or deletions, with less than n(o(1)) update time except for dense graphs, even when allowing randomization against oblivious adversaries or considering only single-source distances.

关键词： dynamic algorithms Shortest paths Graph algorithms

来源：评论

学校读者我要写书评

暂无评论

A Unifying Framework to Identify Dense Subgraphs on Streams: Graph Nuclei to Hypergraph Cores 21

A Unifying Framework to Identify Dense Subgraphs on Streams:...

引用

14th ACM International Conference on Web Search and Data Mining (WSDM)

作者： Gabert, Kasimir Pinar, Ali Catalyurek, Umit, V Georgia Inst Technol Atlanta GA 30332 USA Sandia Natl Labs Livermore CA USA

ISBN: (纸本)9781450382977

Finding dense regions of graphs is fundamental in graph mining. We focus on the computation of dense hierarchies and regions with graph nuclei-a generalization of k-cores and trusses. Static computation of nuclei, namely through variants of 'peeling', are easy to understand and implement. However, many practically important graphs undergo continuous change. dynamic algorithms, maintaining nucleus computations on dynamic graph streams, are nuanced and require significant effort to port between nuclei, e.g., from k-cores to trusses. We propose a unifying framework to maintain nuclei in dynamic graph streams. First, we show no dynamic algorithm can asymptotically beat re-computation, highlighting the need to experimentally understand variability. Next, we prove equivalence between k-cores on a special hypergraph and nuclei. Our algorithm splits the problem into maintaining the special hypergraph and maintaining k-cores on it. We implement our algorithm and experimentally demonstrate improvements up to 10(8) x over re-computation. We show algorithmic improvements on k-cores apply to trusses and outperform truss-specific implementations.

关键词： nucleus decomposition dynamic algorithms k-core k-truss

来源：评论

学校读者我要写书评

暂无评论

Online Bin Covering with Limited Migration 27

Online Bin Covering with Limited Migration

引用

27th Annual European Symposium on algorithms (ESA)

作者： Berndt, Sebastian Epstein, Leah Jansen, Klaus Levin, Asaf Maack, Marten Rohwedder, Lars Univ Kiel Dept Comp Sci Kiel Germany Univ Haifa Dept Math Haifa Israel Technion Fac Ind Engn & Management Haifa Israel

ISBN: (纸本)9783959771245

Semi-online models where decisions may be revoked in a limited way have been studied extensively in the last years. This is motivated by the fact that the pure online model is often too restrictive to model real-world applications, where some changes might be allowed. A well-studied measure of the amount of decisions that can be revoked is the migration factor beta: When an object o of size s(o) arrives, the decisions for objects of total size at most beta center dot s(o) may be revoked. Usually beta should be a constant. This means that a small object only leads to small changes. This measure has been successfully investigated for different, classical problems such as bin packing or makespan minimization. The dual of makespan minimization - the Santa Claus or machine covering problem - has also been studied, whereas the dual of bin packing - the bin covering problem - has not been looked at from such a perspective. In this work, we extensively study the bin covering problem with migration in different scenarios. We develop algorithms both for the static case - where only insertions are allowed - and for the dynamic case, where items may also depart. We also develop lower bounds for these scenarios both for amortized migration and for worst-case migration showing that our algorithms have nearly optimal migration factor and asymptotic competitive ratio (up to an arbitrary small "). We therefore resolve the competitiveness of the bin covering problem with migration.

关键词： online algorithms dynamic algorithms competitive ratio bin covering migration factor

来源：评论

学校读者我要写书评

暂无评论

MAINTAINING SHORTEST PATHS UNDER DELETIONS IN WEIGHTED DIRECTED GRAPHS 13

MAINTAINING SHORTEST PATHS UNDER DELETIONS IN WEIGHTED DIREC...

引用

45th Annual ACM Symposium on the Theory of Computing (STOC)

作者： Bernstein, Aaron Columbia Univ Dept Comp Sci New York NY 10027 USA

ISBN: (纸本)9781450320290

We present an improved algorithm for maintaining all-pairs (1 + epsilon) approximate shortest paths under deletions and weight-increases. The previous state of the art for this problem is total update time (O) over tilde (n(2)root m/epsilon) over all updates for directed unweighted graphs [ S. Baswana, R. Hariharan, and S. Sen, J. algorithms, 62 (2007), pp. 74-92], and (O) over tilde (mn/epsilon) for undirected unweighted graphs [ L. Roditty and U. Zwick, in Proceedings of the 45th FOCS, Rome, Italy, 2004, pp. 499-508]. Both algorithms are randomized and have constant query time. Very recently, Henzinger, Krinninger, and Nanongkai presented a deterministic version of the latter algorithm [ M. Henzinger, S. Krinninger, and D. Nanongkai, in IEEE FOCS, 2013, pp. 538-547]. Note that (O) over tilde (mn) is a natural barrier because even with a (1 + epsilon) approximation, there is no o(mn) combinatorial algorithm for the static all-pairs shortest path problem. Our algorithm works on directed weighted graphs and has total (randomized) update time (O) over tilde (mn log R/epsilon) where R is the ratio of the largest edge weight to appear at any point in the update sequence to the smallest such weight. (As with previous algorithms, our query time is constant.) Technically, the running time is (O) over tilde (mn log R/epsilon) + O(Delta), where Delta is the total number of updates;the same O(Delta) term is also implicitly present in all other algorithms for the problem, since a constant time per update is clearly unavoidable. Note that log R = O(log(n)) as long as weights are polynomial in n;thus, we effectively expand the (O) over tilde (mn/epsilon) total update time bound from undirected unweighted graphs to directed graphs with polynomial weights. This is in fact the first nontrivial algorithm for decremental all-pairs shortest paths that works on weighted graphs (previous algorithms could only handle small integer weights). By a well-known reduction from decremental algo

关键词： graph algorithms dynamic algorithms approximation shortest paths

来源：评论

学校读者我要写书评

暂无评论

Memory Management for Self-Adjusting Computation 08

Memory Management for Self-Adjusting Computation

引用

International Symposium on Memory Management

作者： Hammer, Matthew A. Acar, Umut A. Toyota Technol Inst Chicago IL USA

ISBN: (纸本)9781605581347

The cost of reclaiming,pace with traversal-based garbage collection is inversely proportional to the amount of free memory, i.e., O(1 /(1 - f)), where f is the fraction of memory that is live. Consequently, the cost of garbage collection can be very high when the size of the live data remains large relative to the available free space. Intuitively, this is because allocating it small amount of memory,pace will require the garbage collector to traverse a fraction of the memory only to discover little garbage. This is unfortunate because in some application domains the size of the memory-resident data can be generally high. This can cause high GC overheads, especially when generational assumptions do not hold. One Such application domain is self-adjusting computation, where computations use memory-resident execution traces ill order to respond to changes to their state (e.g., inputs) efficiently. This paper proposes memory-management techniques for self-adjusting computation that remain efficient even when the size of the live data is large. More precisely, the proposed techniques guarantee O(1) amortized cost for each reclaimed memory object. We propose it set of primitives for self-adjusting computation that support the proposed memory management techniques. The primitives provide in operation for allocating memory: we reclaim unused memory automatically. We implement it library for supporting the primitives in the C language and perform an experimental evaluation. Our experiments show that the approach can be implemented with reasonably small constant-factor overheads and that the programs written using the library behave optimally. Compared to previous implementations, We measure up to all order of magnitude improvement in performance and up to it 75% reduction in space usage.

关键词： Self-adjusting computation memory management garbage collection memoization dynamic dependence graphs dynamic algorithms computational geometry performance

来源：评论

学校读者我要写书评

暂无评论

Faster betweenness centrality updates in evolving networks 16

Faster betweenness centrality updates in evolving networks

引用

16th Symposium on Experimental algorithms, SEA 2017

作者： Bergamini, Elisabetta Meyerhenke, Henning Ortmann, Mark Slobbe, Arie Karlsruhe Germany University of Konstanz Konstanz Germany Australian National University Canberra Australia

ISBN: (纸本)9783959770361

Finding central nodes is a fundamental problem in network analysis. Betweenness centrality is a well-known measure which quantifies the importance of a node based on the fraction of shortest paths going though it. Due to the dynamic nature of many today's networks, algorithms that quickly update centrality scores have become a necessity. For betweenness, several dynamic algorithms have been proposed over the years, targeting different update types (incremental- and decremental-only, fully-dynamic). In this paper we introduce a new dynamic algorithm for updating betweenness centrality after an edge insertion or an edge weight decrease. Our method is a combination of two independent contributions: a faster algorithm for updating pairwise distances as well as number of shortest paths, and a faster algorithm for updating dependencies. Whereas the worst-case running time of our algorithm is the same as recomputation, our techniques considerably reduce the number of operations performed by existing dynamic betweenness algorithms. Our experimental evaluation on a variety of real-world networks reveals that our approach is significantly faster than the current state-of-the-art dynamic algorithms, approximately by one order of magnitude on average. © Elisabetta Bergamini, Henning Meyerhenke, Mark Ortmann, and Arie Slobbe.

关键词： Distances dynamic algorithms Graph algorithms Shortest paths

来源：评论

学校读者我要写书评

暂无评论

On-line and dynamic estimation of Rician fading channels in GSM-R networks

On-line and dynamic estimation of Rician fading channels in ...

引用

International Conference on Wireless Communications and Signal Processing (WCSP)

作者： Yongsen Ma Pengyuan Du Xiaofeng Mao Chengnian Long Department of Automation Key Laboratory of System Control and Information Processing Ministry of Education Shanghai Jiaotong University China Department of Electronic Engineering Shanghai Jiaotong University China

ISBN: (纸本)9781467358309

The on-line and dynamic estimation algorithm for Rician fading channels in GSM-R networks is proposed, which is an expansion of local mean power estimation of Rayleigh fading channels. The proper length of statistical interval and required number of averaging samples are determined which are adaptive to different propagation environments. It takes advantage of the sampling signals and Rician fading parameters of last estimation to reduce measurement overhead. The performance of this method was evaluated by measurement experiment along the Beijing-Shanghai high-speed railway. When it is NLOS propagation, the required sampling intervals can be increased from 1.1λ in Lee's method to 3.7λ of the on-line and dynamic algorithm. And the sampling interval can be set up to 12λ although the length of statistical interval decreases when there is LOS signal, which can reduce the measurement overhead significantly. The algorithm can be applied in coverage assessment with lower measurement overhead, and in dynamic and adaptive allocation of wireless resource.

关键词： dynamic Estimation Rician Rician fading channels Rician fading IN-LINE dynamic dynamic algorithms sampling interval Self tuning

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共19页 << < 10 11 12 13 14 15 16 17 18 19 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：