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

International Conference on Computing, Networking and Communications

作者： Chien-Hao Huang Chia-Po Yu Chung-An Shen Department of Electronic and Computer Engineering National Taiwan University of Science and Technology

ISBN: (纸本)9781467385800

It has been shown that the Configurable Joint Detection-Decoding (CJDD) algorithms in MIMO systems can effectively reduce the complexity and improve the signal quality. Since the CJDD approach is based on the tree search algorithms and there exists various kinds of such methods with different characteristics, it is of great importance to explore the trade-offs between each algorithm and their impacts on different aspects of system performances. In this paper, we study the CJDD algorithm based on three types of tree search approaches: breadth-first search, depth-first search, and the Fano algorithm. We explicitly elucidate the advantages and disadvantages of each algorithm on the basis of timing complexity, area complexity, and run-time variability. Our goal is to shed more lights on the design and application of tree search type approaches on the MIMO wireless communication systems for different system design considerations.

关键词： MIMO Joint detection and decoding tree search algorithm

来源：评论

学校读者我要写书评

暂无评论

Cargo assembly planning

引用

EURO JOURNAL ON TRANSPORTATION AND LOGISTICS 2015年第3期4卷 321-354页

作者： Savelsbergh, Martin Smith, Olivia Univ Newcastle Sch Math & Phys Sci Callaghan NSW 2308 Australia IBM Res Melbourne Vic 3053 Australia

A critical component in a coal export supply chain is the stockyard at a terminal, as this is where coal from different mines is ''mixed'' in a stockpile before being loaded onto vessels. We develop a tree search algorithm for managing the stockyard aimed at maximizing the throughput. The algorithm relies on the analysis and use of geometric properties of a coal assembly plan when represented in a space-time diagram. A computational study establishes the efficacy of the algorithm and analyzes the merit of commonly used stockyard management rules.

关键词： Scheduling Blending Cargo assembly Stockyard management Space-time diagram tree search algorithm

来源：评论

学校读者我要写书评

暂无评论

2 algorithmS FOR GENERATING AND RANKING THE FAMILY OF SOLUTIONS OF A FINITE IRREFLEXIVE RELATION

引用

MATHEMATICAL SOCIAL SCIENCES 1983年第1期6卷 75-86页

作者： LOUKAKIS, E Department of Mechanical Engineering School of Engineering University of Thessalonkia Thessalonika Greece

The family of solutions, also known as 1-bases or kernels, of a finite irreflexive relation has a variety of many interesting applications. Furthermore, the decision as towhether the associated digraph posesses a solution belongs to the class of computationally intractable problems known as NP-complete. In this paper we present (a) a tree search algorithm to generate the family of solutions of a digraph and (b) a dynamic programming algorithm to generate the family of solutions ranked in increasing order of their cardinality. Extensive computational experience with the tree search algorithm on more than 1000 randomly generated digraphs ranging from 50 to 150 vertices and from 15% to 60% densities has shown that the proposed algorithm is effective.

关键词： Solutions 1-bases digraph finite irreflexive relation NP-complete tree search algorithm dynamic programming algorithm

来源：评论

学校读者我要写书评

暂无评论

Sub-optimum fast Bayesian techniques for joint leak detection and localisation

引用

IET WIRELESS SENSOR SYSTEMS 2013年第3期3卷 239-246页

作者： Roufarshbaf, Hossein Castro, Joel Schwaner, Fred Abedi, Ali Univ Maine Dept Elect & Comp Engn Orono ME 04469 USA

A fast tree-search algorithm for joint leak detection and localisation using surface-borne ultrasonic acoustic signals is developed through a wireless sensor network. Owing to environmental noise and multipath fading of ultrasonic signals, false sensor observations are frequent in the observation data. The problem is modelled as a Bayesian inference model and the maximum a posteriori solution is approximated through a tree-search structure. The algorithm initially divides the area into large cells and approximates the observation likelihood function over these large cells. In a tree structure, a large cell with high likelihood is divided into smaller cells and the tree is expanded until the required estimation precision is obtained. Simulation and experimental results reveal advantages of the proposed technique in terms of estimation error and convergence speed in comparison with other conventional Bayesian techniques such as particle filtering.

关键词： joint leak localisation suboptimum fast Bayesian techniques Optimisation techniques false sensor observations joint leak detection particle filtering search problems Bayesian inference model Wireless sensor networks Bayesian techniques tree search algorithm tree structure multipath fading particle filtering (numerical methods) wireless sensor network Filtering methods in signal processing Bayes methods approximation theory environmental noise ultrasonic signals surface borne ultrasonic acoustic signals wireless sensor networks observation data tree-search structure Interpolation and function approximation (numerical analysis) acoustic signal processing Other topics in statistics

来源：评论

学校读者我要写书评

暂无评论

Column generation approach for disassembly line balancing

引用

IFAC-PapersOnLine 2016年第12期49卷 916-920页

作者： Duta, L. Caciula, I. Patic, P.C. Valahia University of Targoviste Electrical Engineering Faculty Romania

Disassembly line balancing is a multi-objective problem which was found out to be NP-complete. Its exponential time complexity limits its application to small size instances. To overcome this problem, a heuristic methodology composed of two-stages is proposed. In the first phase, a mixed integer linear model is formulated so as to integrate the disassembly task allocation constraints. In the second phase, a tree search algorithm is applied to find the optimal schedule that balances the disassembly line. Column generation benchmark results show a good performance of the algorithm for large size instances. © 2016

