490 search results - page 16 / 98 » Impossibilities for roommate problems |
WDAG
1997
Springer
13 years 11 months ago
1997
Springer
Abstract. We study the problem of achieving reliable communication with quiescent algorithms (i.e., algorithms that eventually stop sending messages) in asynchronous systems with p...
ICCAD
2002
IEEE
14 years 4 months ago
2002
IEEE
This paper presents an approach to the analysis of task sets implemented on multiprocessor systems, when the task execution times are specified as generalized probability distrib...
CCS
2008
ACM
13 years 9 months ago
2008
ACM
Wireless communication enables a broad spectrum of applications, ranging from commodity to tactical systems. Neighbor discovery (ND), that is, determining which devices are within...
SIAMCOMP
2002
13 years 7 months ago
2002
This paper introduces a simple notion of layering as a tool for analyzing well-behaved runs of a given model of distributed computation. Using layering, a model-independent analysi...
SUM
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. Probabilistic logic programs have primarily studied the problem of entailment of probabilistic atoms. However, there are some interesting applications where we are intere...