The improved TCAR by adding small search spaces

Author(s):  
Zeng Qinghua ◽  
Liu Jianye ◽  
Yang Di ◽  
Wan Junwei
Keyword(s):  
Engevista ◽  
2014 ◽  
Vol 17 (2) ◽  
pp. 152
Author(s):  
Radael De Souza Parolin ◽  
Pedro Paulo Gomes Watts Rodrigues ◽  
Antônio J. Silva Neto

The quality of a given water body can be assessed through the analysis of a number of indicators. Mathematical and computational models can be built to simulate the behavior of these indicators (observable variables), in such a way that different scenarios can be generated, supporting decisions regarding water resources management. In this study, the transport of a conservative contaminant in an estuarine environment is simulated in order to identify the position and intensity of the contaminant source. For this, it was formulated an inverse problem, which was solved through computational intelligence methods. This approach required adaptations to these methods, which had to be modified to relate the source position to the discrete mesh points of the domain. In this context, two adaptive techniques were developed. In one, the estimated points are projected to the grid points, and in the other, points are randomly selected in the iterative search spaces of the methods. The results showed that the methodology here developed has a strong potential in water bodies’ management and simulation.


Author(s):  
Mark Wilson

Scientists have developed various collections of specialized possibilities to serve as search spaces in which excessive reliance upon speculative forms of lower dimensional modeling or other unwanted details can be skirted. Two primary examples are discussed: the search spaces of machine design and the virtual variations utilized within Lagrangian mechanics. Contemporary appeals to “possible worlds” attempt to imbed these localized possibilities within fully enunciated universes. But not all possibilities are made alike and these reductive schemes should be resisted, on the grounds that they render the utilities of everyday counterfactuals and “possibility” talk incomprehensible. The essay also discusses whether Wittgenstein’s altered views in his Philosophical Investigations reflect similar concerns.


2015 ◽  
Vol 44 (5) ◽  
pp. 1172-1239 ◽  
Author(s):  
Andrew Currin ◽  
Neil Swainston ◽  
Philip J. Day ◽  
Douglas B. Kell

Improving enzymes by directed evolution requires the navigation of very large search spaces; we survey how to do this intelligently.


Mathematics ◽  
2021 ◽  
Vol 9 (23) ◽  
pp. 3011
Author(s):  
Drishti Yadav

This paper introduces a novel population-based bio-inspired meta-heuristic optimization algorithm, called Blood Coagulation Algorithm (BCA). BCA derives inspiration from the process of blood coagulation in the human body. The underlying concepts and ideas behind the proposed algorithm are the cooperative behavior of thrombocytes and their intelligent strategy of clot formation. These behaviors are modeled and utilized to underscore intensification and diversification in a given search space. A comparison with various state-of-the-art meta-heuristic algorithms over a test suite of 23 renowned benchmark functions reflects the efficiency of BCA. An extensive investigation is conducted to analyze the performance, convergence behavior and computational complexity of BCA. The comparative study and statistical test analysis demonstrate that BCA offers very competitive and statistically significant results compared to other eminent meta-heuristic algorithms. Experimental results also show the consistent performance of BCA in high dimensional search spaces. Furthermore, we demonstrate the applicability of BCA on real-world applications by solving several real-life engineering problems.


2013 ◽  
Vol 10 (4) ◽  
pp. 1823-1854 ◽  
Author(s):  
Jörg Bremer ◽  
Michael Sonnenschein

The current upheaval in the electricity sector demands distributed generation schemes that take into account individually configured energy units and new grid structures. At the same time, this change is heading for a paradigm shift in controlling these energy resources within the grid. Pro-active scheduling of active power within a (from a controlling perspective) loosely coupled group of distributed energy resources demands for distributed planning and optimization methods that take into account the individual feasible region in local search spaces modeled by surrogate models. We propose a method that uses support vector based black-box models for re-constructing feasible regions for automated, local solution repair during scheduling and combine it with a distributed greedy approach for finding an appropriate partition of a desired target schedule into operable schedules for each participating energy unit.


Author(s):  
Bingqian Lu ◽  
Jianyi Yang ◽  
Weiwen Jiang ◽  
Yiyu Shi ◽  
Shaolei Ren

Convolutional neural networks (CNNs) are used in numerous real-world applications such as vision-based autonomous driving and video content analysis. To run CNN inference on various target devices, hardware-aware neural architecture search (NAS) is crucial. A key requirement of efficient hardware-aware NAS is the fast evaluation of inference latencies in order to rank different architectures. While building a latency predictor for each target device has been commonly used in state of the art, this is a very time-consuming process, lacking scalability in the presence of extremely diverse devices. In this work, we address the scalability challenge by exploiting latency monotonicity --- the architecture latency rankings on different devices are often correlated. When strong latency monotonicity exists, we can re-use architectures searched for one proxy device on new target devices, without losing optimality. In the absence of strong latency monotonicity, we propose an efficient proxy adaptation technique to significantly boost the latency monotonicity. Finally, we validate our approach and conduct experiments with devices of different platforms on multiple mainstream search spaces, including MobileNet-V2, MobileNet-V3, NAS-Bench-201, ProxylessNAS and FBNet. Our results highlight that, by using just one proxy device, we can find almost the same Pareto-optimal architectures as the existing per-device NAS, while avoiding the prohibitive cost of building a latency predictor for each device.


Sign in / Sign up

Export Citation Format

Share Document