Abstract. The general timetabling problem is an assignment of activities to xed time intervals, adhering to a prede ned set of resource availabilities. Timetabling problems are di ...
In designing a Bayesian network for an actual problem, developers need to bridge the gap between ematical abstractions offered by the Bayesian-network formalism and the features o...
As computer systems continue to grow in power and access more networked content and services, we believe there will be an increasing need to provide more user-centric systems that...
In this paper, we have studied a common Web service composition problem, the syntactic matching problem, where the output parameters of a Web service can be used as the input para...
We present a formalism for representing the formation of intentions by agents engaged in cooperative activity. We use a syntactic approach presenting a formal logical calculus tha...