3204 search results - page 316 / 641 » The Alcuin Number of a Graph |
156
click to vote
AI
2002
Springer
15 years 6 months ago
2002
Springer
The emergence of social conventions in multi-agent systems has been analyzed mainly in settings where every agent may interact either with every other agent or with nearest neighb...
166
click to vote
STOC
1997
ACM
15 years 11 months ago
1997
ACM
We consider exploration problems where a robot has to construct a complete map of an unknown environment. We assume that the environment is modeled by a directed, strongly connecte...
203
click to vote
ENDM
2007
15 years 6 months ago
2007
d Abstract) Pascal Ochem∗, Alexandre Pinlou† LaBRI, Université Bordeaux 1, 351, Cours de la Libération, 33405 Talence Cedex, France March 16, 2007 A homomorphism from an ori...
172
Voted
GD
2006
Springer
15 years 10 months ago
2006
Springer
We prove that computing a geometric minimum-dilation graph on a given set of points in the plane, using not more than a given number of edges, is an NP-hard problem, no matter if ...
151
click to vote
COMGEO
2010
ACM
15 years 6 months ago
2010
ACM
We use Bernstein's Theorem [1] to obtain combinatorial bounds for the number of embeddings of Laman graph frameworks modulo rigid motions. For this, we study the mixed volume...