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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入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

分类表

所选分类

>> <<

限定检索结果

文献类型

705 篇 会议
21 篇 期刊文献
17 册 图书

馆藏范围

741 篇 电子文献
2 种 纸本馆藏

日期分布

学科分类号

539 篇 工学
- 460 篇 计算机科学与技术...
- 123 篇 软件工程
- 84 篇 电气工程
- 44 篇 信息与通信工程
- 39 篇 控制科学与工程
- 13 篇 机械工程
- 9 篇 生物工程
- 8 篇 电子科学与技术（可...
- 8 篇 化学工程与技术
- 8 篇 交通运输工程
- 6 篇 环境科学与工程（可...
- 5 篇 仪器科学与技术
- 5 篇 冶金工程
- 5 篇 安全科学与工程
- 4 篇 光学工程
- 4 篇 动力工程及工程热...
- 4 篇 水利工程
- 4 篇 石油与天然气工程
341 篇 理学
- 322 篇 数学
- 43 篇 系统科学
- 14 篇 生物学
- 12 篇 物理学
- 11 篇 统计学（可授理学、...
- 4 篇 化学
165 篇 管理学
- 158 篇 管理科学与工程(可...
- 44 篇 工商管理
18 篇 经济学
- 16 篇 应用经济学
6 篇 医学
- 4 篇 基础医学(可授医学...
- 4 篇 临床医学
4 篇 法学
- 4 篇 社会学
2 篇 教育学
2 篇 文学
2 篇 农学

主题

195 篇 integer programm...
88 篇 combinatorial op...
61 篇 optimization
59 篇 linear programmi...
23 篇 integer linear p...
16 篇 mixed integer pr...
14 篇 approximation al...
14 篇 dynamic programm...
13 篇 mixed-integer pr...
13 篇 combinatorial ma...
12 篇 mixed integer li...
12 篇 scheduling
11 篇 computational mo...
11 篇 constraint progr...
10 篇 mixed-integer li...
10 篇 mathematical pro...
10 篇 mathematical mod...
10 篇 algorithm analys...
9 篇 discrete mathema...
9 篇 artificial intel...

机构

8 篇 carnegie mellon ...
6 篇 georgia inst tec...
5 篇 department of co...
4 篇 univ bologna dei...
4 篇 ibm tj watson re...
4 篇 max planck inst ...
4 篇 mit cambridge ma...
4 篇 carnegie mellon ...
4 篇 department of co...
3 篇 mit alfred p slo...
3 篇 univ florida ind...
3 篇 zuse inst berlin...
3 篇 school of indust...
3 篇 univ wisconsin d...
3 篇 univ padua dipar...
3 篇 brown univ dept ...
3 篇 school of indust...
3 篇 univ pittsburgh ...
3 篇 georgia inst tec...
3 篇 mit 77 massachus...

作者

8 篇 nemhauser george...
7 篇 lodi andrea
7 篇 conforti michele
6 篇 weismantel rober...
6 篇 basu amitabh
5 篇 rousseau louis-m...
5 篇 woeginger gerhar...
5 篇 dilkina bistra
5 篇 van hoeve willem...
5 篇 linderoth jeff
5 篇 vielma juan pabl...
5 篇 balas egon
5 篇 dey santanu s.
5 篇 fischetti matteo
4 篇 munoz gonzalo
4 篇 bienstock daniel
4 篇 cornuéjols gérar...
4 篇 fukasawa ricardo
4 篇 raidl guenther r...
4 篇 dash sanjeeb

语言

734 篇 英文
5 篇 其他
4 篇 中文

检索条件"任意字段=13th International Conference on Integer Programming and Combinatorial Optimization"

共 743 条记录，以下是441-450 订阅

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

详细简洁

排序：

A combined local search and integer programming approach to the traveling tournament problem 9

A combined local search and integer programming approach to ...

引用

9th international conference on the Practice and theory of Automated Timetabling, PATAT 2012

作者： Goerigk, Marc Westphal, Stephan Institut für Numerische und Angewandte Mathematik Universität Göttingen Lotzestr. 16-18 GöttingenD-37083 Germany

ISBN: (纸本)9788214052985

the traveling tournament problem is a well-known combinatorial optimization problem with application to sport leagues scheduling, that sparked intensive algorithmic research over the last decade. With the Challenge Traveling Tournament Instances as an established benchmark, the most successful approaches to the problem use meta-heuristics like tabu search or simulated annealing, partially heavily parallelized. integer programming based methods on the other hand are hardly able to tackle larger benchmark instances. In this work we present a hybrid approach that draws on the power of commercial integer programming solvers as well as the speed of local search heuristics. Our proposed method feeds the solution of one algorithm phase to the other one, until no further improvements can be made. the applicability of this method is demonstrated experimentally on the galaxy instance set, resulting in currently best known solutions for most of the considered instances. © PATAT 2012.

关键词： Tabu search

来源：评论

学校读者我要写书评

暂无评论

Guiding combinatorial optimization with UCT

Guiding combinatorial optimization with UCT

引用

9th international conference on Integration of Artificial Intelligence and Operations Research Techniques in Constraint programming, CPAIOR 2012

作者： Sabharwal, Ashish Samulowitz, Horst Reddy, Chandra IBM Watson Research Center Yorktown Heights NY 10598 United States

ISBN: (纸本)9783642298271

We propose a new approach for search tree exploration in the context of combinatorial optimization, specifically Mixed integer programming (MIP), that is based on UCT, an algorithm for the multi-armed bandit problem designed for balancing exploration and exploitation in an online fashion. UCT has recently been highly successful in game tree search. We discuss the differences that arise when UCT is applied to search trees as opposed to bandits or game trees, and provide initial results demonstrating that the performance of even a highly optimized state-of-the-art MIP solver such as CPLEX can be boosted using UCT's guidance on a range of problem instances. © 2012 Springer-Verlag.

关键词： combinatorial optimization

来源：评论

学校读者我要写书评

暂无评论

Cost-Optimized Dimensioning of Translucent WDM Networks with Mixed-Line-Rate Spectrum-Flexible Channels

Cost-Optimized Dimensioning of Translucent WDM Networks with...

引用

IEEE 13th international conference on High Performance Switching and Routing (HPSR)

作者： Eira, Antonio Pedro, Joao Pires, Joao Nokia Siemens Networks SA P-2720093 Amadora Portugal

ISBN: (纸本)9781457708329

In order for transport networks to cost-effectively provide higher capacity, it is expected that channel bit-rates beyond 100 Gb/s will be accomplished by resorting to a flexible WDM grid with variable channel spacing. Among the implications of this concept is the need for planning tools that fully exploit the additional degrees of freedom enabled by a flexible grid to further optimize network cost and spectral efficiency. this paper proposes an optimization framework to minimize the transponder and regenerator deployment cost in a translucent WDM network featuring channel bit-rates of 40, 100 and 400 Gb/s and multiple transmission formats per bit-rate, each characterized by its own spectral width, optical reach and cost properties. Firstly, we formulate the problem via a novel integer Linear programming (ILP) model, whose resolution finds the optimal (cheapest) feasible network configuration. Secondly, we propose an efficient heuristic called Narrowest First-Iterative Cost Reduction (NF-ICR) to handle network scenarios for which solving the ILP entails an unreasonable computational burden. the NF-ICR heuristic is shown to provide tight optimality bounds where the benchmark given by the ILP solution is attainable. For larger networks, we show that the use of a flexible grid and multiple format options for each bit-rate results in around 10% less cost in transponders and regenerators for metro networks, and a substantial increase in the total traffic load supported by the network. We also conclude that a distinction emerges between metro/regional scenarios and long-haul networks with long paths, wherein the shorter transparent reach of 400 Gb/s channels drives up the cost due to extra regeneration, favoring the use of parallelized solutions of lower bit-rate channels.

关键词： Network optimization optical translucent networks routing and spectrum allocation

来源：评论

学校读者我要写书评

暂无评论

High-Performance General Solver for Extremely Large-Scale Semidefinite programming Problems

High-Performance General Solver for Extremely Large-Scale Se...

引用

25th ACM/IEEE international conference for High Performance Computing, Networking, Storage and Analysis (SC)

作者： Fujisawa, Katsuki Endo, Toshio Sato, Hitoshi Yamashita, Makoto Matsuoka, Satoshi Nakata, Maho Chuo Univ Bunkyo Ku 1-13-27 Kasuga Tokyo 112 Japan Tokyo Inst Technol JST CREST Tokyo Japan RIKEN Wako Saitama Japan

ISBN: (纸本)9781467308052;9781467308045

Semidefinite programming (SDP) is one of the most important problems among optimization problems at present. It is relevant to a wide range of fields such as combinatorial optimization, structural optimization, control theory, economics, quantum chemistry, sensor network location and data mining. the capability to solve extremely large-scale SDP problems will have a significant effect on the current and future applications of SDP. In 1995, Fujisawa et al. started the SDPA(Semidefinite programming algorithm) Project aimed at solving large-scale SDP problems with high numerical stability and accuracy. SDPA is one of the main codes to solve general SDPs. SDPARA is a parallel version of SDPA on multiple processors with distributed memory, and it replaces two major bottleneck parts (the generation of the Schur complement matrix and its Cholesky factorization) of SDPA by their parallel implementation. In particular, it has been successfully applied to combinatorial optimization and truss topology optimization. the new version of SDPARA (7.5.0-G) on a large-scale supercomputer called TSUBAME 2.0 at the Tokyo Institute of Technology has successfully been used to solve the largest SDP problem (which has over 1.48 million constraints), and created a new world record. Our implementation has also achieved 533 TFlops in double precision for large-scale Cholesky factorization using 2,720 CPUs and 4,080 GPUs.

关键词： Parallel Computing optimization Applications GPGPU Dense Matrix Algebra Semidefinite programming General optimization Solver

来源：评论

学校读者我要写书评

暂无评论

An integer programming approach to optimal derivative accumulation

引用

6th international conference on Automatic Differentiation, AD 2012

作者： Chen, Jieqiu Hovland, Paul Munson, Todd Utke, Jean Mathematics and Computer Science Division Argonne National Laboratory Argonne IL 60439 United States

ISBN: (纸本)9783642300226

In automatic differentiation, vertex elimination is one of the many methods for Jacobian accumulation and in general it can be much more efficient than the forward mode or reverse mode (Forth et al. ACM Trans Math Softw 30(3):266-299, 2004;Griewank and Walther, Evaluating derivatives: principles and techniques of algorithmic differentiation, SIAM, Philadelphia, 2008). However, finding the optimal vertex elimination sequence of a computational graph is a hard combinatorial optimization problem. In this paper, we propose to tackle this problem with an integer programming (IP) technique, and we develop an IP formulation for it. this enables us to use a standard integer optimization solver to find an optimal vertex elimination strategy. In addition, we have developed several bound-tightening and symmetry-breaking constraints to strengthen the basic IP formulation. We demonstrate the effectiveness of these enhancements through computational experiments. © 2012 Springer-Verlag.

关键词： integer programming

来源：评论

学校读者我要写书评

暂无评论

Integration of AI and OR Techniques in Constraint programming for combinatorial optimization Problems - 9th international conference, CPAIOR 2012, Proceedings

Integration of AI and OR Techniques in Constraint Programmin...

引用

9th international conference on Integration of Artificial Intelligence and Operations Research Techniques in Constraint programming, CPAIOR 2012

ISBN: (纸本)9783642298271

the proceedings contain 26 papers. the topics discussed include: a contractor based on convex interval Taylor;a combined approach for solving constraints over finite domains and arrays;graph coloring facets from all-different systems;complete characterization of near-optimal sequences for the two-machine flow shop scheduling problem;global cyclic cumulative constraint;a computational geometry-based local search algorithm for planar location problems;flow-based combinatorial chance constraints;explaining flow-based propagation;constraint optimization problems and bounded tree-width revisited;a high level language for solver independent model manipulation and generation of hybrid solvers;reconsidering mixed integer programming and MIP-based hybrids for scheduling;activity-based search for black-box constraint programming solvers;and instance-specific algorithm configuration as a method for non-model-based portfolio generation.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Modeling games with the help of quantified integer linear programs

Modeling games with the help of quantified integer linear pr...

引用

13th international conference on Advances in Computer Games, ACG 2011

作者： Ederer, thorsten Lorenz, Ulf Opfer, thomas Wolf, Jan Institute of Mathematics Technische Universität Darmstadt Germany

ISBN: (纸本)9783642318658

Quantified linear programs (QLPs) are linear programs with mathematical variables being either existentially or universally quantified. the integer variant (Quantified linear integer program, QIP) is PSPACE-complete, and can be interpreted as a two-person zero-sum game. Additionally, it demonstrates remarkable flexibility in polynomial reduction, such that many interesting practical problems can be elegantly modeled as QIPs. Indeed, the PSPACE-completeness guarantees that all PSPACE-complete problems such as games like Othello, Go-Moku, and Amazons, can be described with the help of QIPs, with only moderate overhead. In this paper, we present the Dynamic Graph Reliability (DGR) optimization problem and the game Go-Moku as examples. © 2012 Springer-Verlag.

关键词： integer programming

来源：评论

学校读者我要写书评

暂无评论

optimization of energy supply systems in consideration of hierarchical relationship between design and operation

Optimization of energy supply systems in consideration of hi...

引用

25th international conference on Efficiency, Cost, optimization and Simulation of Energy Conversion Systems and Processes, ECOS 2012

作者： Yokoyama, Ryohei Ose, Shuhei Department of Mechanical Engineering Osaka Prefecture University Sakai Osaka Japan

ISBN: (纸本)9788866553229

To attain the highest performance of energy supply systems, it is necessary to rationally determine types, capacities, and numbers of equipment in consideration of their operational strategies corresponding to seasonal and hourly variations in energy demands. combinatorial optimization methods based on the mixedinteger linear programming (MILP) have been proposed to solve this design problem, and integer variables are used to express the selection, number, and on/off status of operation of equipment. However, the number of these variables increases with the numbers of equipment and periods for variations in energy demands, and affects the computation efficiency significantly. In this paper, a MILP method utilizing the hierarchical relationship between design and operation variables is proposed to solve the optimal design problem of energy supply systems efficiently: At the upper level, the values of design variables are optimized by the conventional branch and bound method;At the lower level, the values of operation variables are optimized independently at each period by the conventional branch and bound method;Both the levels are connected with each other to exchange data for optimization calculations. the proposed method is applied to a numerical study on the optimal design of a gas engine cogenetation system for electric power and hot water supply, and its validity and effectiveness are clarified.

关键词： Branch and bound method

来源：评论

学校读者我要写书评

暂无评论

Generic Model for University Course Timetabling Problem solved by Genetic Algorithm

Generic Model for University Course Timetabling Problem solv...

引用

10th international Industrial Simulation conference, ISC 2012

作者： Ahmad, Maqsood Caux, Christophe Gourgand, Michel Univ Blaise Pascal LIMOS UMR 6158 CNRS Campus Cezeaux BP 10125 F-63173 Aubiere France

ISBN: (纸本)9789077381717

the university course timetabling problem is a NP hard problem which must be solved by departments in the beginning of the semester. It is a difficult task for which universities devote a large amount of human and material resources every year. We have formulated the new problem which is a generalization of international Timetabling competition 2007. We have added 10 new constraints in competition problem which comes from different university environments (details are given in the "description of the problem" section). We have presented a mathematical model for the problem. the purpose of this paper is to make a model which would be more general and could be used by different universities according to their requirements with little changes in algorithm. Algorithm is very relaxed for the use of hard and soft constraint choices because hard and soft constraints are distinguished by violation penalty given to them (hard constraints have higher penalty than soft). We have randomly generated data for small, medium and large size problems for numerical applications, because the existing data sets could not be used as problem has many more extra constraints now. the objective function values, percentage of used seats, percentage of used slots in numerical application indicates that results are promising under the cover of so many constraints.

关键词： Course timetabling Genetic Algorithm integer programming combinatorial optimization

来源：评论

学校读者我要写书评

暂无评论

Profile-Guided Deployment of Stream Programs on Multicores 12

Profile-Guided Deployment of Stream Programs on Multicores

引用

13th ACM SIGPLAN/SIGBED international conference on Languages, Compilers, Tools and theory for Embedded Systems

作者： Farhad, S. M. Ko, Yousun Burgstaller, Bernd Scholz, Bernhard Univ Sydney Sydney NSW 2006 Australia Yonsei Univ Seoul 120749 South Korea

ISBN: (纸本)9781450312127

Because multicore architectures have become the industry standard, programming abstractions for concurrent programming are of key importance. Stream programming languages facilitate application domains characterized by regular sequences of data, such as multimedia, graphics, signal processing and networking. With stream programs, computations are expressed through independent actors that interact through FIFO data channels. A major challenge with stream programs is to load-balance actors among available processing cores. the workload of a stream program is determined by actor execution times and the communication overhead induced by data channels. Estimating communication costs on cache-coherent shared-memory multiprocessors is difficult, because data movements are abstracted away by the cache coherence protocol. Standard execution time profiling techniques cannot separate actor execution times from communication costs, because communication costs manifest in terms of execution time overhead. In this work we present a unified integer Linear programming (ILP) formulation that balances the workload of stream programs on cache-coherent multicore architectures. For estimating the communication costs of data channels, we devise a novel profiling scheme that minimizes the number of profiling steps. We conduct experiments across a range of StreamIt benchmarks and show that our method achieves a speedup of up to 4.02x on 6 processors. the number of profiling steps is on average only 17% of an exhaustive profiling run over all data channels of a stream program.

关键词： Languages Algorithms Profiling Performance optimization StreamIt multicore stream programming

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共75页 << < 41 42 43 44 45 46 47 48 49 50 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：