2905 search results - page 299 / 581 » Formal Memetic Algorithms |
HLPPP
1991
15 years 2 months ago
1991
Gamma was originally proposed in 1986 as a formalism for the de nition of programs without arti cial sequentiality. The basic idea underlying the formalism is to describe computati...
103
click to vote
ECMDAFA
2010
Springer
15 years 2 months ago
2010
Springer
Dynamic UML models like sequence diagrams (SD) lack sufficient formal semantics, making it difficult to build automated tools for their analysis, simulation and validation. A commo...
ATAL
2006
Springer
15 years 1 months ago
2006
Springer
Goals are an important concept in intelligent agent systems, and can take a variety of forms. One such form is maintenance goals, which, unlike achievement goals, define states th...
AIML
2008
15 years 18 days ago
2008
In 1983, Valentini presented a syntactic proof of cut-elimination for a sequent calculus GLSV for the provability logic GL where we have added the subscript V for "Valentini&q...
100
click to vote
EJC
2008
15 years 18 days ago
2008
The notion of a fragment was coined by Montague 1974 to illustrate the formal handling of certain puzzles, such as de dicto/de re, in a truth-conditional semantics for natural lan...