The multiple weighted hitting set problem is to find a subset of nodes in a hypergraph that hits every hyperedge in at least m nodes. We extend the problem to a notion of hypergra...
Performance of distributed applications largely depends on the mapping of their components on the underlying architecture. On one mponent-based approaches provide an abstraction su...
Auctions are promising decentralized methods for teams of agents to allocate and re-allocate tasks among themselves in dynamic, partially known and time-constrained domains with p...
This paper describes our early work on design and development to support photolurking. Photolurking is browsing and looking at people’s photographs without participating in disc...
As online communities proliferate, methods are needed to explore and capture patterns of activity within them. This paper focuses on the problem of identifying active subgroups wi...