Graph Isomorphism is the prime example of a computational problem with a wide difference between the best known lower and upper bounds on its complexity. There is a significant ...
: This paper first comments on the surprisingly poor status that Quantum Chemistry has offered to the fantastic intuition of Lewis concerning the distribution of the electrons in ...
Matchmaking will be an important component of future agent and agent-like systems, such as the semantic web. Most research on matchmaking has been directed toward sophisticated ma...
Scenario-based specifications such as Message Sequence Charts (MSCs) are becoming increasingly popular as part of a requirements specification. Scenarios describe how system compo...
Abstract. Policies are declarations of constraints on the behaviour of components within distributed systems, and are often used to capture norms within agent-based systems. A few ...
Murat Sensoy, Timothy J. Norman, Wamberto Weber Va...