咨询与建议

限定检索结果

文献类型

  • 10 篇 会议

馆藏范围

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

日期分布

学科分类号

  • 6 篇 理学
    • 5 篇 数学
    • 2 篇 系统科学
    • 1 篇 统计学(可授理学、...
  • 3 篇 工学
    • 1 篇 机械工程
    • 1 篇 仪器科学与技术
    • 1 篇 控制科学与工程
    • 1 篇 计算机科学与技术...
  • 2 篇 管理学
    • 1 篇 管理科学与工程(可...
    • 1 篇 图书情报与档案管...

主题

  • 1 篇 traveling salesm...
  • 1 篇 runtime
  • 1 篇 euclidean distan...
  • 1 篇 access control
  • 1 篇 approximation al...
  • 1 篇 ant colony optim...
  • 1 篇 electronic mail
  • 1 篇 ganglia
  • 1 篇 set theory
  • 1 篇 information mana...
  • 1 篇 connected compon...
  • 1 篇 social network s...
  • 1 篇 syntactics
  • 1 篇 algorithm design...
  • 1 篇 square root
  • 1 篇 clocks
  • 1 篇 shortest path
  • 1 篇 optimization met...
  • 1 篇 kernel
  • 1 篇 time measurement

机构

  • 1 篇 school of comput...
  • 1 篇 department of co...
  • 1 篇 computer science...
  • 1 篇 department 1: al...
  • 1 篇 department of co...
  • 1 篇 school of operat...
  • 1 篇 school of comput...
  • 1 篇 max-planck-insti...
  • 1 篇 department of al...
  • 1 篇 theoretical divi...
  • 1 篇 iinstitute of di...
  • 1 篇 max-planck-insti...
  • 1 篇 school of mathem...
  • 1 篇 department 1: al...
  • 1 篇 department 1: al...
  • 1 篇 department 1 : a...
  • 1 篇 department of co...
  • 1 篇 am campus 1 klos...
  • 1 篇 department of co...
  • 1 篇 hamburg universi...

作者

  • 2 篇 kötzing timo
  • 2 篇 tobias friedrich
  • 1 篇 mnich matthias
  • 1 篇 neumann frank
  • 1 篇 frank neumann
  • 1 篇 rybicki joel
  • 1 篇 goke alexander
  • 1 篇 williamson david...
  • 1 篇 koenemann jochen
  • 1 篇 lenzen christoph
  • 1 篇 thomas sauerwald
  • 1 篇 ezra esther
  • 1 篇 case john
  • 1 篇 milan bradonjic
  • 1 篇 sun hao
  • 1 篇 khaled elbassion...
  • 1 篇 drmota michael
  • 1 篇 alexandre stauff...
  • 1 篇 robert elsaesser
  • 1 篇 elisa bertino

语言

  • 10 篇 英文
检索条件"机构=Department 1: Algorithms and Complexity"
10 条 记 录,以下是1-10 订阅
排序:
HITTING WEIGHTED EVEN CYCLES IN PLANAR GRAPHS
HITTING WEIGHTED EVEN CYCLES IN PLANAR GRAPHS
收藏 引用
作者: Goke, Alexander Koenemann, Jochen Mnich, Matthias Sun, Hao Hamburg University of Technology Institute for Algorithms and Complexity Hamburg Germany Department of Combinatorics & Optimization University of Waterloo WaterlooONN2L 3G1 Canada
A classical branch of graph algorithms is graph transversals, where one seeks a minimum-weight subset of nodes in a node-weighted graph G which intersects all copies of subgraphs F from a fixed family Ƒ. Many such gra... 详细信息
来源: 评论
Self-stabilising Byzantine clock synchronisation is almost as easy as consensus
Self-stabilising Byzantine clock synchronisation is almost a...
收藏 引用
作者: Lenzen, Christoph Rybicki, Joel Department of Algorithms and Complexity Max Planck Institute for Informatics Saarland Informatics Campus Campus E1 4 Saarbrücken66123 Germany Am Campus 1 Klosterneuburg3400 Austria
We give fault-tolerant algorithms for establishing synchrony in distributed systems in which each of the n nodes has its own clock. Our algorithms operate in a very strong fault model: we require self-stabilisation, i... 详细信息
来源: 评论
Memory-limited non-U-shaped learning with solved open problems
Memory-limited non-U-shaped learning with solved open proble...
收藏 引用
作者: Case, John Kötzing, Timo Department of Computer and Information Science University of Delaware Newark DE 19716 United States Department 1: Algorithms and Complexity Max-Planck-Institut für Informatik 66123 Saarbrücken Germany
In empirical cognitive science, for human learning, a semantic or behavioral U-shape occurs when a learner first learns, then unlearns, and, finally, relearns, some target concept. Within the formal framework of Induc... 详细信息
来源: 评论
Plateaus can be harder in multi-objective optimization
Plateaus can be harder in multi-objective optimization
收藏 引用
Congress on Evolutionary Computation
作者: Tobias Friedrich Nils Hebbinghaus Frank Neumann Department 1: Algorithms and Complexity Max Planck Institut für Informatik Saarbruecken Germany
In recent years a lot of progress has been made in understanding the behavior of evolutionary computation methods for single- and multi-objective problems. Our aim is to analyze the diversity mechanisms that are impli... 详细信息
来源: 评论
Ant colony optimization and the minimum cut problem  10
Ant colony optimization and the minimum cut problem
收藏 引用
12th Annual Genetic and Evolutionary Computation Conference, GECCO-2010
作者: Kötzing, Timo Lehre, Per Kristian Neumann, Frank Oliveto, Pietro S. Department 1 : Algorithms and Complexity Max-Planck-Institut für Informatik 66123 Saarbrücken Germany School of Computer Science University of Birmingham B15 2TT Birmingham United Kingdom
Ant Colony Optimization (ACO) is a powerful metaheuristic for solving combinatorial optimization problems. With this paper we contribute to the theoretical understanding of this kind of algorithm by investigating the ... 详细信息
来源: 评论
A proof of the Boyd-Carr conjecture
A proof of the Boyd-Carr conjecture
收藏 引用
23rd Annual ACM-SIAM Symposium on Discrete algorithms, SODA 2012
作者: Schalekamp, Frans Williamson, David P. Van Zuylen, Anke School of Operations Research and Information Engineering Cornell University Ithaca NY 14853 United States Max-Planck-Institut für Informatik Department 1: Algorithms and Complexity Campus El 4 66123 Saarbrücken Germany
Determining the precise integrality gap for the subtour LP relaxation of the traveling salesman problem is a significant open question, with little progress made in thirty years in the general case of symmetric costs ... 详细信息
来源: 评论
A central limit theorem for the number of degree-k vertices in random maps  9
A central limit theorem for the number of degree-k vertices ...
收藏 引用
9th Meeting on Analytic Algorithmics and Combinatorics, ANALCO 2012
作者: Drmota, Michael Panagiotou, Konstantinos Iinstitute of Discrete Mathematics and Geometry TU Wien Wiedner Hauptstr. 8-10 WienA-1040 Austria Max-Planck-Institut für Informatik Department 1: Algorithms and Complexity Campus E1.4 Saarbrücken66123 Germany
We prove that the number of vertices of given degree in random planar maps satisfies a central limit theorem with mean and variance that are asymptotically linear in the number of edges. The proof relies on an analyti... 详细信息
来源: 评论
Modeling the Risk & Utility of Information Sharing in Social Networks
Modeling the Risk & Utility of Information Sharing in Social...
收藏 引用
IEEE International Conference on and IEEE International Confernece on Social Computing (SocialCom) Privacy, Security, Risk and Trust (PASSAT)
作者: Mohamed R. Fouad Khaled Elbassioni Elisa Bertino Department of Computer Science Purdue University West Lafayette IN USA Department 1: Algorithms and Complexity Max-Planck-Institute for Informatics Saarbrcken Germany
With the widespread of social networks, the risk of information sharing has become inevitable. Sharing a user's particular information in social networks is an all-or-none decision. Users receiving friendship invi... 详细信息
来源: 评论
Two Proofs for Shallow Packings  31
Two Proofs for Shallow Packings
收藏 引用
31st International Symposium on Computational Geometry, SoCG 2015
作者: Dutta, Kunal Ezra, Esther Ghosh, Arijit D1: Algorithms and Complexity Max-Planck-Institut für Informatik Saarbrücken66123 Germany Department of Computer Science and Engineering Polytechnic Institute of NYU BrooklynNY11201-3840 United States School of Mathematics Georgia Institute of Technology AtlantaGA30332 United States
We refine the bound on the packing number, originally shown by Haussler, for shallow geometric set systems. Specifically, let V be a finite set system defined over an n-point set X;we view V as a set of indicator vect... 详细信息
来源: 评论
Efficient Broadcast on Random Geometric Graphs  10
Efficient Broadcast on Random Geometric Graphs
收藏 引用
Annual ACM-Society for Industrial and Applied Mathmatics Symposium on Discrete algorithms
作者: Milan Bradonjic Robert Elsaesser Tobias Friedrich Thomas Sauerwald Alexandre Stauffer Theoretical Division and Center for Nonlinear Studies Los Alamos National Laboratory Department of Computer Science University of Paderborn Department 1: Algorithms and Complexity School of Computing Science Simon Fraser University Computer Science Division University of California
A Random Geometric Graph (RGG) in two dimensions is constructed by distributing n nodes independently and uniformly at random in [0, {the square root of}n]~2 and creating edges between every pair of nodes having Eucli... 详细信息
来源: 评论