Abstract. In this paper we present the set of base algorithms for generating connected random graphs (RG). RG can be used for testing different algorithms on networks. The fast al...
: Noncanonical semantic representations are representations which cannot be derived by some grammar G although they are semanticMly equivalent to representations which can be deriv...
With increasing complexity of modern embedded systems, the availability of highly optimizing compilers becomes more and more important. At the same time, application specific inst...
1 In multi-agent systems (MAS), coalition formation is typically studied using characteristic function game (CFG) representations, where the performance of any coalition is indepen...
Tomasz P. Michalak, Andrew Dowell, Peter McBurney,...
Hypermedia structured in terms of the higher-level intent of its author can be adapted to a wider variety of final presentations. Many multimedia systems encode such highlevel int...
Lloyd Rutledge, Brian Bailey, Jacco van Ossenbrugg...