3356 search results - page 125 / 672 » Determining Consensus Numbers |
DC
2007
13 years 10 months ago
2007
d bins abstraction and works in two phases. The main novelty of the work is in the first phase where the number of contending processes is reduced in a controlled manner. Probabil...
JCT
2006
13 years 10 months ago
2006
In [8] we posed a series of extremal (set system) problems under dimension constraints. In the present paper we study one of them: the intersection problem. The geometrical formul...
SWARM
2008
SPRINGER
13 years 10 months ago
2008
SPRINGER
Designing and analyzing self-organizing systems such as robotic swarms is a challenging task even though we have complete knowledge about the robot's interior. It is difficul...
INFORMATICALT
2007
13 years 10 months ago
2007
In this paper we recall the notion of weakly decomposition, we recall some necessary and sufficient conditions for a graph to admit such a decomposition, we introduce the recognit...
COMBINATORICS
2000
13 years 10 months ago
2000
The question of whether the characteristic polynomial of a simple graph is uniquely determined by the characteristic polynomials of its vertex-deleted subgraphs is one of the many...