189 search results - page 7 / 38 » Shortest Paths Without a Map |
LATIN
1998
Springer
15 years 1 months ago
1998
Springer
Abstract. Automatic graph drawers need to compute paths among vertices of a simple polygon which besides remaining in the interior need to exhibit certain aesthetic properties. Som...
71
Voted
GECCO
2008
Springer
14 years 10 months ago
2008
Springer
We show that the natural evolutionary algorithm for the all-pairs shortest path problem is significantly faster with a crossover operator than without. This is the first theoret...
80
Voted
IROS
2006
IEEE
15 years 3 months ago
2006
IEEE
— This paper presents a new sensor based global Path Planner which operates in two steps. In the first step the safest areas in the environment are extracted by means of a Voron...
CCCG
2010
14 years 11 months ago
2010
Consider an arrangement of equilateral non-overlapping translated triangles in the plane and two points S and T so that the segment ST is parallel to a side of each of the triangl...
85
Voted
ASPDAC
2005
ACM
14 years 11 months ago
2005
ACM
Abstract— ACG (Adjacent Constraint Graph) is a general floorplan representation. The refinement of constraint graphs gives not only an efficient representation but also a repre...