咨询与建议

限定检索结果

文献类型

  • 2,531 册 图书
  • 135 篇 期刊文献

馆藏范围

  • 2,666 篇 电子文献
  • 3 种 纸本馆藏

日期分布

学科分类号

  • 154 篇 工学
    • 147 篇 计算机科学与技术...
    • 38 篇 控制科学与工程
    • 22 篇 软件工程
    • 15 篇 信息与通信工程
    • 12 篇 网络空间安全
    • 2 篇 仪器科学与技术
    • 2 篇 电子科学与技术(可...
  • 46 篇 理学
    • 45 篇 数学
    • 30 篇 系统科学
    • 3 篇 生物学
  • 14 篇 管理学
    • 8 篇 图书情报与档案管...
    • 6 篇 管理科学与工程(可...
  • 1 篇 农学

主题

  • 2,666 篇 computer systems...
  • 1,139 篇 artificial intel...
  • 630 篇 software enginee...
  • 514 篇 information syst...
  • 488 篇 computer applica...
  • 449 篇 computer communi...
  • 338 篇 information syst...
  • 313 篇 data structures ...
  • 293 篇 computer imaging...
  • 291 篇 theory of comput...
  • 276 篇 systems and data...
  • 258 篇 image processing...
  • 230 篇 computing milieu...
  • 200 篇 algorithm analys...
  • 196 篇 software enginee...
  • 192 篇 user interfaces ...
  • 188 篇 mathematics of c...
  • 173 篇 computer hardwar...
  • 172 篇 computers and ed...
  • 171 篇 cryptology

机构

  • 62 篇 tsinghua univers...
  • 38 篇 university of am...
  • 28 篇 eindhoven univer...
  • 27 篇 chinese academy ...
  • 26 篇 democritus unive...
  • 23 篇 university of te...
  • 22 篇 peking universit...
  • 22 篇 shenzhen univers...
  • 21 篇 chongqing univer...
  • 21 篇 university of pi...
  • 20 篇 guangzhou univer...
  • 20 篇 agh university o...
  • 19 篇 huazhong univers...
  • 19 篇 zf friedrichshaf...
  • 19 篇 kingdee internat...
  • 18 篇 zhejiang univers...
  • 18 篇 tecnológico de m...
  • 17 篇 graz university ...
  • 16 篇 purdue universit...
  • 16 篇 sun yat-sen univ...

作者

  • 40 篇 liang-jie zhang
  • 33 篇 jack j. dongarra
  • 31 篇 valeria v. krzhi...
  • 26 篇 peter m. a. sloo...
  • 23 篇 lazaros iliadis
  • 21 篇 constantine step...
  • 20 篇 gregor von ciemi...
  • 18 篇 david romero
  • 18 篇 antonios papaleo...
  • 16 篇 maciej paszynski
  • 15 篇 weizhi meng
  • 14 篇 friedemann bitsc...
  • 14 篇 chrisina jayne
  • 14 篇 jin li
  • 13 篇 luis m. camarinh...
  • 13 篇 margherita anton...
  • 12 篇 michael h. lees
  • 12 篇 ilias maglogiann...
  • 12 篇 plamen angelov
  • 12 篇 ricardo reis

语言

  • 2,567 篇 英文
  • 54 篇 德文
  • 30 篇 其他
  • 15 篇 中文
检索条件"主题词=Computer Systems Organization and Communication Networks"
2666 条 记 录,以下是1-10 订阅
排序:
Indecision and delays are the parents of failure-taming them algorithmically by synthesizing delay-resilient control
收藏 引用
ACTA INFORMATICA 2021年 第5期58卷 497-528页
作者: Chen, Mingshuai Fraenzle, Martin Li, Yangjia Mosaad, Peter N. Zhan, Naijun Rhein Westfal TH Aachen Lehrstuhl Informat 2 Aachen Germany Carl von Ossietzky Univ Oldenburg Dept Comp Sci Oldenburg Germany Univ Tartu Tartu Estonia Chinese Acad Sci Inst Software State Key Lab Comp Sci Beijing Peoples R China Univ Chinese Acad Sci Beijing Peoples R China
The possible interactions between a controller and its environment can naturally be modelled as the arena of a two-player game, and adding an appropriate winning condition permits to specify desirable behavior. The cl... 详细信息
来源: 评论
Finding and Counting Permutations via CSPs
收藏 引用
ALGORITHMICA 2021年 第8期83卷 2552-2577页
作者: Berendsohn, Benjamin Aram Kozma, Laszlo Marx, Daniel Free Univ Berlin Inst Informat Berlin Germany Max Planck Inst Informat Saarland Informat Campus Saarbrucken Germany
Permutation patterns and pattern avoidance have been intensively studied in combinatorics and computer science, going back at least to the seminal work of Knuth on stack-sorting (1968). Perhaps the most natural algori... 详细信息
来源: 评论
TuringMobile: a turing machine of oblivious mobile robots with limited visibility and its applications
收藏 引用
DISTRIBUTED COMPUTING 2022年 第2期35卷 105-122页
作者: Di Luna, Giuseppe A. Flocchini, Paola Santoro, Nicola Viglietta, Giovanni Sapienza Univ Rome DIAG Via Ariosto 25 Rome Italy Univ Ottawa Sch Elect Engn & Comp Sci 800 King Edward Ave Ottawa ON Canada Carleton Univ Sch Comp Sci 1125 Colonel By Dr Ottawa ON Canada JAIST Sch Informat Sci 1-1 Asahidai Nomi City Ishikawa 9231211 Japan
In this paper we investigate the computational power of a set of mobile robots with limited visibility. At each iteration, a robot takes a snapshot of its surroundings, uses the snapshot to compute a destination point... 详细信息
来源: 评论
Producing Genomic Sequences after Genome Scaffolding with Ambiguous Paths: Complexity, Approximation and Lower Bounds
收藏 引用
ALGORITHMICA 2021年 第7期83卷 2063-2095页
作者: Davot, Tom Chateau, Annie Giroudeau, Rodolphe Weller, Mathias Tabary, Dorine CNRS UMR 5506 LIRMM Montpellier France LIGM CNRS Paris France MIPS EA 2332 Mulhouse France
Scaffolding is the final step in assembling Next Generation Sequencing data, in which pre-assembled contiguous regions ("contigs") are oriented and ordered using information that links them (for example, map... 详细信息
来源: 评论
Improved distributed Δ-coloring
收藏 引用
DISTRIBUTED COMPUTING 2021年 第4期34卷 239-258页
作者: Ghaffari, Mohsen Hirvonen, Juho Kuhn, Fabian Maus, Yannic Swiss Fed Inst Technol Zurich Switzerland Aalto Univ Espoo Finland Univ Freiburg Freiburg Germany Technion Haifa Israel
We present a randomized distributed algorithm that computes a Delta-coloring in any non-complete graph with maximum degree Delta >= 4 in O(log Delta)+ 2(O)(root(log log n)) rounds, as well as a randomized algorithm... 详细信息
来源: 评论
Near Isometric Terminal Embeddings for Doubling Metrics
收藏 引用
ALGORITHMICA 2021年 第11期83卷 3319-3337页
作者: Elkin, Michael Neiman, Ofer Ben Gurion Univ Negev Dept Comp Sci Beer Sheva Israel
Given a metric space (X, d), a set of terminals K subset of X, and a parameter 0 < epsilon < 1, we consider metric structures (e.g., spanners, distance oracles, embedding into normed spaces) that preserve distan... 详细信息
来源: 评论
Session-based concurrency, declaratively
收藏 引用
ACTA INFORMATICA 2022年 第1期59卷 35-87页
作者: Cano, Mauricio Lopez, Hugo A. Perez, Jorge A. Rueda, Camilo Univ Groningen Groningen Netherlands Univ Copenhagen Copenhagen Denmark DCR Solut AS Copenhagen Denmark CWI Amsterdam Netherlands Pontificia Univ Javeriana Cali Valle Del Cauca Colombia
Session-based concurrency is a type-based approach to the analysis of message-passing programs. These programs may be specified in an operational or declarative style: the former defines how interactions are properly ... 详细信息
来源: 评论
A New Lower Bound for Classic Online Bin Packing
收藏 引用
ALGORITHMICA 2021年 第7期83卷 2047-2062页
作者: Balogh, Janos Bekesi, Jozsef Dosa, Gyorgy Epstein, Leah Levin, Asaf Univ Szeged Inst Informat Szeged Hungary Univ Pannonia Dept Math Veszprem Hungary Univ Haifa Dept Math Haifa Israel Technion Fac Ind Engn & Management Haifa Israel
We improve the lower bound on the asymptotic competitive ratio of any online algorithm for bin packing to above 1.54278. We demonstrate for the first time the advantage of branching and the applicability of full adapt... 详细信息
来源: 评论
Complement for two-way alternating automata
收藏 引用
ACTA INFORMATICA 2021年 第5期58卷 463-495页
作者: Geffert, Viliam Kapoutsis, Christos A. Zakzok, Mohammad Safarik Univ Dept Comp Sci Kosice Slovakia Carnegie Mellon Univ Qatar Dept Comp Sci Doha Qatar
We consider the problem of converting a two-way alternating finite automaton (2AFA) with n states to a 2AFA accepting the complement of its language. Complementing is trivial for halting2AFAs, by swapping the roles of... 详细信息
来源: 评论
A New Lower Bound for Deterministic Truthful Scheduling
收藏 引用
ALGORITHMICA 2021年 第9期83卷 2895-2913页
作者: Giannakopoulos, Yiannis Hammerl, Alexander Pocas, Diogo Friedrich Alexander Univ Erlangen Nurnberg FAU Erlangen Germany Tech Univ Munich Munich Germany Univ Lisbon LASIGE Fac Ciencias Lisbon Portugal
We study the problem of truthfully scheduling m tasks to n selfish unrelated machines, under the objective of makespan minimization, as was introduced in the seminal work of Nisan and Ronen (in: The 31st Annual ACM sy... 详细信息
来源: 评论