988 search results - page 146 / 198 » Pseudo-Genetic Algorithmic Composition |
124
click to vote
ICGI
1998
Springer
15 years 4 months ago
1998
Springer
In this paper, we propose a new framework for the computational learning of formal grammars with positive data. In this model, both syntactic and semantic information are taken int...
130
Voted
DEXAW
1998
IEEE
15 years 4 months ago
1998
IEEE
The integration of active database technology into mobile database systems allows to limit the transfer of data between mobile computers and the stationary network. In order to em...
92
Voted
BPM
2008
Springer
15 years 2 months ago
2008
Springer
We present a finite representation of all services M where the composition with a given service N is deadlock-free, and a given set of activities of N can be covered (i.e. is not d...
93
Voted
FOSSACS
2008
Springer
15 years 2 months ago
2008
Springer
Abstract. We present a novel coalgebraic logic for deterministic Mealy machines that is sound, complete and expressive w.r.t. bisimulation. Every finite Mealy machine corresponds t...
134
Voted
WSC
1997
15 years 2 months ago
1997
In this paper we compare the average performance of Monte Carlo methods for global optimization with non-adaptive deterministic alternatives. We analyze the behavior of the algori...