vii

Motivation Previous work in coordination (Bond & Gasser 1988) on multi-agent systems are specific either to cooperative or non-coperative problem domains. Previous work in learning in multi-agent systems have considered agents operating to solve a cooperative task with explicit information sharing and negotiations (Wei 1993, Tan 1993). In a companion paper (Sen, Sekaran, & Hale 1994) we describ...

In this paper we consider the optimistic approach of the non-repudiation protocols. We study a non-repudiation protocol with off-line trusted third party and we keep on with the definition of the multi-party non-repudiation, compare it to multi-party fair exchange and show some fundamental differences between these two problems. Finally, we generalize our protocol and propose a multi-party non-...

Full-system simulation is increasingly used to evaluate the performance of commercial workloads on future multiprocessor designs. However, challenges such as simulation slowdown, sizing constraints, and workload tuning impede the development of commercial workloads for timing simulators. We describe how we address these challenges in our development of four commercial workload benchmarks. This ...

We present a multi-party non-repudiation protocol, based on a group encryption scheme. We define multi-party non-repudiation, compare it to multi-party fair exchange and show some fundamental differences between these two problems. This is the first effort to generalize nonrepudiation to the multi-party case. Our definitions and the resulting protocol are more general than the ones given in the...

A continuum is an arboroid if it is hereditarily unicoherent and arcwise connected. A metric arboroid is a dendroid. A generalized dendrite is a locally connected arboroid. Among other things, we shall prove that a locally connected continuum X is a generalized dendrite if and only if X has the fixed point property for continuous, closed set-valued mappings.

At least three major subproblems can be distinguished in a multi-agent planning problem: a task allocation problem (which agent performs which subtasks), an individual planning problem for each of the agents involved (how to ensure that the tasks allocated to me can be performed), and a plan coordination problem (how to ensure that the individual planning processes can be integrated into an ove...

This paper advocates a novel framework for segmenting a dataset on a Riemannian manifold M into clusters lying around lowdimensional submanifolds of M . Important examples of M , for which the proposed algorithm is computationally efficient, include the sphere, the set of positive definite matrices, and the Grassmannian. The proposed algorithm constructs a data-affinity matrix by thoroughly exp...

Semi-active fluid viscous dampers as a subset of control systems have shown their ability to reduce seismic responses of tall buildings. In this paper, multi-objective optimization of the performance of this group of dampers in reducing the seismic responses of buildings is studied using multi-objective genetic algorithms. For numerical example, two 7 and 18 stories buildings are chosen and mod...