216 search results - page 21 / 44 » Self Assembling Graphs |
ALENEX
2007
13 years 11 months ago
2007
We consider the problem of designing a distributed algorithm that, given an arbitrary connected graph G of nodes with unique labels, converts G into a sorted list of nodes. This a...
PPL
2008
13 years 9 months ago
2008
We provide self-stabilizing algorithms to obtain and maintain a maximal matching, maximal independent set or minimal dominating set in a given system graph. They converge in linea...
HIPC
2003
Springer
14 years 3 months ago
2003
Springer
ICAC
2006
IEEE
14 years 3 months ago
2006
IEEE
— In a service oriented environment such as the realm of document services, the conventional notion is that of a multi-function device interacting individually with customer appl...
HUC
2005
Springer
14 years 3 months ago
2005
Springer
This paper introduces a novel way to allow non-expert users to create smart surroundings. Non-smart everyday objects such as furniture and appliances found in homes and offices can...