3008 search results - page 250 / 602 » Independence in connected graphs |
176
click to vote
IROS
2006
IEEE
16 years 21 days ago
2006
IEEE
Abstract— This paper presents an approach to create topological maps from geometric maps obtained with a mobile robot in an indoor-environment using range data. Our approach util...
174
click to vote
DIAGRAMS
2004
Springer
16 years 1 days ago
2004
Springer
Abstract. This paper shows by a constructive method the existence of a diagrammatic representation called extended Euler diagrams for any collection of sets X1, ..., Xn , n < 9....
172
Voted
SIGCOMM
1992
ACM
15 years 10 months ago
1992
ACM
With the emergence of large switched public data networks that are well-suited to connectionless internets, for instance SMDS, it is possible that larger and larger numbers of int...
212
click to vote
EUROGP
2008
Springer
15 years 8 months ago
2008
Springer
Two prominent genetic programming approaches are the graph-based Cartesian Genetic Programming (CGP) and Linear Genetic Programming (LGP). Recently, a formal algorithm for construc...
124
click to vote
CACM
2008
15 years 6 months ago
2008
In this article, we study the problem of distributed selection from a theoretical point of view. Given a general connected graph of diameter D consisting of n nodes in which each ...