258 search results - page 47 / 52 » Some Notes on Fine Computability |
AI
2007
Springer
14 years 9 months ago
2007
Springer
The process of forming coalitions of software agents generally requires calculating a value for every possible coalition which indicates how beneficial that coalition would be if...
107
click to vote
FOCS
2010
IEEE
14 years 7 months ago
2010
IEEE
We consider k-median clustering in finite metric spaces and k-means clustering in Euclidean spaces, in the setting where k is part of the input (not a constant). For the k-means pr...
81
Voted
ICDCS
2007
IEEE
15 years 4 months ago
2007
IEEE
We propose a new genre of overlay network for disseminating information from popular but resource constrained sources. We call this communication primitive as Latency Gradated Ove...
FOCS
2003
IEEE
15 years 3 months ago
2003
IEEE
We consider the problem of clustering a collection of elements based on pairwise judgments of similarity and dissimilarity. Bansal, Blum and Chawla (in: Proceedings of 43rd FOCS, ...
118
click to vote
TASE
2008
IEEE
14 years 9 months ago
2008
IEEE
In this paper we deal with the problem of modeling railway networks with Petri nets so as to apply the theory of supervisory control for discrete event systems to automatically de...