A computable graph is computably categorical if any two computable presentations of the graph are computably isomorphic. In this paper we investigate the class of computably catego...
Barbara F. Csima, Bakhadyr Khoussainov, Jiamou Liu
Since the inception of genetic algorithmics the identification of computational efficiencies of the simple genetic algorithm (SGA) has been an important goal. In this paper we dist...
d abstract) John Longley Laboratory for Foundations of Computer Science School of Informatics, University of Edinburgh The King's Buildings, Mayfield Road Edinburgh EH9 3JZ, U...
An SOA-compliant DEVS (SOAD) simulation framework is proposed for modeling service-oriented computing systems. A set of novel abstract component models that conform to the SOA pri...
Hessam S. Sarjoughian, Sungung Kim, Muthukumar Ram...
In this paper, we present a domain-specific Interface Definition Language (IDL) and its compiler, dedicated to the development of pervasive computing applications. Our IDL provide...
Wilfried Jouve, Julien Lancia, Nicolas Palix, Char...