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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入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,009 篇 期刊文献
1,885 篇 会议
32 篇 学位论文
4 篇 资讯

馆藏范围

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

日期分布

学科分类号

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

主题

3,930 篇 integer linear p...
225 篇 linear programmi...
223 篇 optimization
169 篇 routing
162 篇 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...
71 篇 optical fiber ne...
71 篇 constraint optim...
71 篇 computational mo...
71 篇 delay
70 篇 telecommunicatio...

机构

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,608 篇 英文
291 篇 其他
24 篇 中文
3 篇 土耳其文
2 篇 葡萄牙文
1 篇 西班牙文

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

共 3930 条记录，以下是3841-3850 订阅

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

详细简洁

排序：

Optimization and Resynthesis of Complex Data-Paths

Optimization and Resynthesis of Complex Data-Paths

引用

Design Automation Conference

作者： H. Eveking S. Horeth Johann Wolfgang Goethe-University Frankfurt am Main Frankfurt Germany

The problem of the optimization of complex data-paths relative to a repertoire of specified operations is discussed. Data-paths can be simplified if interconnections are functionally redundant. Redundancy is detected by means of the universal quantification of ROBDD representations of the data-path and of the specified operations. The full logical complexity of ALU's described at the gate-level is considered. A 0-1 ILP formulation of the minimization problem is given and solved by means of ROBDD's. A solution of the prelogic rectification problem for control-signals is presented.

关键词： Data structures Boolean functions High level synthesis integer linear programming Simulated annealing Logic Automatic control Design automation Distributed computing Machinery

来源：评论

学校读者我要写书评

暂无评论

Utilization of Multiport Memories in Data Path Synthesis

Utilization of Multiport Memories in Data Path Synthesis

引用

Design Automation Conference

作者： Taewhan Kim C.L. Liu Deparment of computer science University of Illinois Urbana-Champaign Urbana IL USA

In this paper, a new approach to the problem of allocating multiport memory modules for data storage is presented. Previous approaches divide the allocation problem into two separate steps: (i) grouping the variables (or registers) to form memory modules and (ii) determining the interconnections between the memory modules and functional units. Yet, there is no easy way to predict the result of step (ii) during step (i). In our approach, we place primary importance on the cost of interconnections. Consequently, we try to minimize the cost of interconnections first and then to group the variables to form memory modules later. For a number of benchmark problems, it has been shown that this approach is quite effective.

关键词： Registers Costs High level synthesis Hardware integer linear programming Computer science Design automation Processor scheduling Read-write memory Multiplexing

来源：评论

学校读者我要写书评

暂无评论

Extended 0/1 LP formulation for the scheduling problem in high-level synthesis

Extended 0/1 LP formulation for the scheduling problem in hi...

引用

European Design Automation Conference

