We describe a new exact-arithmetic approach to linear programming when the number of variables n is much larger than the number of constraints m (or vice versa). The algorithm is ...
Abstract— Traditional investigations with evolutionary programming (EP) for continuous parameter optimization problems have used a single mutation operator with a parameterized p...
Most of the obstacle avoidance techniques do not consider the robot orientation or its nal angle at the target position. These techniques deal with the robot position only and are ...
The success of a genetic programming system in solving a problem is often a function of the available computational resources. For many problems, the larger the population size an...
Abstract. A clustering method is presented which can be applied to semantically annotated resources in the context of ontological knowledge bases. This method can be used to discov...