In the field of automatic programming (AP), the solution of a problem is a program, which is usually represented by an AP-tree. A tree is built using functional and terminal nodes. For solving AP problems, we propose ...
详细信息
In the field of automatic programming (AP), the solution of a problem is a program, which is usually represented by an AP-tree. A tree is built using functional and terminal nodes. For solving AP problems, we propose a new neighborhood structure that adapts the classical "elementary tree transformation" (ETT) into this specific AP-tree. The ETT is the process of removing an edge and adding another one to obtain a new feasible tree. Experimental comparison with reduced VNP, i.e., with VNP without local search, genetic programming, and artificial bee colony programming shows clearly advantages of the new proposed BVNP method, in terms of speed of convergence and computational stability.
State-based interactive applications, whether they run on the desktop or as a web application, can be considered as collections of interconnected editors of structured values that allow users to manipulate data. This ...
详细信息
State-based interactive applications, whether they run on the desktop or as a web application, can be considered as collections of interconnected editors of structured values that allow users to manipulate data. This is the view that is advocated by the GEC and iData toolkits, which offer a high level of abstraction to programming desktop and web GUI applications respectively. Special features of these toolkits are that editors have shared, persistent state, and that they handle events individually. In this paper we cast these toolkits within the Arrow framework and present EditorArrow: a single, unified semantic model that defines shared state and event handling. We study the properties of EditorArrow, and of editors in particular. Furthermore, we present the definedness properties of the combinators. A reference implementation of the EditorArrow model is given with some small program examples. We discuss formal reasoning about the model using the proof assistant Sparkle. The availability of this tool has proved to be indispensable in this endeavor.
This paper will show how a second generation industrial robot programmed with a standard set of primitive instructions can be used for advanced robotic telemanipulation under operator control. It will be shown how eas...
详细信息
This paper will show how a second generation industrial robot programmed with a standard set of primitive instructions can be used for advanced robotic telemanipulation under operator control. It will be shown how easy it is to implement reflex actions such as grasping or displacing objects with such a system which bridges the gap between manipulators and industrial robots.
Ant Colony programming is a relatively new paradigm based on Genetic programming and Ant Colony System. We discuss the problem of eliminating introns in Ant Colony programming. The approach is tested on several approx...
详细信息
Ant Colony programming is a relatively new paradigm based on Genetic programming and Ant Colony System. We discuss the problem of eliminating introns in Ant Colony programming. The approach is tested on several approximation problems. The test results demonstrate that the proposed method simplifies significantly the achieved solutions and shortens their evaluation time.
Application of evolutionary computation techniques is relatively novel for machine learning. Motivated by different types of evolutionary computation techniques, different types of automatic programming were proposed....
详细信息
Application of evolutionary computation techniques is relatively novel for machine learning. Motivated by different types of evolutionary computation techniques, different types of automatic programming were proposed. Biogeography-Based Optimization (BBO) is a new evolutionary algorithm that is inspired by the science of biogeography and has been shown to be competitive to other population-based algorithms. Inspired by biogeography theory and previous results, in this paper Biogeography-Based programming (BBP) is proposed as a new type of automatic programming for creating polynomial regression models. In order to show the effectiveness of the proposed BBP, a number of experiments were carried out on a suite set of benchmark functions and the results were also compared with several existing automatic programming algorithms. Furthermore, sensitivity analysis was performed for the parameter settings of the proposed BBP. The results indicate that the proposed model is promising in terms of success rate and accuracy and it performs better than other algorithms investigated in this consideration. (C) 2015 Elsevier Inc. All rights reserved.
The automated problem-solving technique of genetic programming has generated at least 36 human-competitive results. In six cases, it automatically duplicated the functionality of inventions patented after January 2000.
The automated problem-solving technique of genetic programming has generated at least 36 human-competitive results. In six cases, it automatically duplicated the functionality of inventions patented after January 2000.
To overcome the difficulties of programming robots, the authors are seeking automatic programming methods, using various forms of computer-based reasoning. This overview outlines their algorithm and software-related r...
详细信息
To overcome the difficulties of programming robots, the authors are seeking automatic programming methods, using various forms of computer-based reasoning. This overview outlines their algorithm and software-related research and development for automated mechanical assembly. Five major areas of ongoing research are briefly described: compliant motion; motion planning; machine interpretation of solid models; automatic planning of assembly sequences; and automatic programming of robotic systems.< >
Designed for program development in an interactive environment, this framework can help create a new generation of programmers with an invaluable disciplined approach to software development.
Designed for program development in an interactive environment, this framework can help create a new generation of programmers with an invaluable disciplined approach to software development.
SequenceL is a new computer language that provides declarative constructs for nonscalar processing. In SequenceL, a problem solver provides little in the way of iterative/recursive details in a problem solution. Inste...
详细信息
SequenceL is a new computer language that provides declarative constructs for nonscalar processing. In SequenceL, a problem solver provides little in the way of iterative/recursive details in a problem solution. Instead, the problem solver describes the solution directly by specifying, via a metastructure, the data structures which will hold results useful in solving the problem. SequenceL is a small language (i.e., there are a small number of language constructs), and it is not domain dependent. This paper serves as a comprehensive introduction to SequenceL, which includes new results and language features. (C) 1998 Elsevier Science Ltd. All rights reserved.
暂无评论