The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
Traditional differential evolution (DE) algorithm has a tendency to suffer from premature convergence. In this paper, we proposed an improved DE based on dynamic mutation operator and opposition learning strategy. These mechanisms can expand the search area and is helpful to balance exploration and exploitation of DE. Numerical experiments demonstrate that our algorithm is effective.
To balance the explore and exploit, we combine two algorithms, Central Force Optimization (CFO) and Gravitational Search Algorithm (GSA), and propose a multi-subgroup hierarchical hybrid of CFO and GSA (HCFO-GSA). This hybrid algorithm has a hierarchical structure: base level is a series of subgroups of CFO, and the top level comprises all elite individuals with entire subgroups. The performances...
A novel method of locating all local minima of a function is presented here. Among many methods that exist in global optimization literature, Multi-start and Min-finder are effective methods because of their ability to locate not only the global minimum but also all local minima of the objective function. Both of these methods have the disadvantage of high computational cost. To remedy this, we propose...
We benchmark planar MOSFETs, FinFETs, and nanowires in a wide range of design rules, spanning from 90nm down to 2nm. This benchmarking evaluates inverter switching speed for a load of 70 metal pitches long interconnect wire and a fan-out of one. Planar MOSFET logic slows down sharply at 14nm design rules, mainly due to short-channel effects reducing the driving strength at a fixed off-state leakage...
To reduce the route length of MSW collection without intermediate facilities, A Waste Collection Vehicle Arc Routing Problem with turn constraints (WCVARPTC) model was proposed, which considers the actual traffic regulations: some streets can be traversed in only one direction, some turns will be forbidden when the common angle is too narrow. An asymmetric vehicle node routing problem (AVNRP) model...
The high cost of locating faults in programs has motivated the development of techniques that assist in fault localization by automating part of the process of searching for faults. A method to automatically locate faulty code using failure-causing input combination in combinatorial testing is firstly presented in this paper. Firstly, four types of fault locations are figured out by using parameters...
Software vulnerabilities become methods by which an attacker can take control of the victim's system, and those critical bugs cluster in dangerous spot codes. However, fuzz testing provides low code coverage and serious security bugs may be missed potentially, while symbolic execution based testing encounters path explosion and bug trigger problem. To deal with the security issue above, we highlight...
The Embarrassingly Parallel (EP) is one kernel benchmark of NAS Parallel Benchmarks (NPB). EP generates pairs of Gaussian Random Deviates (GRDs) of large random numbers which produced by Linear Congruential Generator (LCG). In this paper, the Hybrid EP is efficient implemented on CPU/GPU heterogeneous platform. Experimental results show that the Hybrid EP is 11.98 times faster than equivalent multicore...
The collection vehicle routing problems with intermediate facilities (CVRP-IF) is actually belong to a well-known generalization of VRP, the Multi-Depot Vehicle Routing Problem with Inter-Depot Routes (MDVRPI), which is a combinatorial optimization problem and holds a central place in reverse logistics management, such as waste collection management. This paper presents an improved multiple ant colony...
The Embarrassingly Parallel (EP) is one kernel benchmark of NAS Parallel Benchmarks (NPB) which are a set of programs designed to help evaluate the performance of parallel supercomputers. In the EP benchmark, two-dimensional statistics are accumulated from a large number of Gaussian pseudo-random numbers, which produced by Linear Congruential Generator (LCG). In this paper, we present the design and...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.