6740 search results - page 142 / 1348 » An s -Hamiltonian Line Graph Problem |
116
click to vote
CRV
2006
IEEE
15 years 9 months ago
2006
IEEE
This paper presents an original framework for evolving a vision-based mobile robot controller using genetic programming. This framework is built on the Open BEAGLE framework for t...
109
click to vote
COMPGEOM
2004
ACM
15 years 8 months ago
2004
ACM
Let B be a set of n unit balls in R3 . We show that the combinatorial complexity of the space of lines in R3 that avoid all the balls of B is O(n3+ε ), for any ε > 0. This re...
CCCG
2006
15 years 4 months ago
2006
We study the following geometric probing problem: Reconstruct a planar polygon from its intersections with a collection of arbitrarily-oriented "cutting" lines. We propo...
109
click to vote
DM
2008
15 years 3 months ago
2008
One proves that certain numbers occurring in a problem of paths enumeration, studied by Niederhausen in [7] (see also [10]), are top intersection numbers in the cohomology ring of...
121
click to vote
FSTTCS
2010
Springer
15 years 1 months ago
2010
Springer
ABSTRACT. The maximum independent set problem (MAXIS) on general graphs is known to be NPhard to approximate within a factor of n1-, for any > 0. However, there are many "...