咨询与建议

限定检索结果

文献类型

  • 1,846 篇 会议
  • 975 篇 期刊文献
  • 15 册 图书

馆藏范围

  • 2,836 篇 电子文献
  • 0 种 纸本馆藏

日期分布

学科分类号

  • 1,746 篇 工学
    • 920 篇 计算机科学与技术...
    • 706 篇 信息与通信工程
    • 699 篇 软件工程
    • 412 篇 电子科学与技术(可...
    • 288 篇 电气工程
    • 206 篇 光学工程
    • 188 篇 控制科学与工程
    • 159 篇 仪器科学与技术
    • 106 篇 机械工程
    • 89 篇 动力工程及工程热...
    • 82 篇 生物工程
    • 62 篇 网络空间安全
    • 55 篇 材料科学与工程(可...
    • 50 篇 航空宇航科学与技...
    • 46 篇 生物医学工程(可授...
    • 42 篇 交通运输工程
    • 39 篇 建筑学
    • 38 篇 土木工程
    • 37 篇 化学工程与技术
  • 836 篇 理学
    • 432 篇 数学
    • 294 篇 物理学
    • 149 篇 统计学(可授理学、...
    • 97 篇 生物学
    • 91 篇 系统科学
    • 52 篇 化学
  • 317 篇 管理学
    • 230 篇 管理科学与工程(可...
    • 113 篇 工商管理
    • 96 篇 图书情报与档案管...
  • 55 篇 法学
    • 38 篇 社会学
  • 38 篇 医学
    • 35 篇 临床医学
  • 21 篇 经济学
  • 12 篇 文学
  • 11 篇 军事学
  • 9 篇 农学
  • 4 篇 教育学
  • 2 篇 艺术学

主题

  • 187 篇 computer network...
  • 135 篇 laboratories
  • 104 篇 wireless sensor ...
  • 79 篇 bandwidth
  • 70 篇 computational mo...
  • 63 篇 quality of servi...
  • 59 篇 protocols
  • 55 篇 wireless communi...
  • 54 篇 real time system...
  • 53 篇 throughput
  • 53 篇 interference
  • 51 篇 computer archite...
  • 49 篇 application soft...
  • 49 篇 resource managem...
  • 49 篇 delay
  • 45 篇 wireless network...
  • 44 篇 processor schedu...
  • 43 篇 hardware
  • 42 篇 signal to noise ...
  • 42 篇 energy consumpti...

机构

  • 195 篇 computer enginee...
  • 118 篇 state key labora...
  • 115 篇 state key labora...
  • 81 篇 state key labora...
  • 74 篇 shandong provinc...
  • 56 篇 computer enginee...
  • 49 篇 key laboratory o...
  • 43 篇 peng cheng labor...
  • 42 篇 shandong enginee...
  • 39 篇 computer enginee...
  • 39 篇 state key labora...
  • 36 篇 state key labora...
  • 28 篇 state key labora...
  • 27 篇 state key labora...
  • 27 篇 state key labora...
  • 26 篇 state key labora...
  • 25 篇 eth zurich compu...
  • 22 篇 frontiers scienc...
  • 21 篇 shandong fundame...
  • 21 篇 jiangsu high tec...

作者

  • 114 篇 lothar thiele
  • 69 篇 thiele lothar
  • 47 篇 wattenhofer roge...
  • 45 篇 guo hong
  • 36 篇 wang xingjun
  • 35 篇 xingjun wang
  • 31 篇 zhigang zhang
  • 28 篇 han zhu
  • 27 篇 jian-jia chen
  • 24 篇 hui li
  • 24 篇 zhang zhigang
  • 23 篇 l. thiele
  • 23 篇 zhu han
  • 23 篇 xiang cheng
  • 22 篇 haowen shu
  • 22 篇 zhiping zhou
  • 21 篇 pratyush kumar
  • 21 篇 hong guo
  • 21 篇 jan beutel
  • 21 篇 shu haowen

语言

  • 2,653 篇 英文
  • 99 篇 中文
  • 84 篇 其他
检索条件"机构=Computer Engineering and Networks Laboratory"
2836 条 记 录,以下是191-200 订阅
排序:
Efficient computation of maximal independent sets in unstructured multi-hop radio networks
Efficient computation of maximal independent sets in unstruc...
收藏 引用
2004 IEEE International Conference on Mobile Ad-Hoc and Sensor Systems
作者: Moscibroda, Thomas Wattenhofer, Roger Computer Engineering and Networks Laboratory ETH Zurich 8092 Zurich Switzerland
When being deployed, ad-hoc and sensor networks are unstructured and lack an efficient and reliable communication scheme. Hence, the organization of a MAC layer is the primary goal during and immediately after the dep... 详细信息
来源: 评论
Symmetric clock synchronization in sensor networks
Symmetric clock synchronization in sensor networks
收藏 引用
3rd Workshop on Real-World Wireless Sensor networks, REALWSN 2008
作者: Sommer, Philipp Wattenhofer, Roger Computer Engineering and Networks Laboratory ETH Zurich 8092 Zurich Switzerland
In this paper we argue that achieving symmetric errors is the key to an improved understanding of clock synchronization. We present a clock synchronization algorithm with drift compensation that implements this symmet... 详细信息
来源: 评论
Facility location: Distributed approximation  05
Facility location: Distributed approximation
收藏 引用
24th Annual ACM Symposium on Principles of Distributed Computing, PODC 2005
作者: Moscibroda, Thomas Wattenhofer, Roger Computer Engineering and Networks Laboratory ETH Zurich 8092 Zurich Switzerland
In this paper, we initiate the study of the approximability of the facility location problem in a distributed setting. In particular, we explore a trade-off between the amount of communication and the resulting approx... 详细信息
来源: 评论
Minimizing interference in ad hoc and sensor networks  05
Minimizing interference in ad hoc and sensor networks
收藏 引用
2005 Joint Workshop on Foundations of Mobile Computing, DIALM-POMC 2005
作者: Moscibroda, Thomas Wattenhofer, Roger Computer Engineering and Networks Laboratory ETH Zurich Zurich8092 Switzerland
Reducing interference is one of the main challenges in wireless communication, and particularly in ad hoc networks. The amount of interference experienced by a node v corresponds to the number of other nodes whose tra... 详细信息
来源: 评论
Maximal independent sets in radio networks  05
Maximal independent sets in radio networks
收藏 引用
24th Annual ACM Symposium on Principles of Distributed Computing, PODC 2005
作者: Moscibroda, Thomas Wattenhofer, Roger Computer Engineering and Networks Laboratory ETH Zurich 8092 Zurich Switzerland
We study the distributed complexity of computing a maximal independent set (MIS) in radio networks with completely unknown topology, asynchronous wake-up, and no collision detection mechanism available. Specifically, ... 详细信息
来源: 评论
Bounding the effectiveness of hypervolume-based (μ + λ)-archiving algorithms
Bounding the effectiveness of hypervolume-based (μ + λ)-ar...
收藏 引用
6th International Conference on Learning and Intelligent Optimization, LION 6
作者: Ulrich, Tamara Thiele, Lothar Computer Engineering and Networks Laboratory ETH Zurich Zurich 8092 Switzerland
In this paper, we study bounds for the α-approximate effectiveness of non-decreasing (μ + λ)-archiving algorithms that optimize the hypervolume. A (μ + λ)-archiving algorithm defines how μ individuals are to be ... 详细信息
来源: 评论
Directed graph exploration
Directed graph exploration
收藏 引用
16th International Conference on Principles of Distributed Systems, OPODIS 2012
作者: Förster, Klaus-Tycho Wattenhofer, Roger Computer Engineering and Networks Laboratory ETH Zurich 8092 Zurich Switzerland
We study the problem of exploring all nodes of an unknown directed graph. A searcher has to construct a tour that visits all nodes, but only has information about the parts of the graph it already visited. The goal is... 详细信息
来源: 评论
Approximating fault-tolerant domination in general graphs  10
Approximating fault-tolerant domination in general graphs
收藏 引用
10th Meeting on Analytic Algorithmics and Combinatorics, ANALCO 2013
作者: Foerster, Klaus-Tycho Computer Engineering and Networks Laboratory ETH Zurich Zurich8092 Switzerland
In this paper we study the NP-complete problem of finding small fc-dominating sets in general graphs, which allow κ - 1 nodes to fail and still dominate the graph. The classic minimum dominating set problem is a spec... 详细信息
来源: 评论
Real-time interfaces for composing real-time systems
Real-time interfaces for composing real-time systems
收藏 引用
6th ACM and IEEE International Conference on Embedded Software, EMSOFT 2006
作者: Thiele, Lothar Wandeler, Ernesto Stoimenov, Nikolay Computer Engineering and Networks Laboratory ETH Zurich 8092 Zurich Switzerland
Recently, a number of frameworks were proposed to extend interface theory to the domains of single-processor and distributed real-time systems. This paper unifies some of these approaches and proves properties like re... 详细信息
来源: 评论
On local fixing
On local fixing
收藏 引用
17th International Conference on Principles of Distributed Systems, OPODIS 2013
作者: König, Michael Wattenhofer, Roger Computer Engineering and Networks Laboratory ETH Zurich Zurich 8092 Switzerland
In this paper we look at the difficulty of fixing solutions of classic network problems. We study local changes in graphs (edge resp. node insertion resp. deletion), and network problems (e.g. maximal independent set,... 详细信息
来源: 评论