关键词： Linear programming Benchmarking Heuristic methods Integer programming Learning algorithms trees (mathematics) Column generation Column generation approach Disassembly line balancing Exponential time complexity Mixed integer linear Mixed integer programming Multi objective problem tree search algorithm

来源：评论

学校读者我要写书评

暂无评论

BRANCH AND BOUND algorithm FOR COMPUTING K-NEAREST NEIGHBORS

引用

IEEE TRANSACTIONS ON COMPUTERS 1975年第7期C 24卷 750-753页

作者： FUKUNAGA, K NARENDRA, PM PURDUE UNIV SCH ELECT ENGNW LAFAYETTEIN 47907

Computation of the k-nearest neighbors generally requires a large number of expensive distance computations. The method of branch and bound is implemented in the present algorithm to facilitate rapid calculation of the k-nearest neighbors, by eliminating the necesssity of calculating many distances. Experimental results demonstrate the efficiency of the algorithm. Typically, an average of only 61 distance computations were made to find the nearest neighbor of a test sample among 1000 design samples.

关键词： Branch And Bound Distance Computation Hierarchical Decomposition K Nearest Neighbors tree search algorithm

来源：评论

学校读者我要写书评

暂无评论

A Path Planner for Autonomous Driving on Highways Using a Human Mimicry Approach with Binary Decision Diagrams

A Path Planner for Autonomous Driving on Highways Using a Hu...

引用

European Control Conference (ECC)

作者： Claussmann, Laurene Carvalho, Ashwin Schildbach, Georg Grenoble INP Dept Automat Control Syst & IT ENSE3 Grenoble France Univ Calif Berkeley Dept Mech Engn Berkeley CA 94720 USA

ISBN: (纸本)9783952426937

This paper considers the problem of path planning for autonomous ground vehicles on highways with regular traffic. The goal is to select a desired trajectory from a set of parameterized candidate trajectories such that some criterion is optimized. This selection is subject to avoiding collisions, respecting the traffic rules, and eliciting smooth behavior for passenger comfort. The desired trajectory is fed as a state reference to a path follower which uses Model Predictive Control (MPC) to compute the steering and braking actions. This work proposes a human mimicry approach for the path planning problem by considering a Binary Decision Diagram (BDD). The binary decision diagram applies a tree search algorithm coupled with a truth table decision process. Simulation and experimental results are presented to verify the real-time feasibility and demonstrate the effectiveness of the proposed algorithm.

关键词： binary decision diagrams collision avoidance mobile robots predictive control remotely operated vehicles road traffic control tree searching BDD MPC autonomous driving autonomous ground vehicles braking action highways human mimicry approach model predictive control parameterized candidate trajectories passenger comfort path follower path planner steering action traffic rules tree search algorithm truth table decision process Acceleration Planning Road transportation Trajectory Vehicle dynamics Vehicles

来源：评论

学校读者我要写书评

暂无评论

Parallel tree Traversals for Soft-Output MIMO Detection Using Multiple Bit Flippings 89

Parallel Tree Traversals for Soft-Output MIMO Detection Usin...

引用

89th IEEE Vehicular Technology Conference (VTC Spring)

作者： Liu, Tsung-Hsien Wu, Jia-You Chu, Yuan-Sun Natl Chung Cheng Univ Dept Commun Engn Chiayi Taiwan Natl Chung Cheng Univ Dept Elect Engn Chiayi Taiwan

ISBN: (纸本)9781728112176

The Layered Orthogonal Lattice Detector (LORD), developed by Siti, et al., is a famous soft-output detector for the MIMO system. It proposes to compute bit log-likelihood ratios (LLRs) in parallel for bits in each layer of the transmitted MIMO signals and therefore can achieve high throughput rate. However, one of its disadvantages is the high complexity for high-order modulated symbols. Combining the Schnorr-Euchner enumeration and bit flipping scheme, we propose to enumerate the lattices at the top layer in a new way. Our proposed detector can avoid the bit vacancy problem and is demonstrated to outperform the fixed-complexity soft-output detector. We also report the hardware implementation results for our proposed detector, showing that our detector is practically feasible.

关键词： Multiple input multiple output system soft-output detection tree search algorithm

来源：评论

学校读者我要写书评

暂无评论

Ghost direction detection and other innovations for Ms. Pac-Man

Ghost direction detection and other innovations for Ms. Pac-...

引用

2010 IEEE Conference on Computational Intelligence and Games, CIG2010

作者： Bell, Nathaniel Fang, Xinghong Hughes, Rory Kendall, Graham O'Reilly, Edward Qiu, Shenghui

ISBN: (纸本)9781424462971

Ms. Pac-Man was developed in the 1980s, becoming one of the most popular arcade games of its time. It still has a significant following today and has recently attracted the attention of artificial intelligence researchers, in part, due to the fact that the agent must react in real time in order to navigate its way through the maze. © 2010 IEEE.

关键词： 2010 IEEE Conference Dijkstra's algorithm ICE Pambush 3 Ms.Pac-Man competition arcade games artificial intelligence artificial intelligence computational games computational intelligence computer algorithm computer games game objects ghost direction detection human intervention knowledge based systems tree search algorithm world record

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：