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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入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,889 篇 会议
32 篇 学位论文
4 篇 资讯

馆藏范围

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

日期分布

学科分类号

2,544 篇 工学
- 1,690 篇 计算机科学与技术...
- 829 篇 电气工程
- 677 篇 软件工程
- 430 篇 信息与通信工程
- 210 篇 控制科学与工程
- 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,934 篇 integer linear p...
226 篇 optimization
225 篇 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,535 篇 英文
365 篇 其他
26 篇 中文
3 篇 土耳其文
2 篇 葡萄牙文
1 篇 西班牙文

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

共 3934 条记录，以下是3671-3680 订阅

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

详细简洁

排序：

Bandwidth maximization in IP over WDM path networks

Bandwidth maximization in IP over WDM path networks

引用

1st Annual Conference on Optical Networking and Communications (OptiComm 2000)

作者： Harai, H Kubota, F Commun Res Labs Commun Network Sect Commun Syst Div Koganei Tokyo 1848795 Japan

ISBN: (纸本)081943907X

The emerging IP over WDM will be a new layer structure with a help of MPLS and OXC. To use WDM's large transmission capacity effectively, we design TP over WDM networks that reconfigure TP routing and lightpaths every day or month. Using integer linear programming, we formulate a problem that maximizes the network throughput;that is, the sum of the bandwidths allocated to an end-to-end node pair. This formulation is applicable to a network that is composed of twenty nodes and eight wavelengths. In such a network, we show maximization level of the network throughput derived from our formulation.

关键词： IP over WDM lightpath configuration multi-hop routing bandwidth maximization integer linear programming

来源：评论

学校读者我要写书评

暂无评论

Self-unit commitment of thermal units in a competitive electricity market

Self-unit commitment of thermal units in a competitive elect...

引用

IEEE Summer Meeting Power Engineering Society

作者： J. Garcia-Gonzalez J. Barquin INSTITUTO DE INVESTIGACI6N TECNOLóGICA Universidad Pontificia Comillas de Madrid Madrid Spain

This paper addresses the problem a generating utility faces in order to decide which of its thermal units to start-up and to shutdown before submitting the hourly bids to a day-ahead market based on simple bids. The self-unit commitment model is formulated as a deterministic optimisation problem where the expected profit is maximised using mixed-integer linear programming techniques. When the market price cannot be considered as an exogenous variable, the authors propose to introduce, explicitly, the market behaviour by means of the expected hourly supply and demand functions. Operation costs included are fuel costs, shutdown costs and start-up costs. Temporal links as ramp constraints are also taken into account. Expected incomes considered are not only pool energy sales, but also contracts for differences and physical bilateral contracts incomes. A detailed model formulation and a numerical case are presented.

关键词： Electricity supply industry Contracts Costs Power system modeling Marketing and sales Optimal scheduling Power markets integer linear programming Supply and demand Fuels

来源：评论

学校读者我要写书评

暂无评论

Program path analysis to bound cache-related preemption delay in preemptive real-time systems

Program path analysis to bound cache-related preemption dela...

引用

International Workshop on Hardware/Software Codesign (CODES)

作者： H. Tomiyama N.D. Dutt Center for Embedded Computer Systems University of California Irvine CA USA

Unpredictable behavior of cache memory makes it difficult to statically analyze the worst-case performance of real-time systems. This problem is exacerbated in case of preemptive multitask systems due to intertask cache interference, called Cache-Related Preemption Delay (CRPD). This paper proposes an approach to analysis of the tight upper bound on CRPD which a task might impose on lower-priority tasks. Our method determines the program execution path of the task which requires the maximum number of cache blocks using an integer linear programming technique. Experimental results show that our approach provides up to 69% tighter bounds on CRPD than a previous approach.

关键词： Real time systems Cache memory Performance analysis Interference integer linear programming System performance Permission Degradation Delay systems Embedded computing

来源：评论

学校读者我要写书评

暂无评论

Memory test time reduction by interconnecting test items

Memory test time reduction by interconnecting test items

引用

Asian Test Symposium (ATS)

作者： Wen-Jer Wu Chuan Yi Tang Cadence Design Systems GmbH Hsinchu Taiwan Department of Computer Science National Tsing Hua University Hsinchu Taiwan

