检索结果-内蒙古大学图书馆

您好，读者！请登录

内蒙古大学图书馆

首页
概况
党建
资源
服务
科研支持
- 论文收录引用证明
- 科技查新
知识产权
档案馆
帮助

咨询与建议

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入0个字，您还可以输入200个字

全部搜索
期刊论文
图书
学位论文
标准
纸本馆藏
外文资源发现
数据库导航
超星发现

高级检索

时间限定

出版年份：

文献类型

图书期刊文献学位论文多媒体

馆藏选择

电子馆藏纸本馆藏

核心期刊

全部期刊 SCI 收录期刊 SSCI 收录期刊 EI 收录期刊 CSCD 收录期刊 CSSCI 收录期刊

语言

中文英文

文献类型

期刊文献图书学位论文标准纸本馆藏

帮助

文字说明：

T=题名（书名、题名），A=作者（责任者），K=主题词，P=出版物名称，PU=出版社名称，O=机构（作者单位、学位授予单位、专利申请人），L=中图分类号，C=学科分类号，U=全部字段，Y=年（出版发行年、学位年度、标准发布年）

检索规则说明：

AND代表“并且”；OR代表“或者”；NOT代表“不包含”；(注意必须大写,运算符两边需空一格)

检索范例：

范例一：(K=图书馆学 OR K=情报学) AND A=范并思 AND Y=1982-2016
范例二：P=计算机应用与软件 AND (U=C++ OR U=Basic) NOT K=Visual AND Y=2011-2016

分类表

所选分类

>> <<

限定检索结果

文献类型

22,811 篇 会议
9,086 篇 期刊文献
64 篇 学位论文
1 册 图书

馆藏范围

31,962 篇 电子文献
1 种 纸本馆藏

日期分布

学科分类号

