3678 search results - page 378 / 736 » On the Stable Paths Problem |
183
click to vote
COMPGEOM
2003
ACM
16 years 15 hour ago
2003
ACM
Given a polygonal curve and a geometric graph, we describe an efficient algorithm to find a path in the graph which is most similar to the curve, using the well-known Fr´echet d...
166
click to vote
GECCO
2003
Springer
15 years 12 months ago
2003
Springer
We explore the advantages of DNA-like genomes for evolutionary computation in silico. Coupled with simulations of chemical reactions, these genomes offer greater efficiency, reliab...
156
click to vote
RTAS
1998
IEEE
15 years 11 months ago
1998
IEEE
In this paper we report the work carried out at VERIMAG 1 within the framework of an research cooperation with CNET 2 . The goal of this work was twofold: to formally specify the ...
165
click to vote
CCCG
2007
15 years 8 months ago
2007
We consider the problem of searching a polygonal room with two guards starting at a specified door point. While maintaining mutual visibility and without crossing the door, the g...
170
click to vote
CCCG
2007
15 years 8 months ago
2007
In the minimum-cost k-hop spanning tree (k-hop MST) problem, we are given a set S of n points in a metric space, a positive small integer k and a root point r ∈ S. We are intere...