咨询与建议

限定检索结果

文献类型

  • 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 条 记 录,以下是121-130 订阅
排序:
Fully dynamic algorithm for chordal graphs with O(1) query-time and O(n2) update-time
收藏 引用
THEORETICAL COMPUTER SCIENCE 2012年 445卷 82-92页
作者: Mezzini, Mauro Univ Roma La Sapienza Dept Comp Sci Rome Italy
We propose dynamic algorithms and data structures for chordal graphs supporting the following operation: determine if an edge can be added or removed from the graph while preserving the chordality in O(1) time. We sho... 详细信息
来源: 评论
On the Domination Number of Cartesian Product of Two Directed Cycles
收藏 引用
JOURNAL OF APPLIED MATHEMATICS 2013年 第unknown期2013卷 619695-1-619695-7页
作者: Shao, Zehui Zhu, Enqiang Lang, Fangnian Chengdu Univ Sch Informat Sci & Technol Chengdu 610106 Peoples R China Inst Higher Educ Sichuan Prov Key Lab Pattern Recognit & Intelligent Informat Chengdu 610106 Peoples R China Peking Univ Sch Elect Engn & Comp Sci Beijing 100871 Peoples R China
Denote by gamma(G) the domination number of a digraph G and C-m square C-n the Cartesian product of C-m and C-n, the directed cycles of length m, n >= 2. In 2010, Liu et al. determined the exact values of gamma(C-m... 详细信息
来源: 评论
Improved Deterministic algorithms for Decremental Reachability and Strongly Connected Components
收藏 引用
ACM TRANSACTIONS ON algorithms 2013年 第3期9卷 27-27页
作者: Lacki, Jakub Univ Warsaw Inst Informat PL-02097 Warsaw Poland
This article presents a new deterministic algorithm for decremental maintenance of the transitive closure in a directed graph. The algorithm processes any sequence of edge deletions in O(mn) time and answers queries i... 详细信息
来源: 评论
dynamic Boolean Matrix Factorizations
Dynamic Boolean Matrix Factorizations
收藏 引用
12th IEEE International Conference on Data Mining (ICDM)
作者: Miettinen, Pauli Max Planck Inst Informat D-66123 Saarbrucken Germany
Boolean matrix factorization is a method to decompose a binary matrix into two binary factor matrices. Akin to other matrix factorizations, the factor matrices can be used for various data analysis tasks. Many (if not... 详细信息
来源: 评论
On-line and dynamic Estimation of Rician Fading Channels in GSM-R Networks
On-line and Dynamic Estimation of Rician Fading Channels in ...
收藏 引用
4th International Conference on Wireless Communications and Signal Processing (WCSP)
作者: Ma, Yongsen Du, Pengyuan Mao, Xiaofeng Long, Chengnian Shanghai Jiao Tong Univ Minist Educ Dept Automat Key Lab Syst Control & Informat Proc Shanghai 200030 Peoples R China Shanghai Jiao Tong Univ Dept Elect Engn Shanghai Peoples R China
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... 详细信息
来源: 评论
Multi-stage recovery robustness for optimization problems: A new concept for planning under disturbances
收藏 引用
INFORMATION SCIENCES 2012年 190卷 107-126页
作者: Cicerone, Serafino Di Stefano, Gabriele Schachtebeck, Michael Schoebel, Anita Univ Aquila Dept Elect & Informat Engn I-67100 Laquila Italy Univ Gottingen Inst Numer & Appl Math D-3400 Gottingen Germany
In practical optimization problems, disturbances to a given instance are unavoidable due to unpredictable events which can occur when the system is running. In order to face these situations, many approaches have been... 详细信息
来源: 评论
Profit-Maximizing Virtual Machine Trading in a Federation of Selfish Clouds
Profit-Maximizing Virtual Machine Trading in a Federation of...
收藏 引用
IEEE INFOCOM Conference
作者: Hongxing Li Chuan Wu Zongpeng Li Francis C. M. Lau Department of Computer Science The University of Hong Kong Hong Kong Department of Computer Science University of Calgary Canada
The emerging federated cloud paradigm advocates sharing of resources among cloud providers, to exploit temporal availability of resources and diversity of operational costs for job serving. While extensive studies exi... 详细信息
来源: 评论
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
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 posit... 详细信息
来源: 评论
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
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... 详细信息
来源: 评论
Improved dynamic reachability algorithms for directed graphs
收藏 引用
SIAM JOURNAL ON COMPUTING 2008年 第5期37卷 1455-1471页
作者: Roditty, Liam Zwick, Uri Tel Aviv Univ Sch Comp Sci IL-69978 Tel Aviv Israel
We obtain several new dynamic algorithms for maintaining the transitive closure of a directed graph and several other algorithms for answering reachability queries without explicitly maintaining a transitive closure m... 详细信息
来源: 评论