This extended abstract summarizes two contributions from ongoing work on parallel search in theorem proving. First, we give a framework of deenitions for parallel theorem proving, including inference system, communication operators, parallel search plan, subdivision function, parallel strategy, parallel derivation, fairness and propagation of redundancy for parallel derivations. A notion of a p...

The optimization of parallel kinematic manipulators (PKM) involve several constraints that are difficult to formalize, thus making optimal synthesis problem highly challenging. presence passive joint limits as well the singularities and self-collisions lead a complicated relation between input output parameters. In this article, novel methodology is proposed by combining local search, Nelder–Me...

Recent advances in communication and storage technology make available vast quantities of on line information But this information is of limited use unless it can be searched e ectively Huge scale and heterogeneity of data raise a unique combination of architectural issues that must be addressed to support e ective search These issues occasion the use of multi user distributed search databases ...

dimensional synthesis of a parallel robot may be the initial stage of its design process, which is usually carried out based on a required workspace. since optimization of the links lengths of the robot for the workspace is usually done, the workspace computation process must be run numerous times. hence, importance of the efficiency of the algorithm and the cpu time of the workspace computatio...

A novel parallel hybrid particle swarm optimization algorithm named hmPSO is presented. The new algorithm combines particle swarm optimization with a local search method which aims to accelerate the rate of convergence. The hybrid global optimization algorithm adjusts its searching space through the local search results. Parallelization is based on the client-server model, which is ideal for as...