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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入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 条记录，以下是91-100 订阅

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

详细简洁

排序：

dynamic Deterministic Constant-Approximate Distance Oracles with n^ε Worst-Case Update Time 65

Dynamic Deterministic Constant-Approximate Distance Oracles ...

引用

65th Symposium on Foundations of Computer Science

作者： Haeupler, Bernhard Long, Yaowei Saranurak, Thatchaphol Univ Sofia St Kliment Ohridski INSAIT Sofia Bulgaria Swiss Fed Inst Technol Zurich Switzerland Univ Michigan Ann Arbor MI USA

ISBN: (纸本)9798331516758;9798331516741

We present a new distance oracle in the fully dynamic setting: given a weighted undirected graph G = (V;E) with n vertices undergoing both edge insertions and deletions, and an arbitrary parameter epsilon is an element of [1/log(c) n, 1] where c > 0 is a small constant, we can deterministically maintain a data structure with O(n(c)) worst-case update time that, given any pair of vertices (u;v), returns a 2(poly(1/epsilon)) -approximate distance between u and v in poly(1/epsilon) log log n query time. Our algorithm significantly advances the state-of-the-art in two aspects, both for fully dynamic algorithms and even decremental algorithms. First, no existing algorithm with worst-case update time guarantees a o(n)-approximation while also achieving an n(2-Omega(1)) update and n(o(1)) query time, while our algorithm offers a constant O-epsilon(1)-approximation with O(n(epsilon)) update time and O-epsilon(log log n) query time. Second, even if amortized update time is allowed, it is the first deterministic constant-approximation algorithm with n(1-Omega(1)) update and query time. The best result in this direction is the recent deterministic distance oracle by Chuzhoy and Zhang [STOC 2023] which achieves an approximation of (log log n)(2O(1/epsilon 3)) with amortized update time of O(n(epsilon)) and query time of 2(poly(1/epsilon)) log n log log n. We obtain the result by dynamizing tools related to lengthconstrained expanders [Haeupler-Racke-Ghaffari, STOC 2022;Haeupler-Hershkowitz-Tan, FOCS 2024]. Our technique completely bypasses the 40-year-old Even-Shiloach tree, which has remained the most pervasive tool in the area but is inherently amortized.

关键词： Graph algorithms dynamic algorithms Distance Oracles

来源：评论

学校读者我要写书评

暂无评论

A New Deterministic Algorithm for dynamic Set Cover 60

A New Deterministic Algorithm for Dynamic Set Cover

引用

60th IEEE Annual Symposium on Foundations of Computer Science (FOCS)

作者： Bhattacharya, Sayan Henzinger, Monika Nanongkai, Danupon Univ Warwick Coventry W Midlands England Univ Vienna Vienna Austria KTH Royal Inst Technol Stockholm Sweden

ISBN: (纸本)9781728149523