15,965 篇 工学
- 10,069 篇 计算机科学与技术...
- 4,864 篇 电气工程
- 3,097 篇 软件工程
- 2,689 篇 信息与通信工程
- 1,952 篇 控制科学与工程
- 737 篇 机械工程
- 681 篇 电子科学与技术（可...
- 605 篇 航空宇航科学与技...
- 532 篇 仪器科学与技术
- 232 篇 交通运输工程
- 212 篇 材料科学与工程（可...
- 195 篇 化学工程与技术
- 171 篇 生物工程
- 147 篇 测绘科学与技术
- 134 篇 动力工程及工程热...
- 134 篇 生物医学工程（可授...
- 133 篇 土木工程
10,418 篇 理学
- 9,357 篇 数学
- 874 篇 物理学
- 766 篇 系统科学
- 742 篇 统计学（可授理学、...
- 265 篇 生物学
- 235 篇 化学
2,485 篇 管理学
- 1,929 篇 管理科学与工程(可...
- 672 篇 工商管理
- 554 篇 图书情报与档案管...
418 篇 经济学
- 387 篇 应用经济学
207 篇 医学
- 171 篇 临床医学
179 篇 法学
- 166 篇 社会学
128 篇 文学
- 123 篇 新闻传播学
128 篇 农学
37 篇 教育学
27 篇 军事学
11 篇 艺术学
1 篇 哲学
1 篇 历史学

主题

31,962 篇 approximation al...
2,737 篇 algorithm design...
2,333 篇 optimization
2,306 篇 approximation me...
2,156 篇 heuristic algori...
1,421 篇 linear programmi...
1,403 篇 convergence
1,272 篇 computational mo...
1,216 篇 resource managem...
1,137 篇 signal processin...
955 篇 computer science
910 篇 polynomials
906 篇 clustering algor...
905 篇 complexity theor...
789 篇 mathematical mod...
741 篇 vectors
712 篇 programming
647 篇 estimation
614 篇 transportation
608 篇 training

机构

97 篇 univ maryland de...
70 篇 technion israel ...
55 篇 univ waterloo de...
49 篇 cornell univ dep...
43 篇 tsinghua univers...
39 篇 national institu...
39 篇 carnegie mellon ...
38 篇 iit dept comp sc...
35 篇 national mobile ...
34 篇 shandong univ sc...
32 篇 sichuan univ col...
31 篇 school of comput...
31 篇 nanjing univ sta...
29 篇 univ chinese aca...
29 篇 technion haifa
29 篇 princeton univ p...
29 篇 suny stony brook...
28 篇 epfl
28 篇 tel aviv univers...
28 篇 max planck inst ...

作者

64 篇 woodruff david p...
64 篇 ravi r.
52 篇 kortsarz guy
45 篇 lee euiwoong
43 篇 levin asaf
41 篇 chan timothy m.
40 篇 kumar amit
37 篇 chen zhi-zhong
36 篇 friggstad zachar...
33 篇 kawarabayashi ke...
32 篇 manurangsi pasin
32 篇 chalermsook pari...
31 篇 wang lusheng
30 篇 gudmundsson joac...
29 篇 thai my t.
29 篇 williamson david...
29 篇 carmi paz
29 篇 zenklusen rico
28 篇 saha barna
27 篇 dinitz michael

语言

31,238 篇 英文
576 篇 其他
114 篇 中文
9 篇 日文
7 篇 俄文
4 篇 法文
2 篇 西班牙文
1 篇 德文
1 篇 葡萄牙文
1 篇 土耳其文

检索条件"主题词=approximation algorithms"

共 31962 条记录，以下是481-490 订阅

全选清除本页清除全部题录导出标记到"检索档案"

详细简洁

排序：

approximation algorithms for stochastic clustering 32

Approximation algorithms for stochastic clustering

引用

32nd Conference on Neural Information Processing Systems, NeurIPS 2018

作者： Harris, David G. Li, Shi Pensyl, Thomas Srinivasan, Aravind Trinh, Khoa Department of Computer Science University of Maryland College ParkMD20742 United States University at Buffalo BuffaloNY United States Bandwidth Inc RaleighNC United States Department of Computer Science Institute for Advanced Computer Studies University of Maryland College ParkMD20742 United States Google Mountain ViewCA94043 United States

We consider stochastic settings for clustering, and develop provably-good (approximation) algorithms for a number of these notions. These algorithms allow one to obtain better approximation ratios compared to the usual deterministic clustering setting. Additionally, they offer a number of advantages including providing fairer clustering and clustering which has better long-term behavior for each user. In particular, they ensure that every user is guaranteed to get good service (on average). We also complement some of these with impossibility results. © 2018 Curran Associates *** rights reserved.

关键词： approximation algorithms

来源：评论

学校读者我要写书评

暂无评论

approximation algorithms for Orthogonal Line Centers 7th

Approximation Algorithms for Orthogonal Line Centers

引用

7th International Conference on algorithms and Discrete Applied Mathematics, CALDAM 2021

作者： Das, Arun Kumar Das, Sandip Mukherjee, Joydeep Indian Statistical Institute Kolkata India Ramakrishna Mission Vivekananda Educational and Research Institute Howrah India

ISBN: (纸本)9783030678982

k orthogonal line center problem computes a set of k axis-parallel lines for a given set of points in 2D such that the maximum among the distance between each point to its nearest line is minimized. A 2-factor approximation algorithm and a (74,32) bi-criteria approximation algorithm is presented for the problem. Both of them are deterministic approximation algorithms, having sub-quadratic running time and not based on linear programming. © 2021, Springer Nature Switzerland AG.

关键词： approximation algorithms

来源：评论

学校读者我要写书评

暂无评论

approximation algorithms for minimum-time broadcast under the vertex-disjoint paths mode 9th

引用

9th Annual European Symposium on algorithms, ESA 2001

作者： Fraigniaud, Pierre CNRS-LRI Université Paris-Sud France

ISBN: (纸本)9783540424932

We give a polynomial-time(formula presented)-approximation algorithm for minimum-time broadcast and minimum-time multicast in n-node networks under the single-port vertex-disjoint paths mode. This improves a previous approximation algorithm by Kortsarz and Peleg. In contrast, we give an Ω(log n) lower bound for the approximation ratio of the minimum-time multicast problem in directed networks. This lower bound holds unless NP ⊂ DTIME(nlog log n). An important consequence of this latter result is that the Steiner version of the Minimum Degree Spanning Tree (MDST) problem in digraphs cannot be approximated within a constant ratio, as opposed to the undirected version. Finally, we give a polynomial-time O(1)-approximation algorithm for minimum- time gossip (i.e., all-to-all broadcast). © Springer-Verlag Berlin Heidelberg 2001.

关键词： approximation algorithms

来源：评论

学校读者我要写书评

暂无评论

approximation algorithms for a combined facility location buy-at-bulk network design problem

Approximation algorithms for a combined facility location bu...

引用

10th International Conference on Theory and Applications of Models of Computation, TAMC 2013

作者： Bley, Andreas Hashemi, S. Mehdi Rezapour, Mohsen Institute for Mathematics TU Berlin Straße des 17. Juni 136 10623 Berlin Germany Department of Computer Science Amirkabir University of Technology No. 424 Hafez Ave. Tehran Iran

ISBN: (纸本)9783642382352

We consider a generalization of the connected facility location problem where the clients must be connected to the open facilities via shared capacitated (tree) networks instead of independent shortest paths. This problem arises in the planning of fiber optic telecommunication access networks, for example. Given a set of clients with positive demands, a set of potential facilities with opening costs, a set of capacitated access cable types, and a core cable type of infinite capacity, one has to decide which facilities to open, how to interconnect them using a Steiner tree of infinite capacity core cables, and which access cable types to install on which potential edges such that these edges form a forest and the installed capacities suffice to simultaneously route the client demands to the open facilities via single paths. The objective is to minimize the total cost of opening facilities, building the core Steiner tree among them, and installing the access cables. In this paper, we devise a constant-factor approximation algorithm for problem instances where the access cable types obey economies of scale. In the special case where only multiples of a single cable type can be installed on the access edges, a variant of our algorithm achieves a performance guarantee of 6.72. © Springer-Verlag Berlin Heidelberg 2013.

关键词： approximation algorithms

来源：评论

学校读者我要写书评

暂无评论

approximation algorithms for minimizing the number of roles and administrative assignments in RBAC

Approximation algorithms for minimizing the number of roles ...

引用

36th Annual IEEE International Computer Software and Applications Conference Workshops, COMPSACW 2012

作者： Huang, Hejiao Shang, Feng Zhang, Jiangtao Harbin Institute of Technology Shenzhen Graduate School China

ISBN: (纸本)9780769547589

In role based access control (RBAC), minimizing the descriptive set of roles (specified as Basic-RMP) and minimizing the administrative assignments for roles (specified as Edge-RMP) can greatly decrease the management costs. Both role mining problems are proved to be NP-hard. In this work, we convert Basic-RMP to set cover problem and Edge-RMP to weighted set cover problem. Hence, many well-known methods for solving the Set Cover Problems can be applied to solve these role mining problems. According to the conversion process and the greedy idea for solving set cover problems, two algorithms respectively named GA Basic algorithm for Basic-RMP and GA Edge algorithm for Edge-RMP, are given in this paper. Experiment results show that the average similarity rate between role sets produced by GA Basic algorithm and the original ones is above 90%. However, in the process of converting role mining into Set Cover Problem, the number of candidate role set was exponential. In order to reduce the complexity of the GA Basic algorithm, this paper presents a new polynomial-time algorithm with a performance nearly the same as that of GA Basic algorithm. © 2012 IEEE.

关键词： approximation algorithms

来源：评论

学校读者我要写书评

暂无评论

approximation algorithms for routing and call scheduling in all-optical chains and rings 19th

引用

19th Conference on Foundations of Software Technology and Theoretical Computer Science, FSTandTCS 1999

作者： Becchetti, Luca Di Ianni, Miriam Marchetti-Spaccamela, Alberto Technische Universität Graz Institut für Mathematik B Austria Dipartimento di Ingegneria Elettronica e dell’Informazione Università di Perugia Italy Dipartimento di Informatica e Sistemistica Università di Roma La Sapienza Italy

ISBN: (纸本)3540668365

We study the problem of routing and scheduling requests of limited durations in an all-optical network. The task is servicing the requests, assigning each of them a starting time and a wavelength, with restrictions on the number of available wavelengths. The goal is minimizing the overall time needed to serve all requests. We propose constant approximation algorithms for both ring and chain networks. In doing this, we also propose a polynomial-time approximation scheme for the problem of routing weighted calls on a directed ring with minimum load. © Springer-Verlag Berlin Heidelberg 1999. © Springer-Verlag Berlin Heidelberg 1999.

关键词： approximation algorithms

来源：评论

学校读者我要写书评

暂无评论

approximation algorithms for connected dominating sets 4th

Approximation algorithms for connected dominating sets

引用

4th European Symposium on algorithms, ESA 1996

作者： Guha, Sudipto Khuller, Samir Dept. of Computer Science University of Maryland College ParkMD20742 United States Dept. of Computer Science and UMIACS University of Maryland College ParkMD20742 United States

ISBN: (纸本)3540616802

The dominating set problem in graphs asks for a minimum size subset of vertices with the following property: each vertex is required to either be in the dominating set, or adjacent to at least one node in the dominating set. We focus on the question of finding a connected dominating set of minimum size, where the graph induced by vertices in the dominating set is required to be connected. This problem arises in network testing, as well as in wireless communication. Two polynomial time algorithms that achieve approximation factors of O(H(A)) are presented, where A is the maximum degree, and H is the harmonic function. This question also arises in relation to the traveling tourist problem, where one is looking for the shortest tour such that each vertex is either visited, or has one of its neighbors visited. We study a generalization of the problem when the vertices have weights, and give an algorithm which achieves a performance ratio of 3 Inn. We also consider the more general problem of finding a connected dominating set of a specified set of vertices and provide a 3 Inn approximation factor. To prove the bound we also develop an optimal approximation algorithm for the unit node weighted Steiner tree problem. © Springer-Verlag Berlin Heidelberg 1996.

关键词： approximation algorithms

来源：评论

学校读者我要写书评

暂无评论

approximation algorithms for finding best viewpoints 6th

引用

6th International Symposium on Graph Drawing, GD 1998

作者： Houle, Michael E. Webber, Richard Department of Computer Science and Software Engineering University of Newcastle Callaghan2308 Australia

ISBN: (纸本)3540654739

We address the problem of finding viewpoints that preserve the relational structure of a three-dimensional graph drawing under orthographic parallel projection. Previously, algorithms for finding the best viewpoints under two natural models of viewpoint "goodness" were proposed. Unfortunately, the inherent combinatorial complexity of the problem makes finding exact solutions is impractical. In this paper, we propose two approximation algorithms for the problem, commenting on their design, and presenting results on their performance. © Springer-Verlag Berlin Heidelberg 1998.

关键词： approximation algorithms

来源：评论

学校读者我要写书评

暂无评论

approximation algorithms for Connectivity Augmentation Problems 1

引用

16th International Computer Science Symposium in Russia, CSR 2021

作者： Nutov, Zeev The Open University of Israel Ra’anana Israel

ISBN: (数字)9783030794163

ISBN: (纸本)9783030794156

In Connectivity Augmentation problems we are given a graph H= (V, EH) and an edge set E on V, and seek a min-size edge set J⊆ E such that H∪ J has larger edge/node connectivity than H. In the Edge-Connectivity Augmentation problem we need to increase the edge-connectivity by 1. In the Block-Tree Augmentation problem H is connected and H∪ S should be 2-connected. In Leaf-to-Leaf Connectivity Augmentation problems every edge in E connects minimal deficient sets. For this version we give a simple combinatorial approximation algorithm with ratio 5/3, improving the 1.91 approximation of [6] (see also [23]), that applies for the general case. We also show by a simple proof that if the Steiner Tree problem admits approximation ratio α then the general version admits approximation ratio 1 + ln (4 - x) + ϵ, where x is the solution to the equation 1 + ln (4 - x) = α+ (α- 1 ) x. For the currently best value of α= ln 4 + ϵ [7] this gives ratio 1.942. This is slightly worse than the ratio 1.91 of [6], but has the advantage of using Steiner Tree approximation as a "black box". In the Element Connectivity Augmentation problem we are given a graph G= (V, E), S⊆ V, and connectivity requirements r= { r(u, v): u, v∈ S}. The goal is to find a min-size set J of new edges on S such that for all u, v∈ S the graph G∪ J contains r(u, v) uv-paths such that no two of them have an edge or a node in V\ S in common. The problem is NP-hard even when rmax=maxu,v∈Sr(u,v)=2. We obtain ratio 3/2, improving the previous ratio 7/4 of [22]. For the case of degree bounds on S we obtain the same ratio with just + 1 degree violation, which is tight, since deciding whether there exists a feasible solution is NP-hard even when rmax= 2. © 2021, Springer Nature Switzerland AG.

关键词： approximation algorithms

来源：评论

学校读者我要写书评

暂无评论

approximation algorithms for the maximum satisflability problem 5th

Approximation algorithms for the maximum satisflability prob...

引用

5th Scandinavian Workshop on Algorithm Theory, SWAT 1996

作者： Asano, Takao Ono, Takao Hirata, Tomio Department of Information and System Engineering Chuo University Bunkyo-kuTokyo112 Japan School of Engineering Nagoya University Japan

ISBN: (纸本)3540614222

The maximum satisfiabitity problem (MAX SAT) is: given a set of clauses with weights, find a truth assignment that maximizes the sum of the weights of the satisfied clauses. In this paper, we present approximation algorithms for MAX SAT, including a 0.76544-approximation algorithm. The previous best approximation algorithm for MAX SAT was proposed by Goemans-Williamson and has a performance guarantee of 0.7584. Our algorithms are based on semidefinite programming and the 0.75-approximation algorithms of Yannakakis and Goemans-Williamson. © Springer-Verlag Berlin Heidelberg 1996.

关键词： approximation algorithms

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

全选清除本页清除全部题录导出标记到“检索档案”

共500页 << < 45 46 47 48 49 50 51 52 53 54 > >>

检索报告对象比较合并检索0

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

电话和邮箱必须正确填写，我们会与您联系确认。

联系人：

所在院系：

联系邮箱：

联系电话：

内蒙古自治区呼和浩特市赛罕区大学西街235号邮编: 010021

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：