Search results for "complexity measures"
showing 2 items of 2 documents
Timed Sets, Functional Complexity, and Computability
2012
AbstractThe construction of various categories of “timed sets” is described in which the timing of maps is considered modulo a “complexity order”. The properties of these categories are developed: under appropriate conditions they form discrete, distributive restriction categories with an iteration. They provide a categorical basis for modeling functional complexity classes and allow the development of computability within these settings. Indeed, by considering “program objects” and the functions they compute, one can obtain models of computability – i.e. Turing categories – in which the total maps belong to specific complexity classes. Two examples of this are introduced in some detail whi…
A metrics suite for evaluating agent-oriented architectures
2010
The Multi-agent Systems (MASs) paradigm continues to consolidate itself as a new branch of software engineering. Traditional software engineering strongly recommends to apply metrics in software developments. However, several research groups of experts in agent-oriented software engineering agree that classical software metrics and object-oriented metrics cannot directly measure the quality of MAS architectures. For this reason, this work proposes a suite of metrics to measure certain quality attributes of MAS architectures, considering agents and their organization. Most of these metrics are inspired by object-oriented metrics but they are adapted to agent-oriented concepts. Proposed metri…