咨询与建议

限定检索结果

文献类型

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

馆藏范围

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

日期分布

学科分类号

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

主题

  • 190 篇 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...

语言

  • 180 篇 英文
  • 9 篇 其他
  • 1 篇 中文
检索条件"主题词=Dynamic Algorithms"
190 条 记 录,以下是111-120 订阅
排序:
A loop-free shortest-path routing algorithm for dynamic networks
收藏 引用
THEORETICAL COMPUTER SCIENCE 2014年 516卷 1-19页
作者: D'Angelo, Gianlorenzo D'Emidio, Mattia Frigioni, Daniele Univ Perugia Dept Math & Informat I-06123 Perugia Italy Univ Laquila Dept Informat Engn Comp Sci & Math I-67100 Laquila Italy
This work introduces Loop-Free Routing (LFR), a new loop-free distance-vector routing algorithm, which is able to update the shortest paths of a distributed network in fully dynamic scenarios. This work also provides ... 详细信息
来源: 评论
Popular conjectures imply strong lower bounds for dynamic problems  55
Popular conjectures imply strong lower bounds for dynamic pr...
收藏 引用
55th Annual IEEE Symposium on Foundations of Computer Science (FOCS)
作者: Abboud, Amir Williams, Virginia Vassilevska Stanford Univ Dept Comp Sci Palo Alto CA 94304 USA
We consider several well-studied problems in dynamic algorithms and prove that sufficient progress on any of them would imply a breakthrough on one of five major open problems in the theory of algorithms: 1) Is the 3S... 详细信息
来源: 评论
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
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 ... 详细信息
来源: 评论
Doppler frequency estimation-based handover algorithm for long-term evolution networks
收藏 引用
IET NETWORKS 2014年 第2期3卷 88-96页
作者: Altrad, Omar Muhaidat, Sami Yoo, Paul D. Simon Fraser Univ Burnaby BC Canada Khalifa Univ Abu Dhabi U Arab Emirates Univ Surrey CCSR Guildford Surrey England
Mobile cellular radio systems have become complex multi-layered systems with a mixed architecture of macro and micro cells;therefore, a dynamic method of triggering the handover algorithm in such systems is invaluable... 详细信息
来源: 评论
Simple Deterministic algorithms for Fully dynamic Maximal Matching  13
Simple Deterministic Algorithms for Fully Dynamic Maximal Ma...
收藏 引用
45th Annual ACM Symposium on the Theory of Computing (STOC)
作者: Neiman, Ofer Solomon, Shay Ben Gurion Univ Negev POB 653 IL-84105 Beer Sheva Israel Weizmann Inst Sci IL-76100 Rehovot Israel
A maximal matching can be maintained in fully dynamic (supporting both addition and deletion of edges) n-vertex graphs using a trivial deterministic algorithm with a worst case update time of 0(n). No deterministic al... 详细信息
来源: 评论
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
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 ca... 详细信息
来源: 评论
Engineering a New Algorithm for Distributed Shortest Paths on dynamic Networks
收藏 引用
ALGORITHMICA 2013年 第1期66卷 51-86页
作者: Cicerone, Serafino D'Angelo, Gianlorenzo Di Stefano, Gabriele Frigioni, Daniele Maurizio, Vinicio Univ Aquila Dept Elect & Informat Engn I-67100 Laquila Italy MASCOTTE Project I3S CNRS UNSA INRIA F-06902 Sophia Antipolis France
We study the problem of dynamically updating all-pairs shortest paths in a distributed network while edge update operations occur to the network. We consider the practical case of a dynamic network in which an edge up... 详细信息
来源: 评论
Based on MG-OXC Routing and Multi-Granularity Assignment Algorithm
Based on MG-OXC Routing and Multi-Granularity Assignment Alg...
收藏 引用
Cross Strait Quad-Regional Radio Science and Wireless Technology Conference (CSQRWC)
作者: Wang Jianzhong Zhang Ping Sichuan Normal Univ Coll Fundamental Educ Chengdu 610068 Peoples R China
In this paper we focuses on the optimal design of Multi-Granularity optical Cross-connect (MG-OXC) node based on three stage (fiber, waveband, and wavelength) multiplexing scheme and dynamic algorithm (including routi... 详细信息
来源: 评论
Recursive algorithms for phylogenetic tree counting
收藏 引用
algorithms FOR MOLECULAR BIOLOGY 2013年 第1期8卷 26-26页
作者: Gavryushkina, Alexandra Welch, David Drummond, Alexei J. Univ Auckland Dept Comp Sci Auckland 1 New Zealand Univ Auckland Allan Wilson Ctr Mol Ecol & Evolut Auckland 1 New Zealand
Background: In Bayesian phylogenetic inference we are interested in distributions over a space of trees. The number of trees in a tree space is an important characteristic of the space and is useful for specifying pri... 详细信息
来源: 评论
dynamic APPROXIMATE ALL-PAIRS SHORTEST PATHS IN UNDIRECTED GRAPHS
收藏 引用
SIAM JOURNAL ON COMPUTING 2012年 第3期41卷 670-683页
作者: Roditty, Liam Zwick, Uri Bar Ilan Univ Dept Comp Sci IL-52900 Ramat Gan Israel Tel Aviv Univ Sch Comp Sci IL-69978 Tel Aviv Israel
We obtain three new dynamic algorithms for the approximate all-pairs shortest paths problem in unweighted undirected graphs: (i) For any fixed epsilon > 0, a decremental algorithm with an expected total running tim... 详细信息
来源: 评论