2658 search results - page 469 / 532 » Autonomic Computing: An Overview |
187
click to vote
WAOA
2005
Springer
15 years 11 months ago
2005
Springer
Given a graph with a source and a sink node, the NP–hard maximum k–splittable flow (MkSF) problem is to find a flow of maximum value with a flow decomposition using at most...
137
click to vote
ECAI
2004
Springer
15 years 11 months ago
2004
Springer
d abstract)1 Niek Bergboer Eric Postma Jaap van den Herik Institute for Knowledge and Agent Technology, Universiteit Maastricht, P.O. Box 616, 6200 MD Maastricht It is well known t...
146
click to vote
GI
2004
Springer
15 years 11 months ago
2004
Springer
: The article provides an overview of the legal relationships in Open Source Structures. It shows that – as within all software development and distribution models – different ...
150
click to vote
C5
2003
IEEE
15 years 11 months ago
2003
IEEE
This poster presentation introduces our first Squeak workshops offered in the context of the ALAN-K (Advanced LeArning Network in Kyoto) project (Konomi and Karuno, 2003), which i...
167
click to vote
FOCS
2003
IEEE
15 years 11 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, ...