The idea is to interconnect test items to reuse memory states left from the previous test item for saving initialization and verification sequences. Meanwhile, signal settling time of the tester between two consecutive test items being applied can also be minimized since all test items are connected together into a continuous one. The interconnection problem is transformed to the Rural Chinese Postman (RCP) problem. The RCP problem is a famous NP-hard problem, one way to solve the RCP problem is by modeling as an integer linear programming (ILP) model. However, in the worst case, it will incur an exponential number of constraints; therefore, it is not suitable for practical usage. Instead of putting all constraints at once, we generate and solve a number of successive ILP models with the smaller number of constraints. The total numbers of iterations and constraints applied to solve ILP models are analyzed and compared.

关键词： Testing integer linear programming Performance evaluation Voltage Research and development Timing Fault detection Computer science Protocols Production

来源：评论

学校读者我要写书评

暂无评论

Some properties of discrete lot sizing and scheduling problem with setup times using integral demand

Some properties of discrete lot sizing and scheduling proble...

引用

IEEE International Conference on Management of Innovation and Technology, ICMIT

作者： Youngjoon Park Sheung-Kown Kim Department of I.E Korea University South Korea

ISBN: (纸本)0780366522

Discrete lot sizing and scheduling problem (DLSP) is the problem of determining a minimal cost production schedule such that dynamic demand is fulfilled without backlogging in a single stage manufacturing process. The problem requires solution of the sequencing and sizing of production lots for a number of different items over a discrete and finite planning horizon. Especially, when we consider setup times in the model, the problem is known to be NP-hard. We developed a formulation different from the conventional DLSP, in that setup costs are charged only when production begins with a new production lot of different items, while the general DLSP charges the setup costs whenever a new production lot begins. We assumed that the demand could be met by the integral quantity with DLSP instead of binary quantity. To support our arguments several propositions are introduced.

关键词： Lot sizing Costs Job shop scheduling Dynamic scheduling Manufacturing processes Production planning Parallel machines Lagrangian functions integer linear programming Dynamic programming

来源：评论

学校读者我要写书评

暂无评论

On the comparison of optical WDM mesh network protection strategies

On the comparison of optical WDM mesh network protection str...

引用

MILCOM, Military Communications Conference

作者： C. Baworntummarat L. Wuttisittikulkij Department of Electrical Engineering Faculty of Engineering Chulalongkorn University Bangkok Thailand

ISBN: (纸本)0780365216

This paper presents a comprehensive investigation of three optical wavelength-division multiplexed (WDM) mesh network protection approaches, name minimal cost, single link basis and disjoint path approaches. The operation of each approach is described and their performances are extensively evaluated and compared. Key aspects that are taken into the consideration and comparison of the designs include a spare capacity requirement, ease of operation and practical feasibility. A mathematical model based on integer linear programming is introduced to obtain a lower bound on the spare capacity requirement for full protection against all single link failures. Two heuristic algorithms have also been developed to perform wavelength resource under both normal and failure conditions for both systems with and without wavelength conversion capability. It is shown that the minimal cost approach can accomplish the lowest extra cost requirement for protection, but this approach is considered not appropriate for practical applications due to complicated restoration and management. The single link basis scheme is on the other hand more practical and very cost efficient. For the disjoint path technique, the cost for spare capacity is generally slightly greater than that of the single link basis scheme. Its main advantages lie in the simple reconfiguration and inherent protection against node failure for in-transit traffic. Finally, a new framework for obtaining a good spare capacity cost estimate of a mesh restorable network is presented.

关键词： Optical fiber networks Wavelength division multiplexing WDM networks Mesh networks Protection Costs Optical wavelength conversion Performance evaluation Mathematical model integer linear programming

来源：评论

学校读者我要写书评

暂无评论

Hybrid genetic algorithms for scheduling bus and train drivers

Hybrid genetic algorithms for scheduling bus and train drive...

引用

Congress on Evolutionary Computation

作者： R.S.K. Kwan A. Wren A.S.K. Kwan School of Computer Studies University of Leeds Leeds UK