作者： H. Achatz Lehrstuhl Rechnestrukturen (Prof W. Grass Universitãt Passau Passau Germany

An extended zero-one linear programming (O/1 LP) model for the scheduling problem in high-level synthesis is presented. As an extension to former approaches, the 0/1 LP model can handle multifunctional function units as well as different execution times for different instances of the same operation type. These extensions are very important for the applicability of general high-level synthesis tools in real design tasks. The computing time for solving the optimization problems is also acceptable for the new powerful model, since new lower bounds have been introduced that drastically reduce the search space. Some experimental results are shown.< >

关键词： High level synthesis Processor scheduling Process design Operations research linear programming Resource management Computational modeling Simulated annealing integer linear programming Pipeline processing

来源：评论

学校读者我要写书评

暂无评论

An efficient algorithm for over-the-cell channel routing

An efficient algorithm for over-the-cell channel routing

引用

International Symposium on VLSI Technology, Systems and Applications

作者： Chieh Changfan Sung-Chuan Fang Jong-Sheng Chern Sao-Jie Chen Department of Electrical Engineering National Taiwan University Taipei Taiwan

ISBN: (纸本)0780309782

Previous researches assumed that the more nets being routed over the cells, the greater the reduction in channel density. In fact, only the routing of critical nets will contribute to the reduction of channel density. The authors propose a heuristic method to find critical nets and use free terminals to further reduce the channel density. Experimental results show that their approach reduces more channel density than previous researches and can speed up the process of over-the-cell routing.< >

关键词： Routing integer linear programming Inorganic materials Very large scale integration Councils Algorithm design and analysis Heuristic algorithms

来源：评论

学校读者我要写书评

暂无评论

The structure of assignment, precedence, and resource constraints in the ILP approach to the scheduling problem

The structure of assignment, precedence, and resource constr...

引用

IEEE International Conference on Computer Design: VLSI in Computers and Processors, (ICCD)

作者： S. Chaudhuri R.A. Walker J. Mitchell Department of Electrical Computer and Systems Engineering Rensselaer Polytechnic Institute Troy NY USA Department of Computer Science Rensselaer Polytechnic Institute Troy NY USA Department of Mathematics Rensselaer Polytechnic Institute Troy NY USA

Presents a general treatment of the combinatorial approach to the scheduling problem, enhancing previous formulations in the literature. The focus of this paper is a formal analysis of the integer linear programming (ILP) approach, which we use to evaluate the structure of our formulation. Polyhedral theory and duality theory are used to demonstrate that efficient solutions of the scheduling problem can be expected from a carefully formulated integer linear program. Furthermore, we use the theory of valid inequalities to tighten the constraints and make the formulation more efficient.< >

关键词： Scheduling algorithm Constraint theory High level synthesis integer linear programming Heuristic algorithms NP-complete problem Traveling salesman problems

来源：评论

学校读者我要写书评

暂无评论

Fast Enumeration of Solutions for Data Dependence Analysis and Data Locality Optimization

Fast Enumeration of Solutions for Data Dependence Analysis a...

引用

International Conference on Parallel Processing (ICPP)

作者： C. Eisenbeis O. Temam H. Wijshoff Domaine de Voluceau INRIA Le Chesnay France IRISA/INRIA Rennes France Department of Computer Science University of Leiden Leiden Netherlands

Most of the sophisticated optimization tools dealing with data dependence analysis, parallelization and data locality exploitation cannot provide satisfactory solutions to a number of problems because they are, in general, unable to precisely handle some complex systems of linear equations coming from dependence equations between array subscripts. For such cases, these algorithms either provide rough estimates or resort to unefficient and therefore costly enumeration strategies. In this paper, we present an efficient technique, named Fast Determination, for dealing with the enumeration problem which degrades the behavior of sophisticated algorithms. Incorporating Fast Determination would enhance the performance and accuracy of existing algorithms, and widen their scope of application.

关键词： Data analysis Equations integer linear programming Parallel processing Tin Degradation Algorithm design and analysis Testing linear algebra Computer science

来源：评论

学校读者我要写书评

暂无评论

Generalized ILP scheduling and allocation for high-level DSP synthesis

Generalized ILP scheduling and allocation for high-level DSP...

引用

Custom Integrated Circuits Conference (CICC)

作者： L.E. Lucke K.K. Parhi Department of Electrical Engineering University of Minnesota Minneapolis MN USA

integer linear programming (ILP) techniques have recently been proposed to solve the single iteration scheduling problem. In the present work, the integer linear programming formulation is generalized to support unfolded schedules. A new time assignment formulation which automatically pipelines and retimes the dataflow graph (DFG) is presented. A new processor allocation formulation which automatically unfolds the DFG is also presented. It is noted that this is the first time that systematic unfolding is proposed for improving processor utilization on digital signal processing architectures. These models fully optimize the processor utilization for a specific iteration period.

关键词： Digital signal processing Processor scheduling Feedback loop integer linear programming Signal processing Delay effects Flow graphs High level synthesis Signal processing algorithms Iterative algorithms

来源：评论

学校读者我要写书评

暂无评论

FGILP: An integer linear program solver based on function graphs 93

FGILP: An integer linear program solver based on function gr...

引用

IEEE International Conference on Computer-Aided Design

作者： Y.-T. Lai M. Pedram S.B.K. Vrudhula Department of EE-Systems University of Southern California Los Angeles CA USA Department of ECE University of Arizona Tucson AZ USA

ISBN: (纸本)9780818644900

Edge-valued binary-decision diagrams (EVBDDs) are directed acyclic graphs which can represent and manipulate integer functions as effectively as ordered binary-decision diagrams (OBDDs) do for Boolean functions. They have been used to perform logic verification and compute the decomposability of Boolean functions. In this paper, we present a new EVBDD application for solving integer linear programs (ILP), which is an NP-hard problem that appears in many applications. Our approach is to combine the benefits of the EVBDD data structure (in terms of subgraph sharing and caching of computational results) with the state-of-the-art ILP solving techniques. Our program, called FGILP (Function Graph ILP) has been implemented in C under the SIS environment. The preliminary results of FGILP are comparable to those of LINDO.

关键词： Boolean functions Data structures linear programming Equations Art integer linear programming Arithmetic Logic programming Contracts

来源：评论

学校读者我要写书评

暂无评论

Cell-Based Hierarchical Pitchmatching Compaction Using Minimal LP

Cell-Based Hierarchical Pitchmatching Compaction Using Minim...

引用

Design Automation Conference

作者： So-Zen Yao Chung-Kung Cheng Debaprosad Dutt S. Nahar Chi-Yuan Lo CSE Department University of California La Jolla CA USA AT&T Bell Labaratories Murray Hill NJ USA AT and T Bell Laboratories Murray Hill NJ USA

We describe a new linear programming (LP)-based hierarchical pitchmatching method. With a simplified treatment of the inter-cell constraints, the size of the LP problems is significantly smaller than the best known methods. In particular, the pitchmatching problem is decomposed into independent sub-problems by the natural slicing structure in layout. Each sub-problem is folded further to reduce the LP problem size. Experiments show that the LP problem size can be 10 times smaller than the best known result.

关键词： Compaction Postal services linear programming Integrated circuit layout Explosions Databases Application specific integrated circuits Libraries Error correction integer linear programming

来源：评论

学校读者我要写书评

暂无评论

A fast hill-climbing approach without an energy function for probabilistic reasoning

A fast hill-climbing approach without an energy function for...

引用

International Conference on Tools for Artificial Intelligence (ICTAI)

作者： E. Santos Department of Electrical and Computer Engineering Air Force Institute of Technology OH USA

integer linear programming (ILP) has long been an important tool for operations research akin to the AI search heuristics for NP-hard problems. However, there has been relatively little incentive to use it in AI, even though it also deals with optimization. The problem stems from the misperception that because the general ILP problem is difficult to solve, then it will be difficult for all cases. It is known that AI search at first glance also seems this way until one begins to apply it to a specific domain. Clearly, there are many gains to be had from studying the problem with a different perspective like ILP. The authors look at probabilistic reasoning with Bayesian networks. For some time now, they have been stalled by its computational complexities. Algorithms have been designed for small classes of networks, but have been mainly inextensible to the general case. In particular, the authors consider belief revision in Bayesian networks which is the search for the most probable explanation for some given evidence. They present a new approach for computing belief revision from the ILP point of view. By observing various properties inherent in Bayesian networks, one can successfully develop a hill-climbing strategy which does not require an energy function. This approach can handle the entire class of Bayesian networks. Furthermore, experimental results indicate that finding the most probable explanation can be accomplished fairly easily.

关键词： Artificial intelligence Bayesian methods Power system modeling integer linear programming Operations research Operating systems Computational complexity Heart Intelligent systems Computational intelligence

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共393页 << < 381 382 383 384 385 386 387 388 389 390 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：