1686 search results - page 98 / 338 » Programs as polygraphs: computability and complexity |
GECCO
2007
Springer
15 years 4 months ago
2007
Springer
Genetic Programming (GP) is an automated computational programming methodology, inspired by the workings of natural evolution techniques. It has been applied to solve complex prob...
IPPS
1999
IEEE
15 years 2 months ago
1999
IEEE
In order for parallel logic programming systems to become popular, they should serve the broadest range of applications. To achieve this goal, designers of parallel logic programm...
ZUM
2000
Springer
15 years 1 months ago
2000
Springer
Abstract. The notion of agents has provided a way of imbuing traditional computing systems with an extra degree of flexibility that allows them to be more resilient and robust in t...
ICRA
2005
IEEE
15 years 3 months ago
2005
IEEE
— This paper is concerned with the problem of identifying robust equilibrium postures of a planar mechanism supported by fixed frictional contacts in a twodimensional gravitation...
108
click to vote
LPNMR
1997
Springer
15 years 1 months ago
1997
Springer
Turi [20] introduced the important notion of a constrained atom: an atom with associated equality and disequality constraints on its arguments. A set of constrained atoms is a cons...