咨询与建议

限定检索结果

文献类型

  • 157 篇 会议
  • 20 篇 期刊文献
  • 1 册 图书

馆藏范围

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

日期分布

学科分类号

  • 112 篇 工学
    • 107 篇 计算机科学与技术...
    • 18 篇 软件工程
    • 5 篇 信息与通信工程
    • 3 篇 电气工程
    • 2 篇 控制科学与工程
    • 2 篇 化学工程与技术
    • 1 篇 力学(可授工学、理...
    • 1 篇 机械工程
    • 1 篇 材料科学与工程(可...
    • 1 篇 农业工程
    • 1 篇 生物医学工程(可授...
    • 1 篇 生物工程
  • 103 篇 理学
    • 101 篇 数学
    • 9 篇 统计学(可授理学、...
    • 2 篇 物理学
    • 2 篇 化学
    • 2 篇 系统科学
    • 1 篇 生物学
  • 6 篇 管理学
    • 5 篇 管理科学与工程(可...
    • 4 篇 工商管理
    • 1 篇 图书情报与档案管...
  • 3 篇 经济学
    • 3 篇 应用经济学
  • 1 篇 农学
    • 1 篇 作物学

主题

  • 14 篇 approximation al...
  • 13 篇 algorithms
  • 9 篇 polynomial appro...
  • 4 篇 mobile agents
  • 4 篇 discrete fourier...
  • 3 篇 trees (mathemati...
  • 3 篇 graphic methods
  • 3 篇 logarithm (log)
  • 3 篇 logs
  • 3 篇 discrete mathema...
  • 2 篇 computer science
  • 2 篇 generating funct...
  • 2 篇 fourier analysis
  • 2 篇 byzantine agreem...
  • 2 篇 problem solving
  • 2 篇 average-case ana...
  • 2 篇 planted clique
  • 2 篇 probability dist...
  • 2 篇 lower bound
  • 2 篇 mixtures

机构

  • 6 篇 univ alberta dep...
  • 6 篇 rhein westfal th...
  • 4 篇 univ new mexico ...
  • 3 篇 university of wi...
  • 3 篇 univ quebec outa...
  • 3 篇 univ so calif de...
  • 3 篇 univ bristol dep...
  • 3 篇 univ bonn res in...
  • 2 篇 university of ca...
  • 2 篇 rhein westfal th...
  • 2 篇 university of ed...
  • 2 篇 department of ma...
  • 2 篇 univ bonn hausdo...
  • 2 篇 univ calif berke...
  • 2 篇 rhein westfal th...
  • 2 篇 department of co...
  • 2 篇 bar ilan univ de...
  • 2 篇 univ warwick dep...
  • 2 篇 department of co...
  • 2 篇 max planck inst ...

作者

  • 9 篇 csaba d. tóth
  • 7 篇 salavatipour moh...
  • 5 篇 adrian dumitresc...
  • 5 篇 svitkina zoya
  • 5 篇 pelc andrzej
  • 4 篇 friggstad zachar...
  • 4 篇 sanwalani vishal
  • 4 篇 king valerie
  • 4 篇 saia jared
  • 4 篇 andrzej pelc
  • 3 篇 coja-oghlan amin
  • 3 篇 kempe david
  • 3 篇 diakonikolas ili...
  • 3 篇 o'donnell ryan
  • 3 篇 englert matthias
  • 3 篇 servedio rocco a...
  • 3 篇 clifford raphael
  • 3 篇 tóth csaba d.
  • 3 篇 grohe martin
  • 2 篇 chan siu-on

语言

  • 177 篇 英文
  • 1 篇 其他
检索条件"任意字段=8th Annual ACM/SIAM Symposium on Discrete Algorithms"
178 条 记 录,以下是81-90 订阅
排序:
Asymmetric Traveling Salesman Path and Directed Latency Problems
Asymmetric Traveling Salesman Path and Directed Latency Prob...
收藏 引用
21st annual acm/siam symposium on discrete algorithms
作者: Friggstad, Zachary Salavatipour, Mohammad R. Svitkina, Zoya Univ Alberta Dept Comp Sci Edmonton AB T6G 2E8 Canada
We study integrality gaps and approximability of two closely related problems on directed graphs. Given a set V of n nodes in an underlying asymmetric metric and two specified nodes s and t, both problems ask to find ... 详细信息
来源: 评论
Cake Cutting on Graphs: A discrete and Bounded Proportional Protocol  31
Cake Cutting on Graphs: A Discrete and Bounded Proportional ...
收藏 引用
31st annual acm-siam symposium on discrete algorithms (SODA)
作者: Bei, Xiaohui Sun, Xiaoming Wu, Hao Zhang, Jialin Zhang, Zhijie Zi, Wei Nanyang Technol Univ Sch Phys & Math Sci Singapore Singapore Chinese Acad Sci Univ Chinese Acad Sci Inst Comp Technol CAS Key Lab Network Data Sci & Technol Beijing Peoples R China Univ Chinese Acad Sci Beijing Peoples R China
the classical cake cutting problem studies how to find fair allocations of a heterogeneous and divisible resource among multiple agents. Two of the most commonly studied fairness concepts in cake cutting are proportio... 详细信息
来源: 评论
Combination Can Be Hard: Approximability of the Unique Coverage Problem
Combination Can Be Hard: Approximability of the Unique Cover...
收藏 引用
17th acm-siam symposium on discrete algorithms
作者: Demaine, Erik D. Feige, Uriel Hajiaghayi, MohammadTaghi Salavatipour, Mohammad R. MIT Comp Sci & Artificial Intelligence Lab Cambridge MA 02139 USA Weizmann Inst Sci Dept Comp Sci & Appl Math IL-76100 Rehovot Israel Univ Alberta Dept Comp Sci Edmonton AB T6G 2E8 Canada
We prove semi-logarithmic inapproximability for a maximization problem called unique coverage: given a collection of sets, find a subcollection that maximizes the number of elements covered exactly once. Specifically,... 详细信息
来源: 评论
discrete Choice, Permutations, and Reconstruction  29
Discrete Choice, Permutations, and Reconstruction
收藏 引用
29th annual acm-siam symposium on discrete algorithms (SODA)
作者: Chierichetti, Flavio Kumar, Ravi Tomkins, Andrew Sapienza Univ Rome Rome Italy Google Mountain View CA USA
In this paper we study the well-known family of Random Utility Models, developed over 50 years ago to codify rational user behavior in choosing one item from a finite set of options. In this setting each user draws i.... 详细信息
来源: 评论
On the diameter of the symmetric group: Polynomial bounds
On the diameter of the symmetric group: Polynomial bounds
收藏 引用
Proceedings of the Fifteenth annual acm-siam symposium on discrete algorithms
作者: Babai, László Beals, Robert Seress, Ákos Department of Computer Science University of Chicago 1100 East 58th Street Chicago IL 60637 Mathematical Institute Hungarian Academy of Science IDA Ctr. Commun. Res. - Princeton 805 Bunn Drive Princeton NJ 08540 Department of Mathematics Ohio State University 231 W. 18th Avenue Columbus OH 43210
We address the long-standing conjecture that all permutations have polynomially bounded word length in terms of any set of generators of the symmetric group. the best available bound on the maximum required word lengt... 详细信息
来源: 评论
Fast and Accurate Approximations of the Optimal Transport in Semi-discrete and discrete Settings  35
Fast and Accurate Approximations of the Optimal Transport in...
收藏 引用
35th annual acm-siam symposium on discrete algorithms (SODA)
作者: Agarwal, Pankaj K. Raghvendra, Sharath Shirzadian, Pouyan Yao, Keegan Duke Univ Dept Comp Sci Durham NC 27706 USA North Carolina State Univ Dept Comp Sci Raleigh NC 27695 USA Virginia Tech Dept Comp Sci Blacksburg VA USA
Given a d-dimensional continuous (resp. discrete) probability distribution mu and a discrete distribution nu, the semi-discrete (resp. discrete) optimal transport (OT) problem asks for computing a minimum-cost plan to...
来源: 评论
(1+ε\)-Approximation for Facility Location in Data Streams
(1+ε\)-Approximation for Facility Location in Data Streams
收藏 引用
24th annual acm-siam symposium on discrete algorithms (SODA)
作者: Czumaj, Artur Lammersen, Christiane Monemizadeh, Morteza Sohler, Christian Univ Warwick Dept Comp Sci Coventry W Midlands England Univ Warwick Ctr Discrete Math & Its Applicat DIMAP Coventry W Midlands England Simon Fraser Univ Sch Comp Sci Burnaby BC Canada Goethe Univ Frankfurt Inst Comp Sci Frankfurt Germany Tech Univ Dortmund Dept Comp Sci Dortmund Germany
We consider the Euclidean facility location problem with uniform opening cost. In this problem, we are given a set of n points P subset of R-2 and an opening cost f is an element of R+, and we want to find a set of fa... 详细信息
来源: 评论
Fast Asynchronous Byzantine Agreement and Leader Election with Full Information
Fast Asynchronous Byzantine Agreement and Leader Election wi...
收藏 引用
19th annual acm-siam symposium on discrete algorithms (SODA)
作者: Kapron, Bruce M. Kempe, David King, Valerie Saia, Jared Sanwalani, Vishal Univ Victoria Dept Comp Sci Victoria BC V8W 2Y2 Canada Univ So Calif Dept Comp Sci Los Angeles CA 90089 USA Univ Victoria Dept Comp Sci Victoria BC V8W 3P6 Canada Univ New Mexico Dept Comp Sci Albuquerque NM 87131 USA
We resolve two long-standing open problems in distributed computation by describing polylogarithmic protocols for Byzantine agreement and leader election in the asynchronous full information model with a nonadaptive m... 详细信息
来源: 评论
Considering Suppressed Packets Improves Buffer Management in QoS Switches  18
Considering Suppressed Packets Improves Buffer Management in...
收藏 引用
18th acm-siam symposium on discrete algorithms
作者: Englert, Matthias Westermann, Matthias Rhein Westfal TH Aachen Dept Comp Sci Aachen Germany
the following buffer management problem arises in network switches providing differentiated services: At the beginning of each time step, one packet can be sent, and afterwards an arbitrary number of new packets arriv... 详细信息
来源: 评论
Randomizing functions: Simulation of a discrete probability distribution using a source of unknown distribution
收藏 引用
IEEE TRANSACTIONS ON INFORMATION thEORY 2006年 第11期52卷 4965-4976页
作者: Pae, Sung-il Loui, Michael C. Univ Illinois Dept Comp Sci Urbana IL 61801 USA Univ Illinois Coordinated Sci Lab Urbana IL 61801 USA
In this paper, we characterize functions that simulate independent unbiased coin flips from independent coin flips of unknown bias. We call such functions randomizing. Our characterization of randomizing functions ena... 详细信息
来源: 评论