26,177 Hits in 5.1 sec

Ship Pipe Routing Design Using NSGA-II and Coevolutionary Algorithm

Wentie Niu, Haiteng Sui, Yaxiao Niu, Kunhai Cai, Weiguo Gao
2016 Mathematical Problems in Engineering  
In this article, an optimized design method for branch pipe routing is proposed to improve design efficiency and to reduce human errors.  ...  Fuzzy set theory is employed to extract the best compromise pipeline from Pareto optimal solutions.  ...  Due to the huge piping layout space, global search for optimal pipeline will result in operation with large storage and low efficiency.  ... 
doi:10.1155/2016/7912863 fatcat:zq4lmm3fubgy3hqz72jnrcoinu

Optimization of Gas Transmission Pipeline using Ant Colony Optimization

Akshat Sharma, Aabhay Bhardwaj, Prakhar Tiwari, Nitya Chauhan, Nitin Arora
2020 International Journal of Computer Applications  
Optimizing the pipeline route plays an important role in making the transportation eco-friendly, efficient and safe.  ...  In this paper, Traveling Salesman Problem is being solved using Ant Colony Optimization Algorithm taking pressure and distances for the flow of gas from one point to another point.  ...  The main idea is that of having a set of agents, called ants (hypothetical), search in parallel for good solutions to the TSP and cooperate through pheromone mediated indirect and global communication  ... 
doi:10.5120/ijca2020919910 fatcat:evzjfr4wc5bsbgszvkg5w67dui

A Parallel Reconfigurable Architecture for Real-Time Stereo Vision

Lei Chen, Yunde Jia
2009 2009 International Conference on Embedded Software and Systems  
We use task partition methods to achieve the maximum parallel and full pipeline processing of the algorithm implementation.  ...  In this paper, a parallel reconfigurable architecture is proposed for real-time stereo vision computation.  ...  ASIC is designed and optimized for specific algorithms and operations, so systems using ASICs can achieve superior performance for a limited set of applications.  ... 
doi:10.1109/icess.2009.18 dblp:conf/icess/ChenJ09 fatcat:3iyderhilvgtbphf5ogs3a26pe

Auto-Panoptic: Cooperative Multi-Component Architecture Search for Panoptic Segmentation [article]

Yangxin Wu, Gengwei Zhang, Hang Xu, Xiaodan Liang, Liang Lin
2020 arXiv   pre-print
In this work, we propose an efficient, cooperative and highly automated framework to simultaneously search for all main components including backbone, segmentation branches, and feature fusion module in  ...  a unified panoptic segmentation pipeline based on the prevailing one-shot Network Architecture Search (NAS) paradigm.  ...  Broader Impacts This work makes the first attempt to search for all key components of panoptic pipeline and manages to accomplish this via the proposed Cooperative Multi-Component Architecture Search and  ... 
arXiv:2010.16119v1 fatcat:qgint7zrbrh4dbgnt5h3rlzbsm

Techniques for Automated Machine Learning [article]

Yi-Wei Chen, Qingquan Song, Xia Hu
2019 arXiv   pre-print
Automated machine learning (AutoML) aims to find optimal machine learning solutions automatically given a machine learning problem.  ...  State-of-the-art techniques adopted in the three categories are presented, including Bayesian optimization, reinforcement learning, evolutionary algorithm, and gradient-based approaches.  ...  For those sub-optimal pipelines during a search, we can also build a weighted ensemble of them [ ] to get robust performance.  ... 
arXiv:1907.08908v1 fatcat:rvcjngo7fngafjnik6spdnr3aa

Towards hybrid evolutionary algorithms

P. Preux, E.-G. Talbi
1999 International Transactions in Operational Research  
This paper briefly reviews the current knowledge we have on search spaces of combinatorial optimization problems.  ...  Metaheuristics have received considerable interest these recent years in the field of combinatorial optimization.  ...  A GA is cooperating with a parallel tabu search algorithm.  ... 
doi:10.1111/j.1475-3995.1999.tb00173.x fatcat:axqcpomtujcx5fd23rsnwqo54m

Towards hybrid evolutionary algorithms

P Preux
1999 International Transactions in Operational Research  
This paper briefly reviews the current knowledge we have on search spaces of combinatorial optimization problems.  ...  Metaheuristics have received considerable interest these recent years in the field of combinatorial optimization.  ...  A GA is cooperating with a parallel tabu search algorithm.  ... 
doi:10.1016/s0969-6016(99)00019-2 fatcat:cr525zd6hvgg3gfe55642t5jsi

A two-stage optimization method for unmanned aerial vehicle inspection of an oil and gas pipeline network

Yamin Yan, Yongtu Liang, Haoran Zhang, Wan Zhang, Huixia Feng, Bohong Wang, Qi Liao
2019 Petroleum Science  
However, the integrated optimization of unmanned aerial vehicle inspection for oil and gas pipeline networks, including physical feasibility, the performance of mission, cooperation, real-time implementation  ...  Finally, a virtual pipeline network and a practical pipeline network are set as two examples to demonstrate the performance of the optimization schemes.  ...  Acknowledgements This work was part of the Program of "Study on Optimization and Supply-side Reliability of Oil Product Supply Chain Logistics System" funded under the National Natural Science Foundation  ... 
doi:10.1007/s12182-019-0305-y fatcat:fvbj6tlidjeple2k3nqosg3rla

DIDO: Dynamic Pipelines for In-Memory Key-Value Stores on Coupled CPU-GPU Architectures

