42 search results - page 7 / 9 » Genetic programming for finite algebras |
IJCAI
1993
14 years 11 months ago
1993
objects, like elements of (abstract) data types in ordinary programming languages In the theory of abstract data types most often one only considers algebraic structures where all ...
GECCO
2007
Springer
15 years 3 months ago
2007
Springer
The problem of production and delivery lot-sizing and scheduling of set of items in a two-echelon supply chain over a finite planning horizon is addressed in this paper. A single ...
167
click to vote
EH
1999
IEEE
1999
IEEE
Evolvable Hardware or Learning Hardware? Induction of State Machines from Temporal Logic Constraints
15 years 1 months ago
Here we advocate an approach to learning hardware based on induction of finite state machines from temporal logic constraints. The method involves training on examples, constraint...
FTDCS
1999
IEEE
15 years 1 months ago
1999
IEEE
We describe an environment for distributed computing that uses the concept of well-known paradigms. The main advantage of paradigmoriented distributed computing (PODC) is that the...
ICFP
2005
ACM
15 years 9 months ago
2005
ACM
We generalise Fiore et al's account of variable binding for untyped cartesian contexts and Tanaka's account of variable binding for untyped linear contexts to give an ac...