咨询与建议

限定检索结果

文献类型

  • 66 篇 期刊文献
  • 41 篇 会议
  • 3 篇 学位论文
  • 1 册 图书

馆藏范围

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

日期分布

学科分类号

  • 91 篇 工学
    • 73 篇 计算机科学与技术...
    • 18 篇 电气工程
    • 17 篇 软件工程
    • 10 篇 控制科学与工程
    • 9 篇 信息与通信工程
    • 3 篇 机械工程
    • 3 篇 电子科学与技术(可...
    • 2 篇 力学(可授工学、理...
    • 2 篇 材料科学与工程(可...
    • 2 篇 土木工程
    • 2 篇 生物工程
    • 1 篇 动力工程及工程热...
    • 1 篇 建筑学
    • 1 篇 测绘科学与技术
    • 1 篇 地质资源与地质工...
    • 1 篇 矿业工程
    • 1 篇 石油与天然气工程
    • 1 篇 航空宇航科学与技...
  • 44 篇 理学
    • 37 篇 数学
    • 3 篇 生物学
    • 1 篇 物理学
    • 1 篇 地理学
    • 1 篇 大气科学
    • 1 篇 地球物理学
    • 1 篇 地质学
    • 1 篇 系统科学
    • 1 篇 统计学(可授理学、...
  • 14 篇 管理学
    • 12 篇 管理科学与工程(可...
    • 2 篇 工商管理
  • 4 篇 医学
  • 1 篇 法学
    • 1 篇 法学
  • 1 篇 军事学

主题

  • 111 篇 dynamic algorith...
  • 6 篇 graph algorithm
  • 6 篇 shortest path
  • 4 篇 planar graph
  • 3 篇 graph
  • 3 篇 computational ge...
  • 3 篇 graph theory
  • 3 篇 channel assignme...
  • 3 篇 point location
  • 2 篇 experimentation
  • 2 篇 clustering
  • 2 篇 graph algorithms
  • 2 篇 distributed algo...
  • 2 篇 load balancing
  • 2 篇 delaunay triangu...
  • 2 篇 algorithms
  • 2 篇 core network
  • 2 篇 efficiency
  • 2 篇 l(2,1)-labeling
  • 2 篇 convergence

机构

  • 3 篇 beijing inst tec...
  • 3 篇 brown univ dept ...
  • 2 篇 univ copenhagen ...
  • 2 篇 max planck inst ...
  • 2 篇 univ copenhagen ...
  • 2 篇 rutgers univ new...
  • 2 篇 univ warsaw wars...
  • 2 篇 kings coll londo...
  • 1 篇 univ sci & techn...
  • 1 篇 nanjing universi...
  • 1 篇 adaplab llc
  • 1 篇 univ vienna fac ...
  • 1 篇 univ utah sch me...
  • 1 篇 vellammal engn c...
  • 1 篇 graduate school ...
  • 1 篇 natl univ singap...
  • 1 篇 graz univ igam i...
  • 1 篇 queens univ belf...
  • 1 篇 dalian univ tech...
  • 1 篇 georgia inst tec...

作者

  • 5 篇 tamassia r
  • 4 篇 zaroliagis cd
  • 4 篇 vesel a
  • 3 篇 sankowski piotr
  • 3 篇 frigioni daniele
  • 3 篇 ma zhongjing
  • 3 篇 gutenberg maximi...
  • 3 篇 wulff-nilsen chr...
  • 3 篇 bernstein aaron
  • 2 篇 saha barna
  • 2 篇 lacki jakub
  • 2 篇 klavzar s
  • 2 篇 zou suli
  • 2 篇 pantziou ge
  • 2 篇 van den brand ja...
  • 2 篇 italiano giusepp...
  • 2 篇 chaudhuri s
  • 2 篇 perry john
  • 2 篇 zaroliagis chris...
  • 2 篇 cohen rf

语言

  • 104 篇 英文
  • 6 篇 其他
  • 1 篇 中文
检索条件"主题词=Dynamic Algorithm"
111 条 记 录,以下是31-40 订阅
排序:
Systematic Review:Load Balancing in Cloud Computing by Using Metaheuristic Based dynamic algorithms
收藏 引用
Intelligent Automation & Soft Computing 2024年 第3期39卷 437-476页
作者: Darakhshan Syed Ghulam Muhammad Safdar Rizvi Department of Computer Science Bahria UniversityKarachi CampusKarachiPakistan
Cloud Computing has the ability to provide on-demand access to a shared resource *** has completely changed the way businesses are managed,implement applications,and provide *** rise in popularity has led to a signifi... 详细信息
来源: 评论
Fast RankCIus algorithm via dynamic Rank Score Tracking on Bi-type Information Networks  2019
Fast RankCIus Algorithm via Dynamic Rank Score Tracking on B...
收藏 引用
Proceedings of the 21st International Conference on Information Integration and Web-based Applications & Services
作者: Kotaro Yamazaki Shohei Matsugu Hiroaki Shiokawa Hiroyuki Kitagawa Graduate School of SIE University of Tsukuba Center for Computational Sciences University of Tsukuba
Given a bi-type information network, which is an extended model of well-known bipartite graphs, how can clusters be efficiently found in graphs? Graph clustering is now a fundamental tool to understand overviews from ... 详细信息
来源: 评论
New lower bound techniques for dynamic partial sums and related problems
收藏 引用
SIAM JOURNAL ON COMPUTING 2003年 第3期32卷 736-753页
作者: Husfeldt, T Rauhe, T Lund Univ Dept Comp Sci SE-22100 Lund Sweden Univ Copenhagen IT DK-2400 Copenhagen NV Denmark
We study the complexity of the dynamic partial sum problem in the cell-probe model. We give the model access to nondeterministic queries and prove that the problem remains hard. We give the model access to the right a... 详细信息
来源: 评论
A TOPOLOGICAL APPROACH TO dynamic GRAPH CONNECTIVITY
收藏 引用
INFORMATION PROCESSING LETTERS 1987年 第1期25卷 65-70页
作者: REIF, JH HARVARD UNIV DIV APPL SCIAIKEN COMPUTAT LABCAMBRIDGEMA 02138
A dynamic connectivity problem consists of an initial graph, and a sequence of operations consisting of graph modifications and graph connectivity tests. The size n of the problem is the sum of the maximum number of v... 详细信息
来源: 评论
dynamic Clustering to Minimize the Sum of Radii
收藏 引用
algorithmICA 2020年 第11期82卷 3183-3194页
作者: Henzinger, Monika Leniowski, Dariusz Mathieu, Claire Univ Vienna Fac Comp Sci Vienna Austria Univ Paris IRIF CNRS Paris France
In this paper, we study the problem of opening centers to cluster a set of clients in a metric space so as to minimize the sum of the costs of the centers and of the cluster radii, in a dynamic environment where clien... 详细信息
来源: 评论
Approximating dynamic Weighted Vertex Cover with Soft Capacities
收藏 引用
algorithmICA 2022年 第1期84卷 124-149页
作者: Wei, Hao-Ting Hon, Wing-Kai Horn, Paul Liao, Chung-Shou Sadakane, Kunihiko Natl Tsing Hua Univ Dept Ind Engn & Engn Management Hsinchu 30013 Taiwan Natl Tsing Hua Univ Dept Comp Sci Hsinchu 30013 Taiwan Univ Denver Dept Math Denver CO USA Univ Tokyo Dept Math Informat Tokyo Japan
This study considers the soft capacitated vertex cover problem in a dynamic setting. This problem generalizes the dynamic model of the vertex cover problem, which has been intensively studied in recent years. Given a ... 详细信息
来源: 评论
Energy-Efficient Iterative Refinement Using dynamic Precision
收藏 引用
IEEE JOURNAL ON EMERGING AND SELECTED TOPICS IN CIRCUITS AND SYSTEMS 2018年 第4期8卷 722-735页
作者: Lee, JunKyu Vandierendonck, Hans Arif, Mahwish Peterson, Gregory D. Nikolopoulose, Dimitrios S. Queens Univ Belfast Inst Elect Commun & Informat Technol Belfast BT7 1NN Antrim North Ireland Univ Tennessee Elect Engn & Comp Sci Knoxville TN 37996 USA
Mixed precision is a promising approach to save energy in iterative refinement algorithms since it obtains speed-up without necessitating additional cores and parallelization. However, conventional mixed precision met... 详细信息
来源: 评论
A fully dynamic approximation scheme for shortest paths in planar graphs
收藏 引用
algorithmICA 1998年 第3期22卷 235-249页
作者: Klein, PN Subramanian, S Brown Univ Providence RI 02912 USA
In this paper we give a fully dynamic approximation scheme for maintaining all-pairs shortest paths in planar networks. Given an error parameter epsilon such that 0 < epsilon, our algorithm maintains approximate al... 详细信息
来源: 评论
Adaptive Scheduling of Task Graphs with dynamic Resilience
收藏 引用
IEEE TRANSACTIONS ON COMPUTERS 2017年 第1期66卷 17-23页
作者: Hu, Menglan Luo, Jun Wang, Yang Veeravalli, Bharadwaj Huazhong Univ Sci & Technol Sch Elect Informat & Commun Wuhan 430074 Hubei Peoples R China Nanyang Technol Univ Sch Comp Engn 50 Nanyang Ave Singapore 639798 Singapore Chiniese Acad Sci Shenzhen Inst Adv Technol Dept Comp Sci Shenzhen 518055 Guangdong Peoples R China Natl Univ Singapore Dept Elect & Comp Engn Singapore 117576 Singapore
This paper studies a scheduling problem of task graphs on a non-dedicated networked computing platform. The networked platform is characterized by a set of fully connected processors such as a multiprocessor system th... 详细信息
来源: 评论
Kinetic and dynamic Delaunay tetrahedralizations in three dimensions
收藏 引用
COMPUTER PHYSICS COMMUNICATIONS 2004年 第1期162卷 9-23页
作者: Schaller, G Meyer-Hermann, M Tech Univ Dresden Inst Theoret Phys D-01062 Dresden Germany
We describe algorithms to implement fully dynamic and kinetic three-dimensional unconstrained Delatmay triangulations, where the time evolution of the triangulation is not only governed by moving vertices but also by ... 详细信息
来源: 评论