We present a deterministic dynamic algorithm for maintaining a (1 + epsilon) f-approximate minimum cost set cover with O(f log(Cn)/epsilon(2)) amortized update time, when the input set system is undergoing element insertions and deletions. Here, n denotes the number of elements, each element appears in at most f sets, and the cost of each set lies in the range [1/C, 1]. Our result, together with that of Gupta et al. [STOC'17], implies that there is a deterministic algorithm for this problem with O(f log(Cn)) amortized update time and O(min(log n, f))-approximation ratio, which nearly matches the polynomial-time hardness of approximation for minimum set cover in the static setting. Our update time is only O(log(Cn)) away from a trivial lower bound. Prior to our work, the previous best approximation ratio guaranteed by deterministic algorithms was O(f(2)), which was due to Bhattacharya et al. [ICALP'15]. In contrast, the only result that guaranteed O(f)-approximation was obtained very recently by Abboud et al. [STOC'19], who designed a dynamic algorithm with (1+epsilon) f-approximation ratio and O(f(2) log n/E) amortized update time. Besides the extra O(f) factor in the update time compared to our and Gupta et al.'s results, the Abboud et al. algorithm is randomized, and works only when the adversary is oblivious and the sets are unweighted (each set has the same cost). We achieve our result via the primal-dual approach, by maintaining a fractional packing solution as a dual certificate. This approach was pursued previously by Bhattacharya et al. and Gupta et al., but not in the recent paper by Abboud et al. Unlike previous primal-dual algorithms that try to satisfy some local constraints for individual sets at all time, our algorithm basically waits until the dual solution changes significantly globally, and fixes the solution only where the fix is needed.

关键词： data structures dynamic algorithms set cover matching

来源：评论

学校读者我要写书评

暂无评论

dynamic Phylogenetic Inference for Sequence-based Typing Data 17

Dynamic Phylogenetic Inference for Sequence-based Typing Dat...

引用

8th ACM International Conference on Bioinformatics, Computational Biology,and Health Informatics (ACM-BCB)

作者： Francisco, Alexandre P. Nascimento, Marta Vaz, Catia Univ Lisbon INESC ID IST Lisbon Portugal Polythen Inst Lisbon INESC ID ISEL Lisbon Portugal

ISBN: (纸本)9781450347228

Typing methods are widely used in the surveillance of infectious diseases, outbreaks investigation and studies of the natural history of an infection. And their use is becoming standard, in particular with the introduction of High Throughput Sequencing (HTS). On the other hand, the data being generated is massive and many algorithms have been proposed for phylogenetic analysis of typing data, such as the goeBURST algorithm. These algorithms must however be run whenever new data becomes available starting from scratch. We address this issue proposing a dynamic version of goeBURST algorithm. Experimental results show that this new version is efficient on integrating new data and updating inferred evolutionary patterns, improving the update running time by at least one order of magnitude.

关键词： phylogenetic inference phylogenetic trees dynamic algorithms sequence-based typing data

来源：评论

学校读者我要写书评

暂无评论

dynamic mechanism design

Dynamic mechanism design

引用

2nd International Workshop on Internet and Network Economic

作者： Bilo, Davide Guala, Luciano Proietti, Guido ETH Inst Theoret Informat Zurich Switzerland Univ Roma Tor Vergata Dipartimento Matemat I-00133 Rome Italy Univ Aquila Dipartimento Informat I-67100 Laquila Italy CNR Ist Anal Sistemi & Informat A Ruberti Rome Italy

ISBN: (纸本)3540681388

In this paper we address the question of designing truthful mechanisms for solving optimization problems on dynamic graphs with selfish edges. More precisely, we are given a graph G of n nodes, and we assume that each edge of G is owned by a selfish agent. The strategy of an agent consists in revealing to the system - at each time instant - the cost at the actual time for using its edge. Additionally, edges can enter into and exit from G. Among the various possible assumptions which can be made to model how this edge-cost modifications take place, we focus on two settings: (i) the dynamic. in which modifications can happen at any time, and for a given optimization problem on G, the mechanism has to maintain efficiently the output specification and the payment scheme for the agents;(ii) the time-sequenced, in which modifications happens at fixed time steps, and the mechanism has to minimize an objective function which takes into consideration both the quality and the set-up cost of a new solution. In both settings, we investigate the existence of exact and approximate truthful (w.r.t. to suitable equilibrium concepts) mechanisms. In particular, for the dynamic setting, we analyze the minimum spanning tree problem. and we show that if edge costs can only decrease and each agent adopts a myopic best response strategy (i.e., its utility is only measured instantaneously), then there exists an efficient dynamic truthful (in myopic best response equilibrium) mechanism for handling a sequence of k declarations of edge-cost reductions having runtime O((h + k) log n), where h is the overall number of payment changes. (C) 2008 Elsevier B.V. All rights reserved.

关键词： Algorithmic mechanism design Truthful mechanisms Approximate mechanisms On-line problems dynamic algorithms

来源：评论

学校读者我要写书评

暂无评论

Maintaining the Visibility Graph of a dynamic Simple Polygon 1

引用

5th International Conference on 5th International Conference on algorithms and Discrete Applied Mathematics (CALDAM)

作者： Choudhury, Tameem Inkulu, R. IIT Guwahati Dept Comp Sci & Engn Gauhati India

ISBN: (数字)9783030115098

ISBN: (纸本)9783030115098;9783030115081

We devise a fully-dynamic algorithm for maintaining the visibility graph of a given simple polygon P amid vertex insertions and deletions to the simple polygon. Our algorithm takes O(k(lg n')2) worst-case time to update the visibility graph when a vertex is inserted to the current simple polygon P', or when a vertex is deleted from P'. Here, k is the number of combinatorial changes needed to the visibility graph due to the insertion (resp. deletion) of a vertex v to P', and n' is the number of vertices of P'. This algorithm preprocesses the initial simple polygon P to build few data structures, including the visibility graph of P. Further, as part of efficiently updating the visibility graph, a fully-dynamic algorithm is designed to compute the vertices of the current simple polygon that are visible from a query point.

关键词： Computational geometry Visibility dynamic algorithms

来源：评论

学校读者我要写书评

暂无评论

The Complexity of dynamic Least-Squares Regression 64

The Complexity of Dynamic Least-Squares Regression

引用

64th Annual IEEE Symposium on the Foundations of Computer Science (FOCS)

作者： Jiang, Shunhua Peng, Binghui Weinstein, Omri Columbia Univ Dept Comp Sci New York NY 10027 USA Hebrew Univ Jerusalem Dept Comp Sci Jerusalem Israel

ISBN: (纸本)9798350318944

We settle the complexity of dynamic least-squares regression (LSR), where rows and labels (A((t)), b((t))) can be adaptively inserted and/or deleted, and the goal is to efficiently maintain an epsilon-approximate solution to min(x(t)) parallel to A((t)) x((t)) - b((t))parallel to(2) for all t is an element of [T]. We prove sharp separations (d(2-o(1)) vs. similar to d) between the amortized update time of: (i) Fully vs. Partially dynamic 0.01-LSR;(ii) High vs. low-accuracy LSR in the partially-dynamic (insertion-only) setting. Our lower bounds follow from a gap-amplification reduction-reminiscent of iterative refinement-from the exact version of the Online Matrix Vector Conjecture (OMv) [HKNS15], to constant approximate OMv over the reals, where the i-th online product Hv((i)) only needs to be computed to 0.1-relative error. All previous fine-grained reductions from OMv to its approximate versions only show hardness for inverse polynomial approximation epsilon = n(-omega(1)) (additive or multiplicative). This result is of independent interest in fine-grained complexity and for the investigation of the OMv Conjecture, which is still widely open.

关键词： Numerical linear algebra dynamic algorithms fine-grained complexity

来源：评论

学校读者我要写书评

暂无评论

Fully dynamic k-Clustering with Fast Update Time and Small Recourse 65

Fully Dynamic k-Clustering with Fast Update Time and Small R...

引用

65th Symposium on Foundations of Computer Science

作者： Bhattacharya, Sayan Costa, Martin Garg, Naveen Lattanzi, Silvio Parotsidis, Nikos Univ Warwick Coventry W Midlands England IIT Delhi Delhi India Google Res Zurich Switzerland

ISBN: (纸本)9798331516758;9798331516741

In the dynamic metric k-median problem, we wish to maintain a set of k centers S subset of V in an input metric space (V, d) that gets updated via point insertions/deletions, so as to minimize the objective Sigma(x is an element of V) min(y is an element of S) d(x, y). The quality of a dynamic algorithm is measured in terms of its approximation ratio, "recourse" (the number of changes in S per update) and "update time" (the time it takes to handle an update). The ultimate goal in this line of research is to obtain a dynamic O(1) approximation algorithm with (O) over tilde (1) recourse and (O) over tilde (k) update time. dynamic k-median is a canonical example of a class of problems known as dynamic k-clustering, that has received significant attention in recent years [Fichtenberger et al, SODA'21], [Bateni et al, SODA'23], [Lacki et al, SODA'24]. To the best of our knowledge, however, all these previous papers either attempt to minimize the algorithm's recourse while ignoring its update time, or minimize the algorithm's update time while ignoring its recourse. For dynamic k-median in particular, the state-of-the-art results get (O) over tilde (k(2)) update time and O(k) recourse [Cohen-Addad et al, ICML'19], [Henzinger and Kale, ESA'20], [Bhattacharya et al, NeurIPS'23]. But, this recourse bound of O(k) can be trivially obtained by recomputing an optimal solution from scratch after every update, provided we ignore the update time. In addition, the update time of (O) over tilde (k(2)) is polynomially far away from the desired bound of (O) over tilde (k). We come arbitrarily close to resolving the main open question on this topic, with the following results. (I) We develop a new framework of randomized local search that is suitable for adaptation in a dynamic setting. For every epsilon > 0, this gives us a dynamic k-median algorithm with O(1/epsilon) approximation ratio, (O) over tilde (k(epsilon)) recourse and (O) over tilde (k(1+epsilon)) update time. This framework

关键词： dynamic algorithms clustering k-median k-means fully dynamic

来源：评论

学校读者我要写书评

暂无评论

dynamic treewidth 64

Dynamic treewidth

引用

64th Annual IEEE Symposium on the Foundations of Computer Science (FOCS)

作者： Korhonen, Tuukka Majewski, Konrad Nadara, Wojciech Pilipczuk, Michal Sokolowski, Marek Univ Bergen Dept Informat Bergen Norway Univ Warsaw Inst Informat Warsaw Poland

ISBN: (纸本)9798350318944

We present a data structure that for a dynamic graph G that is updated by edge insertions and deletions, maintains a tree decomposition of G of width at most 6k + 5 under the promise that the treewidth of G never grows above k. The amortized update time is O-k(2(root log n log log n)), where n is the vertex count of G and the O-k(.) notation hides factors depending on k. In addition, we also obtain the dynamic variant of Courcelle's Theorem: for any fixed property phi expressible in the CMSO2 logic, the data structure can maintain whether G satisfies phi within the same time complexity bounds. To a large extent, this answers a question posed by Bodlaender [WG 1993].

关键词： treewidth parameterized algorithms dynamic algorithms graph algorithms

来源：评论

学校读者我要写书评

暂无评论

Real-time Traffic Signal Control with dynamic Evolutionary Computation 3

Real-time Traffic Signal Control with Dynamic Evolutionary C...

引用

3rd IIAI International Conference on Advanced Applied Informatics (IIAI-AAI)

作者： Zeng, Kai Gong, Yue-Jiao Zhang, Jun Sun Yat Sen Univ Key Lab Machine Intelligence & Adv Comp Educ Dept Guangdong Prov Dept Comp SciMinist EducKey Lab Software Techno Guangzhou 510275 Guangdong Peoples R China

ISBN: (纸本)9781479941735

Nowadays real-time traffic signal control is a crucial issue with potential benefits in the fields of traffic control, environmental pollution, and energy utilization. In the literature, few related studies have been done with dynamic evolutionary algorithms. In this paper, we proposed a strategy using Collaborative Evolutionary-Swarm Optimization (CESO), which is able to track time-varying optimal solutions effectively. We use the simulator of urban mobility (SUMO), a popular traffic simulator to generate traffic flows. A grid traffic network is designed with several scenarios to simulate changes of traffic flows captured by traffic monitors. We test different traffic changes in the network using the proposed strategy and compare its performance with a traditional evolutionary algorithm. Experimental results show that our algorithm can obtain promising configuration of traffic light cycles and reduce the average delay time of all vehicles in various scenarios.

关键词： dynamic algorithms real-time traffic signal control Collaborative Evolutionary-Swarm Optimization (CESO)

来源：评论

学校读者我要写书评

暂无评论

A New dynamic Algorithm for Densest Subhypergraphs 22

A New Dynamic Algorithm for Densest Subhypergraphs

引用

31st ACM Web Conference (WWW)

作者： Bera, Suman K. Bhattacharya, Sayan Choudhari, Jayesh Ghosh, Prantar Katana Graph Austin TX 78705 USA Univ Warwick Coventry W Midlands England Dartmouth Coll Hanover NH 03755 USA

ISBN: (纸本)9781450390965

Computing a dense subgraph is a fundamental problem in graph mining, with a diverse set of applications ranging from electronic commerce to community detection in social networks. In many of these applications, the underlying context is better modelled as a weighted hypergraph that keeps evolving with time. This motivates the problem of maintaining the densest subhypergraph of a weighted hypergraph in a dynamic setting, where the input keeps changing via a sequence of updates (hyperedge insertions/deletions). Previously, the only known algorithm for this problem was due to Hu et al. [19]. This algorithm worked only on unweighted hypergraphs, and had an approximation ratio of (1 + epsilon)r(2) and an update time of O(poly(r, log n)), where r denotes the maximum rank of the input across all the updates. We obtain a new algorithm for this problem, which works even when the input hypergraph is weighted. Our algorithm has a significantly improved (near-optimal) approximation ratio of (1 + epsilon) that is independent of r, and a similar update time of O(poly(r, log n)). It is the first (1 + epsilon)-approximation algorithm even for the special case of weighted simple graphs. To complement our theoretical analysis, we perform experiments with our dynamic algorithm on large-scale, real-world data-sets. Our algorithm significantly outperforms the state of the art [19] both in terms of accuracy and efficiency.

关键词： hypergraphs densest subgraph dynamic algorithms

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共19页 << < 6 7 8 9 10 11 12 13 14 15 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：