咨询与建议

限定检索结果

文献类型

  • 64 篇 期刊文献
  • 38 篇 会议
  • 1 篇 学位论文

馆藏范围

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

日期分布

学科分类号

  • 84 篇 工学
    • 76 篇 计算机科学与技术...
    • 15 篇 电气工程
    • 12 篇 软件工程
    • 9 篇 信息与通信工程
    • 1 篇 力学(可授工学、理...
    • 1 篇 控制科学与工程
  • 41 篇 理学
    • 35 篇 数学
    • 6 篇 物理学
    • 2 篇 统计学(可授理学、...
  • 3 篇 医学
    • 3 篇 临床医学
    • 1 篇 基础医学(可授医学...
  • 1 篇 管理学
    • 1 篇 管理科学与工程(可...

主题

  • 103 篇 local algorithms
  • 16 篇 distributed algo...
  • 7 篇 approximation al...
  • 6 篇 coloring
  • 5 篇 mobile robots
  • 5 篇 distributed comp...
  • 5 篇 dominating sets
  • 4 篇 pagerank
  • 3 篇 parallel algorit...
  • 3 篇 unit disk graphs
  • 3 篇 graph algorithms
  • 3 篇 random graphs
  • 3 篇 spectral graph t...
  • 3 篇 heat kernel
  • 3 篇 peer-to-peer
  • 3 篇 community detect...
  • 3 篇 geometric networ...
  • 3 篇 symmetry breakin...
  • 3 篇 sublinear algori...
  • 3 篇 lower bounds

机构

  • 4 篇 eth comp engn & ...
  • 2 篇 lakehead univ de...
  • 2 篇 paderborn univ h...
  • 2 篇 eth comp engn & ...
  • 2 篇 carleton univ sc...
  • 2 篇 cuny ny 10021 us...
  • 2 篇 univ padua padua
  • 2 篇 queens univ sch ...
  • 2 篇 ben gurion univ ...
  • 2 篇 univ paderborn c...
  • 2 篇 bogazici univ de...
  • 2 篇 mit csail cambri...
  • 2 篇 univ helsinki hi...
  • 2 篇 mit dept math ca...
  • 2 篇 polish acad sci ...
  • 2 篇 open univ israel...
  • 2 篇 univ helsinki hi...
  • 2 篇 tel aviv univ sc...
  • 2 篇 univ bordeaux la...
  • 2 篇 purdue univ dept...

作者

  • 11 篇 suomela jukka
  • 6 篇 wattenhofer roge...
  • 4 篇 degener bastian
  • 4 篇 kempkes barbara
  • 3 篇 choudhury salimu...
  • 3 篇 kuhn fabian
  • 3 篇 montanari andrea
  • 3 篇 kaasinen joel
  • 3 篇 schneider johann...
  • 3 篇 lenzen christoph
  • 3 篇 kaski petteri
  • 3 篇 der heide friedh...
  • 3 篇 polishchuk valen...
  • 3 篇 heide friedhelm ...
  • 3 篇 hirvonen juho
  • 3 篇 floreen patrik
  • 2 篇 jung daniel
  • 2 篇 gavoille cyril
  • 2 篇 fischer matthias
  • 2 篇 el alaoui ahmed

语言

  • 94 篇 英文
  • 9 篇 其他
检索条件"主题词=Local algorithms"
103 条 记 录,以下是31-40 订阅
排序:
Connectivity preserving obstacle avoidance localized motion planning algorithms for mobile wireless sensor networks
收藏 引用
PEER-TO-PEER NETWORKING AND APPLICATIONS 2019年 第3期12卷 647-659页
作者: Hassan, Md. Yeakub Hussain, Faisal Choudhury, Salimur Green Univ Bangladesh Dept Comp Sci & Engn Dhaka Bangladesh Islamic Univ Technol Dept Comp Sci & Engn Gazipur Bangladesh Lakehead Univ Dept Comp Sci Thunder Bay ON Canada
Mobile wireless sensor networks (MWSN) are better in terms of coverage and it plays an important role in ubiquitous wireless networks. We design Cellular Automaton (CA) based localized motion planning algorithms for m... 详细信息
来源: 评论
localized algorithms for redundant readers elimination in RFID networks
收藏 引用
INTERNATIONAL JOURNAL OF PARALLEL EMERGENT AND DISTRIBUTED SYSTEMS 2019年 第3期34卷 260-271页
作者: Rashid, Nafiul Choudhury, Salimur Salomaa, Kai Univ Calif Irvine Dept Elect Engn & Comp Sci Irvine CA USA Lakehead Univ Dept Comp Sci Thunder Bay ON Canada Queens Univ Sch Comp Kingston ON Canada
Redundant readers elimination is one of the fundamental optimization research problems in RFID networks. The problem is NP-hard and can be solved approximately using best known centralised set cover algorithms. Howeve... 详细信息
来源: 评论
Survey of local algorithms
收藏 引用
ACM COMPUTING SURVEYS 2013年 第2期45卷 24-24页
作者: Suomela, Jukka Univ Helsinki Helsinki Inst Informat Technol FIN-00014 Helsinki Finland
A local algorithm is a distributed algorithm that runs in constant time, independently of the size of the network. Being highly scalable and fault tolerant, such algorithms are ideal in the operation of large-scale di... 详细信息
来源: 评论
On the Power of Preprocessing in Decentralized Network Optimization
On the Power of Preprocessing in Decentralized Network Optim...
收藏 引用
IEEE Conference on Computer Communications (IEEE INFOCOM)
作者: Foerster, Klaus-Tycho Hirvonen, Juho Schmid, Stefan Suomela, Jukka Univ Vienna Fac Comp Sci Vienna Austria Aalto Univ Dept Comp Sci Helsinki Finland
As communication networks are growing at a fast pace, the need for more scalable approaches to operate such networks is pressing. Decentralization and locality are key concepts to provide scalability. Existing models ... 详细信息
来源: 评论
Distributed Learning of Hop Count Distributions in Ad Hoc Networks  17
Distributed Learning of Hop Count Distributions in Ad Hoc Ne...
收藏 引用
17th ACM International Symposium on Mobility Management and Wireless Access (MobiWac)
作者: Shamoun, Simon CUNY New York NY 10021 USA Bar Ilan Univ Ramat Gan Israel
This is a study of the feasibility of learning the hop count distribution of a mobile ad hoc network using in-network data. The nodes maintain a histogram of the hop count from the source of all packets received and s... 详细信息
来源: 评论
Community detection using preference networks
收藏 引用
PHYSICA A-STATISTICAL MECHANICS AND ITS APPLICATIONS 2018年 495卷 126-136页
作者: Tasgin, Mursel Bingol, Haluk O. Bogazici Univ Dept Comp Engn Istanbul Turkey
Community detection is the task of identifying clusters or groups of nodes in a network where nodes within the same group are more connected with each other than with nodes in different groups. It has practical uses i... 详细信息
来源: 评论
A fast network-decomposition algorithm and its applications to constant-time distributed computation
收藏 引用
THEORETICAL COMPUTER SCIENCE 2018年 751卷 2-23页
作者: Barenboim, Leonid Elkin, Michael Gavoille, Cyril Open Univ Israel Raanana Israel Ben Gurion Univ Negev Beer Sheva Israel Univ Bordeaux LaBRI Bordeaux France
A partition (C-1, C-2, . . . ,C-q) of G = (V, E) into clusters of strong (respectively, weak) diameter d, such that the supergraph obtained by contracting each C-i is l-colorable is called a strong (resp., weak) (d, l... 详细信息
来源: 评论
Scalable algorithms in the Age of Big Data and Network Sciences: Characterization, Primitives, and Techniques  18
Scalable Algorithms in the Age of Big Data and Network Scien...
收藏 引用
11th ACM International Conference on Web Search and Data Mining
作者: Teng, Shang-Hua Univ Southern Calif Los Angeles CA 90007 USA
In the age of network sciences and machine learning, efficient algorithms are now in higher demand more than ever before. Big Data fundamentally challenges the classical notion of efficient algorithms: algorithms that... 详细信息
来源: 评论
A fast network-decomposition algorithm and its applications to constant-time distributed computation  1
收藏 引用
22nd International Colloquium on Structural Information and Communication Complexity (SIROCCO)
作者: Barenboim, Leonid Elkin, Michael Gavoille, Cyril Open Univ Israel Raanana Israel Ben Gurion Univ Negev Beer Sheva Israel Univ Bordeaux LaBRI Bordeaux France
A partition (C-1, C-2, . . . ,C-q) of G = (V, E) into clusters of strong (respectively, weak) diameter d, such that the supergraph obtained by contracting each C-i is l-colorable is called a strong (resp., weak) (d, l... 详细信息
来源: 评论
A local algorithm to approximate the global clustering of streams generated in ubiquitous sensor networks
收藏 引用
INTERNATIONAL JOURNAL OF DISTRIBUTED SENSOR NETWORKS 2018年 第10期14卷 1-1页
作者: Rodrigues, Pedro Pereira Araujo, Joao Gama, Joao Lopes, Luis Ctr Hlth Technol & Serv Res CINTESIS Rua Dr Placido Costa P-4200450 Porto Portugal Univ Porto Fac Med MEDCIDS FMUP Dept Community Med Informat & Hlth Decis Sci Porto Portugal INESC TEC Artificial Intelligence & Decis Support Lab LIAAD Porto Portugal INESC TEC Ctr Res Adv Comp Syst CRACS Porto Portugal Univ Porto Fac Econ FEP Porto Portugal Univ Porto Fac Sci DCC FCUP Dept Comp Sci Porto Portugal
In ubiquitous streaming data sources, such as sensor networks, clustering nodes by the data they produce gives insights on the phenomenon being monitored. However, centralized algorithms force communication and storag... 详细信息
来源: 评论