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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

2,011 篇 期刊文献
1,888 篇 会议
32 篇 学位论文
4 篇 资讯

馆藏范围

3,935 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

2,544 篇 工学
- 1,690 篇 计算机科学与技术...
- 830 篇 电气工程
- 676 篇 软件工程
- 431 篇 信息与通信工程
- 209 篇 控制科学与工程
- 149 篇 电子科学与技术（可...
- 105 篇 交通运输工程
- 104 篇 机械工程
- 74 篇 土木工程
- 49 篇 石油与天然气工程
- 36 篇 建筑学
- 34 篇 仪器科学与技术
- 28 篇 测绘科学与技术
- 26 篇 生物工程
- 25 篇 材料科学与工程（可...
- 24 篇 力学（可授工学、理...
- 24 篇 动力工程及工程热...
- 22 篇 环境科学与工程（可...
1,191 篇 理学
- 986 篇 数学
- 109 篇 物理学
- 79 篇 生物学
- 67 篇 系统科学
- 57 篇 统计学（可授理学、...
- 12 篇 化学
616 篇 管理学
- 587 篇 管理科学与工程(可...
- 80 篇 工商管理
- 17 篇 图书情报与档案管...
116 篇 经济学
- 86 篇 应用经济学
- 23 篇 理论经济学
41 篇 医学
- 17 篇 临床医学
29 篇 农学
13 篇 法学
10 篇 教育学
9 篇 文学
6 篇 艺术学
3 篇 军事学

主题

3,935 篇 integer linear p...
227 篇 optimization
226 篇 linear programmi...
170 篇 routing
164 篇 costs
114 篇 processor schedu...
113 篇 heuristic algori...
92 篇 scheduling
90 篇 computer science
89 篇 bandwidth
85 篇 energy consumpti...
79 篇 algorithm design...
77 篇 testing
75 篇 cost function
74 篇 resource managem...
72 篇 optical fiber ne...
71 篇 constraint optim...
71 篇 computational mo...
71 篇 telecommunicatio...
70 篇 delay

机构

12 篇 xidian univ sch ...
11 篇 macau univ sci &...
11 篇 naval postgradua...
10 篇 duke univ dept e...
9 篇 kyoto univ grad ...
9 篇 southwest jiaoto...
8 篇 nanyang technol ...
8 篇 kyoto univ grad ...
7 篇 beijing jiaotong...
7 篇 tech univ munich...
6 篇 macau univ sci &...
6 篇 wright state uni...
6 篇 polytech bari de...
6 篇 department of el...
6 篇 kyoto univ kyoto
6 篇 kyoto university...
6 篇 consejo nacl inv...
6 篇 univ massachuset...
6 篇 department of el...
5 篇 new jersey inst ...

作者

27 篇 oki eiji
18 篇 li zhiwu
15 篇 dao thanh hai
14 篇 sato takehiro
13 篇 de sousa amaro
12 篇 santos dorabella
11 篇 fanti maria pia
11 篇 delorme xavier
10 篇 hanzalek zdenek
10 篇 eiji oki
9 篇 maria pia fanti
9 篇 picelli renato
9 篇 dolgui alexandre
9 篇 mangini agostino...
9 篇 tomiyama hiroyuk...
9 篇 gouveia luis
8 篇 dauzere-peres st...
8 篇 soumya j.
8 篇 righini giovanni
8 篇 gomes teresa

语言

3,536 篇 英文
365 篇 其他
26 篇 中文
3 篇 土耳其文
2 篇 葡萄牙文
1 篇 西班牙文

检索条件"主题词=integer linear programming"

共 3935 条记录，以下是3541-3550 订阅

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

详细简洁

排序：

Highly efficient spare capacity planning for generalized link restoration 12

Highly efficient spare capacity planning for generalized lin...

引用

12th International Conference on Computer Communications and Networks (ICCCN 2003)

作者： Krishnamurthy, S Chandrasekaran, R Venkatesan, S Dawande, M Univ Texas Dept Comp Sci Richardson TX 75083 USA

ISBN: (纸本)0780379454

We consider the problem of spare capacity allocation in mesh networks for link restoration. Only single link failures are considered and restored traffic is not split across multiple paths. In our model, links that are not part of the original transport network can also be used for restoration. This model, which is a generalized version, is different from the traditional model studied in literature. We present two heuristics to solve this problem and compare their performance with known lower bounds and the optimal solution. In numerous simulation experiments on randomly generated graphs containing up to 100 nodes, the heuristics often produced solutions within 3% of the lower bound for sparse graphs. The integer linear programming solutions suggest that the heuristic solutions are closer to optimal than indicated by the deviation from the lower bounds. The results are optimal or near optimal (within 0.5% of the optimum values) for small graphs containing up to 8 nodes and 18 edges.

关键词： Bidirectional control Capacity planning Computer network management Computer science Costs integer linear programming Joining processes Mesh networks Telecommunication traffic Traffic control

来源：评论

学校读者我要写书评

暂无评论

Peak power minimization through datapath scheduling

Peak power minimization through datapath scheduling

引用

IEEE-Computer-Society Annual Symposium on VLSI

作者： Mohanty, SP Ranganathan, N Chappidi, SK Univ S Florida Dept Comp Sci & Engn Nanomat & Nanomfg Res Ctr Tampa FL 33620 USA

ISBN: (纸本)0769519040

In this paper, we describe new integer linear programming models and algorithms for datapath scheduling that aim at minimizing peak power while maintaining performance. The first algorithm, MVDFC combines both multiple supply voltages and dynamic frequency clocking for peak power reduction, while the second algorithm, MVMC explores multiple supply voltages and multicycling. The algorithms use the number and type of different functional units at different operating voltages as the resource constraints. The effectiveness of the proposed scheduling algorithms is studied by estimating the peak power consumption and the power delay product (PDP) of the datapath circuit being synthesised. The algorithms have been applied to various high level synthesis benchmark circuits under different resource constraints. Experimental results show that for the MVDFC, under various resource constraints using two supply voltage levels (5.0V, 3.3V), average peak power reduction around 75% and average PDP reduction of 60% can be obtained. For the MVMC scheme, average peak power reduction is around 36% and average PDP reduction is 20%, for similar resource constraints.

关键词： Circuits Clocks Delay effects Delay estimation Energy consumption Frequency integer linear programming Minimization Scheduling algorithm Voltage

来源：评论

学校读者我要写书评

暂无评论

An integrated optimization strategy for saving energy on multiprocessor-on-a-chip architectures

An integrated optimization strategy for saving energy on mul...

引用

IEEE International SOC Conference

作者： Chen, G Kandemir, M Kolcu, I Penn State Univ University Pk PA 16802 USA

ISBN: (纸本)0780381823

In an on-chip multiprocessor, there exist two major ways of saving energy: voltage scaling and processor shut-down. This paper makes a case for an integrated strategy where these two techniques are applied in concert for the best energy savings. We present an integer linear programming (ILP) approach that selects the best combination of voltage scaling and processor shut-down.

关键词： Banking Computer architecture Dynamic voltage scaling Energy consumption Frequency Hardware Hip integer linear programming linear programming USA Councils

来源：评论

学校读者我要写书评

暂无评论

Taming the IXP network processor

Taming the IXP network processor

引用

Conference on programming Language Design and Implementation

作者： George, L Blume, M Toyota Technol Inst Chicago Chicago IL USA

We compile Nova, a new language designed for writing network processing applications, using a back end based on integer-linear programming (ILP) for register allocation, optimal bank assignment, and spills. The compiler's optimizer employs CPS as its intermediate representation;some of the invariants that this IR guarantees are essential for the formulation of a practical ILP model. Appel and George used a similar ILP-based technique for the IA32 to decide which variables reside in registers but deferred the actual assignment of colors to a later phase. We demonstrate how to carry over their idea to an architecture with many more banks, register aggregates, variables with multiple simultaneous register assignments, and, very importantly, one where bank- and register-assignment cannot be done in isolation from each other. Our approach performs well in practise-without causing an explosion in size or solve time of the generated integer linear programs.

关键词： network processors Intel IXA integer linear programming register allocation bank assignment programming languages code generation

来源：评论

学校读者我要写书评

暂无评论

Peak power minimization through datapath scheduling

Peak power minimization through datapath scheduling

引用

IEEE Computer Society Annual Symposium on VLSI

作者： S.P. Mohanty N. Ranganathan S.K. Chappidi Department of Computer Science and Engineering Nanomaterial and Nanomanufacturing Research Center University of South Florida Tampa FL USA

关键词： Voltage Scheduling algorithm Delay estimation Circuits Minimization integer linear programming Frequency Clocks Energy consumption Delay effects

来源：评论

学校读者我要写书评

暂无评论

Fuzzy decision guided component supplier selection

Fuzzy decision guided component supplier selection

引用

IEEE International Conference on Systems, Man and Cybernetics

作者： Xingang Huang Yoke San Wong Zhejie Liu Department of Mechanical Engineering National University of Singapore Singapore MESD Division Data Storage Institute Singapore

ISBN: (纸本)0780379527

Global market today demands rapid introduction of products while maintaining high quality and minimal costs. To accomplish the goals in a timely and efficient manner, companies are considering the power of collaboration across the product lifecycle. This paper proposes a fuzzy decision guided method to optimize the component supplier selection in a dynamic collaborative environment. An objective function is advanced to formalize the component supplier selection problem. Fuzzy factors, fuzzy decision of the selection and their relations are analyzed. A fuzzy decisions based optimization algorithm is developed to select a set of suppliers that can provide the components at low prices and in time.

关键词： Collaboration Optimization methods Mathematical programming Mechanical engineering Costs integer linear programming linear programming Memory Globalization Companies

来源：评论

学校读者我要写书评

暂无评论

An integrated optimization strategy for saving energy on multiprocessor-on-a-chip architectures

An integrated optimization strategy for saving energy on mul...

引用

IEEE International SOC Conference

作者： G. Chen M. Kandemir I. Kolcu CSE Department The Pennsylvania State University University Park USA Computation Department UMIST (University of Manchester Institute of Science and Technology) Manchester UK

ISBN: (纸本)0780381823

关键词： Energy consumption Dynamic voltage scaling Computer architecture Hardware Hip USA Councils integer linear programming linear programming Banking Frequency

来源：评论

学校读者我要写书评

暂无评论

Finding least cost proofs using high order recurrent networks

Finding least cost proofs using high order recurrent network...

引用

International Joint Conference on Neural Networks (IJCNN)

作者： A.M. Abdelbar E.A.M. Andrews G.A. Tagliarini Department of Computer Science American University Cairo Egypt Department of Computer Science North Carolina State University Wilmington USA

Cost-based abduction (CBA) is an important AI formalism for representing knowledge under uncertainty. In this formalism, evidence to be explained is treated as a goal to be proven, proofs have costs based on how much needs to be assumed to complete the proof, and the set of assumptions needed to complete the least-cost proof are taken as the best explanation for the given evidence. The problem of finding the least-cost proof for a given CBA system is NP-hard and current techniques have exponential complexity in the worst case. Computational intelligence approaches to this problem have not been previously explored. In this paper, we show how high order recurrent networks can be used to find least-cost proofs for CBA instances. We describe experimental results on 80 CBA instances using networks of up to 68 neurons.

关键词： Costs Computer science Neurons Artificial intelligence Uncertainty Computational intelligence integer linear programming Bayesian methods Logic programming

来源：评论

学校读者我要写书评

暂无评论

An enhanced passive testing tool for network protocols

An enhanced passive testing tool for network protocols

引用

International Conference on Computer Networks and Mobile Computing (ICCNMC)

作者： Dongluo Chen Jianping Wu Tan Ieong Chu Department of Computer Science Tsinghua University China

ISBN: (纸本)0769520332

We study passive testing on protocols to detect faults in network devices. An enhanced passive testing tool is developed using integer linear programming in determining the ranges of the variables. On-line pruning reveals the current configuration of the system and the transition covered. Network system monitoring is conducted in a formal and fine-granularity way.

关键词： Protocols System testing Fault detection integer linear programming Monitoring Automata Computer networks Computer science Probes Software tools

来源：评论

学校读者我要写书评

暂无评论

Rank bounds and integrality gaps for cutting planes procedures

Rank bounds and integrality gaps for cutting planes procedur...

引用

Annual IEEE Symposium on Foundations of Computer Science

作者： J. Buresh-Oppenheim N. Galesi S. Hoory A. Magen T. Pitassi University of Toronto Canada Universitat Politecnica de Catalunya Spain University of Toronto

We present a new method for proving rank lower bounds for Cutting Planes (CP) and several procedures based on lifting due to Lovasz and Schrijver (LS), when viewed as proof systems for unsatisfiability. We apply this method to obtain the following new results: first, we prove near-optimal rank bounds for Cutting Planes and Lovasz-Schrijver proofs for several prominent unsatisfiable CNF examples, including random kCNF formulas and the Tseitin graph formulas. It follows from these lower bounds that a linear number of rounds of CP or LS procedures when applied to relaxations of integer linear programs is not sufficient for reducing the integrality gap. Secondly, we give unsatisfiable examples that have constant rank CP and LS proofs but that require linear rank resolution proofs. Thirdly, we give examples where the CP rank is O(log n) but the LS rank is linear. Finally, we address the question of size versus rank: we show that, for both proof systems, rank does not accurately reflect proof size. Specifically, there are examples with polynomial-size CP/LS proofs, but requiring linear rank.

关键词： integer linear programming linear programming Polynomials Councils Integral equations Ellipsoids Optimization methods Instruments Computer science

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共394页 << < 351 352 353 354 355 356 357 358 359 360 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：