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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

馆藏范围

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

日期分布

学科分类号

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

主题

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

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

共 3932 条记录，以下是3771-3780 订阅

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

详细简洁

排序：

Fitness function design for genetic algorithms in cost evaluation based problems

Fitness function design for genetic algorithms in cost evalu...

引用

IEEE International Conference on Evolutionary Computation

作者： J.A. Lima N. Gracias H. Pereira A. Rosa Systems and Robotics Institute Instituto Superior Técnico Spain Escola Superior de Tecnologia-IPS Systems and Robotics Institute Spain

This work presents a class of scaling functions for genetic algorithms. These functions imply individual performance to be expressed as a set of costs. Two basic functions are obtained. Both are based in exponential functions and contain a selectivity parameter assuring an adjustable degree of discernment between individuals. The first is translation invariant while the second is both translation and scale invariant. Three examples were used to compare these scaling functions with linear scaling: an integer linear programming problem; a best path finding problem; and a best path finding problem with deceiving characteristics. In all examples, exponential based functions achieved better results than linear scaling.

关键词： Algorithm design and analysis Genetic algorithms Cost function Robots integer linear programming Robotics and automation Convergence Band pass filters Dynamic range System identification

来源：评论

学校读者我要写书评

暂无评论

A mathematical programming approach to the channel assignment problem in radio networks

A mathematical programming approach to the channel assignmen...

引用

IEEE Conference on Vehicular Technology (VTC)

作者： A.I. Giortzis L.F. Turner Department of Electrical and Electronic Engineering Imperial College of Science Technology and Medicine London UK

The demand for mobile telephone service is increasing rapidly. A new formulation for the channel assignment problem (CAP) is proposed. The CAP has been formulated as an integer linear programming problem including compatibility and requirement constraints. For the solution of the resulting formulation conventional branch and bound methods have been used. The exploitation of the problem's special structure can improve the computational efficiency of the algorithm used. The algorithm has been applied to different benchmark problems that have appeared in the literature. The presented examples illustrate that using the proposed formulation and a specially designed branch and bound algorithm is possible to solve optimally and efficiently fairly large channel assignment problems.

关键词： Mathematical programming Intelligent networks Radio networks Symmetric matrices integer linear programming Telephony Base stations Electromagnetic compatibility Educational institutions Computational efficiency

来源：评论

学校读者我要写书评

暂无评论

Propagation of I/O-variables in massively parallel processor arrays

Propagation of I/O-variables in massively parallel processor...

引用

Euromicro Workshop on Parallel and Distributed Processing

作者： D. Fimmel R. Merker Department of Electrical Engineering Dresden Germany

The underlying design method for massively parallel processor arrays allows one to exploit parallelism in a broader range, because the I/O variables are not considered during the design process of a full-size array. As a consequence of this approach, a reallocation of the I/O ports of the I/O variables at the boundary processors of the processor array is necessary. Algorithms are described for the reallocation of the I/O ports at the array boundaries, leading to a minimal additional latency and taking systolic constraints into account. integer linear programming is used to solve the optimization problems that arise.

关键词： Space technology Concurrent computing Input variables Algorithm design and analysis Process design Delay Equations Embedded computing Design methodology integer linear programming

来源：评论

学校读者我要写书评

暂无评论

Unification of artificial intelligence with optimization for decision support: UNIK approach

Unification of artificial intelligence with optimization for...

引用

IEEE International Conference on Systems, Man and Cybernetics

作者： Jae Kyu Lee Graduate School of Management Korea Advanced Institute of Science and Technology Seoul South Korea

ISBN: (纸本)0780332806

This paper reviews the UNIK project which unifies the artificial intelligence (AI) with optimization models for decision support. Our goal is to unify the specification of problems to encompass as many hybrid type of problems as possible from both AI and optimization. Currently, the type of problems selected from the AI side are the rules, compatibility constraints, and neural networks, while linear programming and integer programming models from the optimization side. The key issue to be resolved for the unification is the unified representation of optimization model and rules so that they can understand each other. The second issue is designing the unified architecture and devising the solution method. This paper reviews the above issues one by one with illustrative applications.

关键词： Artificial intelligence Object oriented modeling linear programming Knowledge based systems Constraint optimization integer linear programming Neural networks Project management Technology management Artificial neural networks

来源：评论

学校读者我要写书评

暂无评论

Optimal decomposition of morphological structuring elements

Optimal decomposition of morphological structuring elements

引用

IEEE International Conference on Image Processing

作者： Hsin-Tai Yang Shie-Jue Lee Department of Electrical Engineering National Sun Yat-Sen University Kaohsiung Taiwan

ISBN: (纸本)0780332598

We propose a method of optimal morphological decomposition. We first formulate this kind of problem into a set of linear constraints, and then find out the solution to the set of linear constraints by using an integer linear programming technique. Our method has the following three advantages: (1) the size of the factors can be any n/spl times/n (n/spl ges/3), (2) it can be applied to both convex and concave simply-connected images; (3) optimality is selective and flexible.

关键词： Concurrent computing integer linear programming Morphology Pattern recognition Image edge detection Shape Pattern analysis Pipelines Morphological operations Computational efficiency

来源：评论

学校读者我要写书评

暂无评论

A method for bounding the effect of DMA I/O interference on program execution time

A method for bounding the effect of DMA I/O interference on ...

引用

Real-Time Systems Symposium (RTSS)

作者： Tai-Yi Huang J.W.-S. Liu D. Hull Department of Computer Science University of Illinois Urbana-Champaign Urbana IL USA

