This paper describes an automated approach to hardware design space exploration, through a collaboration between parallelizing compiler technology and high-level synthesis tools. In previous work, we described a compiler algorithm that optimizes individual loop nests, expressed in C, to derive an efficient FPGA implementation. In this paper, we describe a global optimization strategy that maps ...

This paper proposes a new real-value mutation operator and a hybrid real-coded genetic algorithm with quasi-simplex technique using this new mutation operator (RCGAQS). Compared with the classical GA (CGA), RCGAQS has the following distinguish features: (1) A new real-value mutation mechanism was used to increase the capability of global search (exploration); (2) The modified simplex technique,...

Social Spider Optimization (SSO) algorithm is a swarm intelligence optimization algorithm based on the mating behavior of social spiders. Numerical simulation results have shown that SSO outperformed some classical swarm intelligence algorithms such as Particle Swarm Optimization (PSO) algorithm and Artificial Bee Colony (ABC) algorithm and so on. However, there are still some deficiencies abou...

Human touch is an inherently active sense: to estimate an object's shape humans often move their hand across its surface. This way the object is sampled both in a serial (sampling different parts of the object across time) and parallel fashion (sampling using different parts of the hand simultaneously). Both the serial (moving a single finger) and parallel (static contact with the entire hand) ...

Self-exploration capability is an important and necessary factor in all social communities where individual assumes to have their own intelligence. Macro social influencing factors are responsible for decision nature taken by an individual, whereas self-exploration process can be considered as a refinement of that decision by use of the cognitive capability to explore a number of surrounding po...

This paper discusses the reason why QEA works and verifies how QEA works. The theoretical analysis of the simplified model of the segment process of QEA shows that QEA with a single individual for ONEMAX problem guarantees the global solution in terms of expected running number of generations. The analysis for exploration shows clearly that QEA starts with a global search scheme and changes aut...

The standard artificial bee colony (ABC) algorithm involves exploration and exploitation processes which need to be balanced for enhanced performance. This paper proposes a new modified ABC algorithm named JA-ABC5 to enhance convergence speed and improve the ability to reach the global optimum by balancing exploration and exploitation processes. New stages have been proposed at the earlier stag...

The n-dimensional direct search algorithm DIRECT of Jones, Perttunen, and Stuckman has attracted recent attention from the multidisciplinary design optimization community. Since DIRECT only requires function values (or ranking) and balances global exploration with local refinement better than n-dimensional bisection, it is well suited to the noisy function values typical of realistic simulation...

In the early stages of the design process of aerospace vehicles, the search for optimal configurations encompasses a broad range of possibilities, and the use of local optimization tools may risk missing the best designs. Therefore, global optimization methods are attractive for the early design stage. Unfortunately, global design optimization usually requires the evaluation of a very large num...

We examine the generic local and global rigidity of various graphs in R. We analyze two classes of graphs that satisfy Hendrickson’s conditions for generic global rigidity, yet fail to be generically globally rigid. We find a large family of bipartite graphs with d > 3, and we use a method that generates infinitely many graphs in R. Finally, we state some conjectures for further exploration.