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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

41 篇 期刊文献
35 篇 会议
1 册 图书

馆藏范围

77 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

59 篇 工学
- 35 篇 计算机科学与技术...
- 23 篇 电气工程
- 12 篇 控制科学与工程
- 9 篇 软件工程
- 6 篇 信息与通信工程
- 5 篇 机械工程
- 4 篇 电子科学与技术（可...
- 2 篇 交通运输工程
- 1 篇 动力工程及工程热...
- 1 篇 化学工程与技术
- 1 篇 生物医学工程（可授...
29 篇 理学
- 23 篇 数学
- 4 篇 系统科学
- 4 篇 统计学（可授理学、...
- 2 篇 生物学
- 1 篇 物理学
- 1 篇 化学
23 篇 管理学
- 22 篇 管理科学与工程(可...
- 1 篇 图书情报与档案管...
1 篇 经济学
- 1 篇 理论经济学
1 篇 医学
- 1 篇 药学(可授医学、理...

主题

77 篇 branch and bound...
8 篇 algorithms
7 篇 branches
6 篇 global optimizat...
6 篇 branch and bound...
4 篇 dynamic programm...
3 篇 automatic verifi...
3 篇 interval analysi...
3 篇 optimal solution
3 篇 scheduling theor...
2 篇 tardiness
2 篇 approximation al...
2 篇 exact algorithms
2 篇 automatic differ...
2 篇 optimum performa...
2 篇 jobs
2 篇 tree searching
2 篇 network model
2 篇 optimization
2 篇 memory space

机构

4 篇 univ louisiana l...
4 篇 univ illinois de...
3 篇 so illinois univ...
2 篇 department of in...
2 篇 univ trier dept ...
2 篇 univ connecticut...
2 篇 univ louisiana l...
1 篇 natl taiwan univ...
1 篇 centre for wirel...
1 篇 north china elec...
1 篇 vienna univ econ...
1 篇 nanyang technol ...
1 篇 korea adv inst s...
1 篇 department of ma...
1 篇 google res mount...
1 篇 univ sydney univ...
1 篇 univ southampton...
1 篇 research laborat...
1 篇 bell labs murray...
1 篇 computer school ...

作者

4 篇 kearfott ralph b...
3 篇 kao gio k.
3 篇 jacobson sheldon...
3 篇 tyagi gaurav
3 篇 sewell edward c.
2 篇 castille jessie
2 篇 rajasekaran sang...
2 篇 davila jaime
2 篇 balla sudha
2 篇 hyun-jung kim
2 篇 tae-eog lee
2 篇 jun-ho lee
1 篇 li xi
1 篇 ibaraki t
1 篇 gary balas
1 篇 dür m
1 篇 konishi k
1 篇 bouvry p.
1 篇 federico heras
1 篇 potts cn

语言

73 篇 英文
4 篇 其他

检索条件"主题词=Branch and bound algorithms"

共 77 条记录，以下是51-60 订阅

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

详细简洁

排序：

Processing bounded Nearest Neighbor Query for Moving Object

Processing Bounded Nearest Neighbor Query for Moving Object

引用

3rd International Conference on Wireless Communications, Networking and Mobile Computing (WiCOM 2007)

作者： Liu Xiaofeng Chen Chuanbo Liu Yunsheng Huazhong Univ Sci & Technol Sch Soflware Engn Wuhan 430074 Peoples R China

ISBN: (纸本)9781424413119

This paper presented a new kind of query, bounded nearest neighbors query, which is based on a special distance, bounded distance, between two objects during given time interval. According to the relationship with continuous nearest neighbor query, a native algorithm is proposed. Based on branch and bound technique and proposed updating and visiting heuristics, recursive depth-first and heap-based best-first query processing algorithms are developed. An extensive study based on experiments performed with synthetic data sets show that the best-first algorithms outperforms the depth-first algorithms.

关键词： Moving object databases nearest neighbor query branch and bound algorithms TPR free

来源：评论

学校读者我要写书评

暂无评论

Trunk packing revisited

Trunk packing revisited

引用

6th International Workshop on Experimental algorithms

作者： Althaus, Ernst Baumann, Tobias Schoemer, Elmar Werth, Kai Johannes Gutenberg Univ Mainz Inst Informat D-6500 Mainz Germany

ISBN: (纸本)9783540728443

For trunk packing problems only few approximation schemes are known, mostly designed for the European standard DIN 70020 [6] with equally sized boxes [8, 9, 11, 12]. In this paper two discretized approaches for the US standard SAE J1100 [10] are presented, which make use of different box sizes. An exact branch-and-bound algorithm for weighted independent sets on graphs is given, using the special structure of the SAE standard. Another branch-and-bound packing algorithm using linear programs is presented. With these algorithms axis-oriented packings of different box sizes in an arbitrary trunk geometry can be computed efficiently.

关键词： approximation algorithms branch and bound algorithms branch and cut algorithms graph algorithms linear programming packing problems weighted independent set

来源：评论

学校读者我要写书评

暂无评论

Optimal coarse quantization of finite-length signals using integer programming 25

Optimal coarse quantization of finite-length signals using i...

引用

IEEE International Conference on Acoustics, Speech, and Signal Processing

作者： Demir, A Feldmann, P Bell Labs Murray Hill NJ 07974 USA

ISBN: (纸本)0780362934

This paper introduces a novel, discrete optimization based method for the computation of coarsely quantized, oversampled finite-length digital signals. The method, while only suitable for off-line computation, is more general than the established sigma-delta encoding technique, due to its capacity to take into account complex specifications and design trade-offs. Signal generation is formulated as a linearly constrained, convex, integer quadratic programming problem which is solved through an application specific branch-and-bound algorithm. The optimization method is illustrated with a fractional-N frequency synthesizer based modulator design example.

关键词： Integer Programming frequency synthesizers Quantization optimization method signals digital signals Custom design Delta sigma modulation line computation branch and bound algorithms Linearly quadratic programming

来源：评论

学校读者我要写书评

暂无评论

Combinatorial approach for sizing and optimal energy management of HEV including durability constraints 24

Combinatorial approach for sizing and optimal energy managem...

引用

24th IEEE International Symposium on Industrial Electronics (ISIE)

作者： Chauvin, Alan Hijazi, Alaa Bideaux, Eric Sari, Ali Univ Lyon INSA Lyon Lab Ampere UMR CNRS 5005 F-69621 Villeurbanne France Univ Lyon 1 UMRS CNRS 5005 Lab Ampere F-69622 Lyon France

ISBN: (纸本)9781467375542

This paper presents a combinatorial approach used to solve an optimization problem including component sizing and energy management control applied to an offroad hybrid electric vehicle with durability constraints. The problem under consideration is the optimization of the hybrid power supply system of an electric mini-excavator. It is composed of a fuel cell system and one energy storage system, i. e includes a lithium battery or a supercapacitors pack. The goal is to minimize the global cost of the machine during its entire working lifetime. In order to fulfill the requirements, an ageing model is included in the original problem to simulate the degradation of the battery and the fuel cell. The paper is focused on the reformulation of the nonlinear original problem into combinatorial subproblems. Then a branch and bound algorithm is applied to solve all sub-problems. Some results are presented to compare the different energy storages configurations.

关键词： Energy management Hybrid electric vehicles Power supply systems Porcine hemagglutinating encephalomyelitis virus High Endothelial Venule original problem fuel cell power systems lithium batteries component sizing branch and bound algorithms Durability Supercapacitors SIZING

来源：评论

学校读者我要写书评

暂无评论

Solving WCSP by Extraction of Minimal Unsatisfiable Cores

Solving WCSP by Extraction of Minimal Unsatisfiable Cores

引用

25th IEEE International Conference on Tools with Artificial Intelligence (ICTAI)

作者： Lecoutre, Christophe Paris, Nicolas Roussel, Olivier Tabary, Sebastien Univ Lille Nord France CNRS UMR 8188 CRIL Rue UnivSP 16 F-62307 Lens France

ISBN: (纸本)9781479929719

Usual techniques to solve WCSP are based on cost transfer operations coupled with a branch and bound algorithm. In this paper, we focus on an approach integrating extraction and relaxation of Minimal Unsatisfiable Cores in order to solve this problem. We derive our approach in two ways: an incomplete, greedy, algorithm and a complete one.

关键词： branch and bound algorithms greedy algorithm Core samples core Minimal transfer operations Foci of an Ellipse Solve Relaxation relaxation

来源：评论

学校读者我要写书评

暂无评论

Box In the Box: Joint 3D Layout and Object Reasoning from Single Images

Box In the Box: Joint 3D Layout and Object Reasoning from Si...

引用

IEEE International Conference on Computer Vision (ICCV)

作者： Schwing, Alexander G. Fidler, Sanja Pollefeys, Marc Urtasun, Raquel Swiss Fed Inst Technol Zurich Switzerland TTI Chicago Chicago IL USA

ISBN: (纸本)9781479928392

In this paper we propose an approach to jointly infer the room layout as well as the objects present in the scene. Towards this goal, we propose a branch and bound algorithm which is guaranteed to retrieve the global optimum of the joint problem. The main difficulty resides in taking into account occlusion in order to not over-count the evidence. We introduce a new decomposition method, which generalizes integral geometry to triangular shapes, and allows us to bound the different terms in constant time. We exploit both geometric cues and object detectors as image features and show large improvements in 2D and 3D object detection over state-of-the-art deformable part-based models.

关键词： Boxes Buxus sempervirens Object detection layouts branch and bound algorithms image feature global optimum Joints Reasoning

来源：评论

学校读者我要写书评

暂无评论

ZigBee Cluster Tree Formation For Time-bounded Data Flows in One Collision Domain 11

ZigBee Cluster Tree Formation For Time-Bounded Data Flows in...

引用

IEEE World Conference on Factory Communication Systems (WFCS)

作者： Ahmad, Aasem Hanzalek, Zdenek Czech Tech Univ FEE DCE Prague Czech Republic

ISBN: (纸本)9781479982448

We study one-collision domain ZigBee cluster-tree design problems to satisfy periodic time-bounded data flows. The formation of the cluster-tree topology can be seen as a bounded-degree-and-depth tree which is an NP-complete problem. The objective is to minimize the number of clusters such that all flows can take place and there exists a cluster schedule that meets the deadlines of the flows. For the resulting tree, the cluster schedule is required to be energy efficient, which can be achieved by maximizing the length of the schedule period, and consequently, increasing the lifetime of the network. We present a Cluster-Tree Formation and Energy-Efficient clusters scheduling algorithm, CFEFS, based on the Hungarian algorithm, the Maximum Matching algorithm and the branch and bound algorithm to tackle this design problem that integrates the cluster formation and the cluster scheduling in one problem.

关键词： Cluster Tree design problems Energy efficiency ZigBee branch and bound algorithms Flow Clusters

来源：评论

学校读者我要写书评

暂无评论

Parallel Top-K Similarity Join algorithms Using MapReduce

Parallel Top-K Similarity Join Algorithms Using MapReduce

引用

28th IEEE International Conference on Data Engineering (ICDE)

作者： Kim, Younghoon Shim, Kyuseok Seoul Natl Univ Dept EECS Seoul 151 South Korea

ISBN: (纸本)9781467300421

There is a wide range of applications that require finding the top-k most similar pairs of records in a given database. However, computing such top-k similarity joins is a challenging problem today, as there is an increasing trend of applications that expect to deal with vast amounts of data. For such data-intensive applications, parallel executions of programs on a large cluster of commodity machines using the MapReduce paradigm have recently received a lot of attention. In this paper, we investigate how the top-k similarity join algorithms can get benefits from the popular MapReduce framework. We first develop the divide-and-conquer and branch-and-bound algorithms. We next propose the all pair partitioning and essential pair partitioning methods to minimize the amount of data transfers between map and reduce functions. We finally perform the experiments with not only synthetic but also real-life data sets. Our performance study confirms the effectiveness and scalability of our MapReduce algorithms.

关键词： Parallel Lines Scalability branch and bound algorithms algorithms data transmission partitions Pairing

来源：评论

学校读者我要写书评

暂无评论

Scheduling a Wet Station Using a branch and bound Algorithm

Scheduling a Wet Station Using a Branch and Bound Algorithm

引用

IEEE International Conference on Systems, Man, and Cybernetics

作者： Hyun-Jung Kim Jun-Ho Lee Tae-Eog Lee Department of Industrial and Systems Engineering Korea Advanced Institute of Science and Technology (KAIST)

ISBN: (纸本)9781467317139

We examine a scheduling problem of a wet station with multiple job flows. The wet station performs cleaning processes for removing residual contaminants after wafer fabrication processes. It consists of several chemical and rinse baths, and multiple transport robots. Most studies on scheduling robotized systems including a wet station assume identical jobs and deal with cyclic scheduling that repeats a predefined work cycle. However, jobs arrive dynamically and many different jobs are processed concurrently at a wet station. We therefore examine a non-cyclic scheduling problem of the wet station to minimize the makespan. We first develop a Petri net model and solve the problem using a branch and bound (B & B) algorithm. We also propose a dynamic branching method and evaluate a lower bound based on a bottleneck process. During searching the nodes, we analyze deadlocks and add places to the Petri net model for precedence relations among the robot tasks by applying the deadlock prevention conditions. We finally show that the proposed B & B algorithm is sufficient to solve practical problems.

关键词： branch and bound algorithm Petri net Wet station network model branches STATIONS wetting branch and bound algorithms jobs cyclic scheduling

来源：评论

学校读者我要写书评

暂无评论

Instruction scheduling of VLIW Architectures for balanced power consumption 05

Instruction scheduling of VLIW Architectures for balanced po...

引用

10th Asia and South Pacific Design Automation Conference

作者： Xiao, Shu Lai, Edmund M-K. Nanyang Technol Univ Sch Comp Engn Singapore 639798 Singapore

ISBN: (纸本)0780387368

An instruction word in VLIW (very long instruction word) processors consists of a variable number of individual instructions. Therefore the power consumption variation over time significantly depends on the parallel instruction schedule generated by the compiler. Sharp power variations across time cause power supply noises, degrade chip reliability and accelerate battery exhaustion. This paper proposes a branch and bound algorithm for instruction scheduling of VLIW architectures that effectively minimizing power v ariation without degrading the speed. Our experimental results demonstrate the efficiency of our algorithm compared with previously presented approaches. Finally, a new rough sets based approach to the instruction-level VLIW power model for this instruction scheduling optimization problem is discussed.

关键词： processor scheduling parallel architectures instruction sets optimisation rough set theory VLIW architectures balanced power consumption very long instruction word processors power consumption variation parallel instruction schedule branch and bound algorithm power variation minimization rough sets instruction-level VLIW power model instruction scheduling optimization problem VLIW architecture branch and bound algorithms Instruction Scheduling instruction sets scheduling of multiprocessor Rough sets Parallel architectures Very long instruction word Rough set theory Power consumption power fluctuation instruction statement

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共8页 << < 1 2 3 4 5 6 7 8 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：