Kai Zhang, Jiayu Hu, Bingsheng He, Bei Hua
2017 2017 IEEE 33rd International Conference on Data Engineering (ICDE)  
We develop a cost model guided adaption mechanism to determine the optimal pipeline configuration.  ...  This special property opens up new opportunities for building in-memory keyvalue store systems, as it eliminates the data transfer costs on PCI-e bus, and enables fine-grained cooperation between the CPU  ...  For instance, DIDO uses the following pipelines for workloads with small key-value size For 100% GET workloads, however, as all the index operations are Search operations, only dynamic pipeline partitioning  ... 
doi:10.1109/icde.2017.120 dblp:conf/icde/ZhangHHH17 fatcat:txh5rqnhgnc53hfcbtgkoifkty

A Review: Machine Learning for Combinatorial Optimization Problems in Energy Areas

Xinyi Yang, Ziyi Wang, Hengxi Zhang, Nan Ma, Ning Yang, Hualin Liu, Haifeng Zhang, Lei Yang
2022 Algorithms  
Combinatorial optimization problems (COPs) are a class of NP-hard problems with great practical significance.  ...  Traditional approaches for COPs suffer from high computational time and reliance on expert knowledge, and machine learning (ML) methods, as powerful tools have been used to overcome these problems.  ...  The authors built a model of a bargaining, cooperative game for this management problem and found the Nash equilibrium to ensure optimal operations. Peng et al.  ... 
doi:10.3390/a15060205 fatcat:tea63hytzrau7jitrwwapl3bfi

Scalable analysis of Big pathology image data cohorts using efficient methods and high-performance computing strategies

Tahsin Kurc, Xin Qi, Daihou Wang, Fusheng Wang, George Teodoro, Lee Cooper, Michael Nalisnik, Lin Yang, Joel Saltz, David J. Foran
2015 BMC Bioinformatics  
We describe a suite of tools and methods that form a core set of capabilities for researchers and clinical investigators to evaluate multiple analytical pipelines and quantify sensitivity and variability  ...  Results: The proposed tools and methods take advantage of state-of-the-art parallel machines and efficient content-based image searching strategies.  ...  TG-ASC130023, the Keeneland Computing Facility at the Georgia Institute of Technology, supported by the NSF under Contract OCI-0910735, and the Nautilus system at the University of Tennessee's Center for  ... 
doi:10.1186/s12859-015-0831-6 pmid:26627175 pmcid:PMC4667532 fatcat:lnnhszkk4vhi7d3yoi74t37e2m

Fast Optimal Replica Placement with Exhaustive Search Using Dynamically Reconfigurable Processor

Hidetoshi Takeshita, Sho Shimizu, Hiroyuki Ishikawa, Akifumi Watanabe, Yutaka Arakawa, Naoaki Yamanaka, Kosuke Shiba
2011 Journal of Computer Networks and Communications  
It is impractical to use exhaustive search to obtain optimal replica placement in large-scale networks, because calculation time increases with the number of combinations.  ...  It combines a new type of parallel data-flow processor with an architecture tuned for fast calculation.  ...  This work is also supported in part by a Grant-in-Aid for the Global Center of Excellence for high-Level Global Cooperation for Leading-Edge Platform on Access Spaces from the Ministry of Education, Culture  ... 
doi:10.1155/2011/707592 fatcat:y47ylofwsnelteyqz57e6xvcpm


S. Parimucha, D. Baludansky, M. Vadila
2007 Odessa Astronomical Publications  
It is a system for a large scale automatic multicolor monitoring and variable stars searching. It is in a development at Safarik University in Kosice in cooperation with Roztoky Observatory .  ...  We give description of the basic properties of the instrument, data reduction pipeline and operational modes of the instrument.  ...  The focal plane is optimized for the field with classical dimension of 24 × 36 mm. It gives us a possibility to use a CCD camera with larger chip in the future.  ... 
doi:10.18524/1810-4215.2007.20.87173 doaj:5918e14949554b84a36be166e10e9a4c fatcat:qcainnyc6vg63px5kudcdfhnt4

Hybridizing exact methods and metaheuristics: A taxonomy

L. Jourdan, M. Basseur, E.-G. Talbi
2009 European Journal of Operational Research  
The interest about hybrid optimization methods has grown for the last few years. Indeed, more and more papers about cooperation between heuristics and exact techniques are published.  ...  First, we propose some natural approaches for the different schemes of cooperation encountered, and we analyse, for each model, some examples taken from the literature.  ...  The exact search could replace a genetic operator, like in memetic searches.  ... 
doi:10.1016/j.ejor.2007.07.035 fatcat:uq3aphcfqbgujf5idpcdqxd66i

A K-Means-Based Multi-Prototype High-Speed Learning System with FPGA-Implemented Coprocessor for 1-NN Searching

Fengwei AN, Tetsushi KOIDE, Hans J^|^uuml;rgen MATTAUSCH
2012 IEICE transactions on information and systems  
This deficiency is resolved by an FPGA-implemented coprocessor that is a VLSI circuit for searching the nearest Euclidean distance.  ...  The one nearest neighbor (1-NN) classifier is used to recognize an object by searching for the nearest Euclidean distance among the prototypes.  ...  The hardware architecture of the FPGA-implemented coprocessor for 1-NN searching is described in Sect. 3. Section 4 explains how the softwarehardware cooperation is working.  ... 
doi:10.1587/transinf.e95.d.2327 fatcat:ghqbjksc6zfihfy3npc54ag2wa
« Previous Showing results 1 — 15 out of 26,177 results