A DMA controller that operates in the cycle-stealing mode transfers data by "stealing" bus cycles from an executing program. This cycle stealing operation retards the progress of the executing program and extends its execution time. We first present a method that bounds the worst-case execution time of a program executing concurrently with a cycle-stealing DMA I/O operation in the simple case where the execution time of each machine instruction is fixed. We next extend this method to deal with the case of instruction-cache architectures. We demonstrate the effectiveness of our methods by the results of simulations of several programs.

关键词： Interference Computer architecture Computer science Computational modeling Processor scheduling Pipelines Computer aided instruction Concurrent computing integer linear programming Upper bound

来源：评论

学校读者我要写书评

暂无评论

A new rounding procedure for the assignment problem with applications to dense graph arrangement problems

A new rounding procedure for the assignment problem with app...

引用

Annual IEEE Symposium on Foundations of Computer Science

作者： S. Arora A. Frieze H. Kaplan Computer Science Princeton University USA Department of Mathimatics Carnegie Mellon University Pittsburgh PA USA

We present a randomized procedure for rounding fractional perfect matchings to (integral) matchings. If the original fractional matching satisfies any linear inequality, then with high probability, the new matching satisfies that linear inequality in an approximate sense. This extends the well-known LP rounding procedure of Raghavan and Thompson (1987), which is usually used to round fractional solutions of linear programs. It also solves an open problem of Luby and Nisan (1993) ("Design an NC procedure for converting near-optimum fractional matchings to near-optimum matchings.") We use the rounding procedure to design n/sup 0(logn//spl epsiv/(2)/) time algorithms for the following: (i) an additive approximation to the 0-1 Quadratic Assignment problem (QAP); (ii) a (1+E)-approximation for "dense" instances of many well-known NP-hard problems, including (an optimization formulation of) GRAPH-ISOMORPHISM, MIN-CUT-linear-ARRANGEMENT, MAX-ACYCLIC-SUBGRAPH, MIN-linear-ARRANGEMENT, and BETWEENNESS. (A "dense" graph is one in which the number of edges is /spl Omega/(n/sup 2/); denseness for the other problems is defined in an analogous way).

关键词： Polynomials Contracts Constraint optimization Operations research Cost function integer linear programming Vectors Approximation algorithms

来源：评论

学校读者我要写书评

暂无评论

Allocation of dual-stacks in data path synthesis

Allocation of dual-stacks in data path synthesis

引用

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

作者： I. Ahmad M.K. Dhodhi F.M. Ali Department of Electric and Computer Engineering Kuwait University Safat Kuwait

A general purpose storage structure called dual-stack, which is practically implementable, is explored for data path synthesis. Dual-stack is an extension of the conventional single-stack. Dual-stacks maintain an effective access separation among variables whose lifetime intervals overlap which is not possible in single-stacks. Utilizing this structure can lead to a better performance in the final implementation of the algorithm. The problem of allocating variables to stacks and interconnection allocation has been modeled as a 0-1 integer linear programming (ILP) formulation with the objective to design a data path with a minimum number of stacks, registers and interconnects. The effectiveness of the proposed storage structure is demonstrated with the elliptical wave filter benchmark example.

关键词： integer linear programming High level synthesis Random access memory Decoding Very large scale integration Design methodology Reflective binary codes Energy consumption Scheduling

来源：评论

学校读者我要写书评

暂无评论

Approximate strip packing

Approximate strip packing

引用

Annual IEEE Symposium on Foundations of Computer Science

作者： C. Kenyon E. Remila CNRS URA 1398 LIP ENS-Lyon Lyon France Centre Pierre Mendès-France I. U. T. Roanne Université J. Monnet France

We present an approximation scheme for strip-packing, or packing rectangles into a rectangle of fixed width and minimum height, a classical NP-hard cutting-stock problem. The algorithm finds a packing of n rectangles whose total height is within a factor of (1+/spl epsiv/) of optimal, and has running time polynomial both in n and in 1//spl epsiv/. It is based on a reduction to fractional bin-packing, and can be performed by 5 stages of guillotine cuts.

关键词： Strips Polynomials Application software Computer science Processor scheduling Algorithm design and analysis integer linear programming

来源：评论

学校读者我要写书评

暂无评论

Swing module scheduling: a lifetime-sensitive approach

Swing module scheduling: a lifetime-sensitive approach

引用

International Conference on Parallel Architecture and Compilation Techniques (PACT)

作者： J. Llosa A. Gonzalez E. Ayguade M. Valero Departament d Arquitectura de Computadors Universitat Poliltècnica de Catalunya Barcelona Spain

This paper presents a novel software pipelining approach, which is called Swing Modulo Scheduling (SMS). It generates schedules that are near optimal in terms of initiation interval, register requirements and stage count. Swing Modulo Scheduling is an heuristic approach that has a low computational cost. The paper describes the technique and evaluates it for the Perfect Club benchmark suite. SMS is compared with other heuristic methods showing that it outperforms them in terms of the quality of the obtained schedules and compilation time. SMS is also compared with an integer linear programming approach that generates optimum schedules but with a huge computational cost, which makes it feasible only for very small loops. For a set of small loops, SMS obtained the optimum initiation interval in all the cases and its schedules required only 5% more registers and a 1% higher stage count than the optimum.

关键词： Processor scheduling Pipeline processing Registers Proposals Throughput Scheduling algorithm Computational efficiency integer linear programming Parallel processing Iterative algorithms

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共394页 << < 374 375 376 377 378 379 380 381 382 383 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：