Introduces the subject of bus- and train-driver scheduling, and outlines a standard successful approach (TRACS II) using a blend of heuristics and integer linear programming. We discuss a few limitations of this system; in order to overcome these, we have investigated a range of metaheuristics and constraint programming approaches, and some of these are outlined. Finally, we present a hybrid genetic algorithm which is successfully used to overcome the above limitations. In this approach, all probable potential shifts are generated according to well-developed heuristics that are already used in TRACS II. The selection of such shifts to form a schedule is modeled as a set-covering problem, and the relaxation of this problem, ignoring integer conditions, is solved to optimality. A genetic algorithm then develops a solution schedule based on some of the characteristics of the relaxed solution. It is suggested that this approach might be suitable for other set-covering problems.

关键词： Genetic algorithms Vehicle driving Processor scheduling integer linear programming NP-hard problem

来源：评论

学校读者我要写书评

暂无评论

Automatic derivation of Petri net based distributed specification with optimal allocation of resources

Automatic derivation of Petri net based distributed specific...

引用

IEEE International Conference on Automated Software Engineering (ASE)

作者： K. El-Fakih H. Yamaguchi G. v. Bochmann T. Higashino School of Information Technology and Engineering University of Ottawa Ottawa ONT Canada Graduate School of Engineering Science Osaka University Toyonaka Osaka Japan

In this paper, we present a method for the synthesis of extended Petri net-based distributed specifications. Our method finds an optimal allocation of resources (computational data) that optimizes the derived distribu... 详细信息

关键词： Resource management Protocols Information technology Cost function Fires Distributed computing Optimization methods Context integer linear programming Input variables

来源：评论

学校读者我要写书评

暂无评论

Minimum crosstalk channel routing with dogleg

Minimum crosstalk channel routing with dogleg

引用

IEEE International Symposium on Circuits and Systems (ISCAS)

作者： Kuo-Chih Hsu Yu-Chung Lin Po-Xun Chiu Tsai-Ming Hsieh Department of Information and Computer Engineering Chung Yuan Christian University China Department of Electronic Engineering Chung Yuan Christian University China

ISBN: (纸本)0780354826

In this paper, we present an approach to the gridded channel routing problem with the objectives of satisfying crosstalk constraints on the nets and minimizing the total crosstalks among all of the nets. Given an initial routing solution generated by a conventional channel routing algorithm, the reduction of crosstalks is carried out by the reassignment of the horizontal wire segments. In order to further reduce the crosstalks, doglegs are allowed for some specified wire segments. To effectively and optimally perform the reassignment process, an integer linear programming (ILP) formulation is proposed. Experimental results show that our algorithm can improve the minslack and the total crosstalks significantly compared with the track permutation approach and the segment reassignment approach.

关键词： Crosstalk Routing Wire Integrated circuit interconnections Delay Very large scale integration Coupling circuits Capacitance integer linear programming Fabrication

来源：评论

学校读者我要写书评

暂无评论

High level synthesis for peak power minimization using ILP

High level synthesis for peak power minimization using ILP

引用

International Conference on Application Specific Systems (ASAP), Architectures and Processors

作者： Wen-Tsong Shiue Center for Low Power Electronics Department of Electrical Engineering Arizona State University Tempe AZ USA

The work presented in this paper focuses on behavioral level power optimization. Specifically, we address the problem of scheduling a data-flow graph under latency constraints. We have developed an integer linear program (ILP) model and a Modified Force-Directed Scheduling (MFDS) that minimize the peak power while satisfying timing constraints. Our integer linear programming method extends the traditional ILP approach that minimizes resources to include peak power consideration while adding extensions for multi-cycle and pipelined arithmetic components. In our benchmark results, the peak power is reduced after scheduling based on ILP method and MFDS algorithm and is reduced significantly after scheduling and pipelining are both applied. The results obtained by the heuristic-based algorithms (MFDS) match very well with those obtained by the integer linear programming (ILP) methods. While the results obtained by heuristic-based algorithm are approximate, the results obtained by the integer linear programming methods are optimal. But the heuristic-based algorithm is faster than the integer linear programming methods.

关键词： High level synthesis Delay Energy consumption Voltage Timing Registers integer linear programming Circuits Throughput Low power electronics

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共394页 << < 364 365 366 367 368 369 370 371 372 373 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：