This paper studies the computational complexity of the Edge Packing problem and the Vertex Packing problem. The edge packing problem (denoted by EDS ) and the vertex packing problem (denoted by DS ) are linear programming duals of the edge dominating set problem and the dominating set problem respectively. It is shown that these two problems are equivalent to the set packing problem with respec...

Let G = (V, E) be a graph and let S ⊆ V . The set S is a packing in G if the vertices of S are pairwise at distance at least three apart in G. The set S is a dominating set (DS) if every vertex in V − S is adjacent to a vertex in S. Further, if every vertex in V − S is also adjacent to a vertex in V − S, then S is a restrained dominating set (RDS). The domination number of G, denoted by γ(G), i...

This thesis presents the theoretical, conceptual and methodological aspects that support the modeling of dynamical systems (DS) by using several agents. The modeling approach permits the assessment of properties representing order, change, equilibrium, adaptability, and autonomy, in DS. The modeling processes were supported by a conceptual corpus regarding systems dynamics, multi-agent systems,...

As mobile dcviccs, such as laptops, PDAsor mobile phones, are getting more and morc ubiquitous and are able to directly cornmunicate with cach other via wireless technologies, the paradigrn 01' wirclcss Mobile Ad hoc NETworks (MANETs) is gaining popularity. Especially distributed real-time applications, Iike multiplayer garnes, group-work or multirnedia cntcrtainment, arc artractive for their u...

This paper presents a quantitative comparison of a collection of DSP multiprocessor list scheduling heuristics which consider inter-processor communication delays. The following aspects have been addressed: (1) performance in terms of the total execution time (makespan), (2) sensitivity of heuristics in terms of the characteristics of acyclic precedence graphs, including graph size and graph pa...