Abstract. Trees are useful data structures, but to design efficient parallel programs over trees is known to be more difficult than to do over lists. Although several important tre...
We propose the first combinatorial solution to one of the most classic problems in combinatorial optimization: the generalized minimum cost flow problem (flow with losses and g...
We consider the problem of how to design large decentralized multiagent systems (MAS’s) in an automated fashion, with little or no hand-tuning. Our approach has each agent run a...
Abstract: Recently a growing demand has arisen for methods for the development of smalland medium scale Web Information Systems (WIS). Web applications are being built in a rapidly...
We live in a world where many kinds of data about us can be collected and more will be collected as Ubicomp technologies mature. People reflect on this data using different tools ...