Sciweavers

3678 search results - page 111 / 736
» On the Stable Paths Problem
Sort
View
AUSAI
2008
Springer
15 years 2 months ago
Constraint-Based Multi-agent Path Planning
Planning collision-free paths for multiple robots traversing a shared space is a problem that grows combinatorially with the number of robots. The naive centralised approach soon ...
Malcolm Ryan
105
Voted
CCCG
2010
15 years 2 months ago
Approximate shortest path algorithms for sequences of pairwise disjoint simple polygons
Assume that two points p and q are given and a finite ordered set of simple polygons, all in the same plane; the basic version of a touring-a-sequence-of-polygons problem (TPP) is...
Xiuxia Pan, Fajie Li, Reinhard Klette
79
Voted
DCG
2007
65views more  DCG 2007»
15 years 22 days ago
Paths of Trains with Two-Wheeled Cars
In this paper we study the following simple and mind-puzzling problem: Can a model train car, which runs along an intricate track complete a full cycle around it? In our paper a t...
Luis Montejano, Jorge Urrutia
108
Voted
WABI
2007
Springer
133views Bioinformatics» more  WABI 2007»
15 years 6 months ago
RNA Folding Including Pseudoknots: A New Parameterized Algorithm and Improved Upper Bound
Predicting the secondary structure of an RNA sequence is an important problem in structural bioinformatics. The general RNA folding problem, where the sequence to be folded may con...
Chunmei Liu, Yinglei Song, Louis W. Shapiro
BIBE
2007
IEEE
174views Bioinformatics» more  BIBE 2007»
15 years 7 months ago
Shortest Path Approaches for the Longest Common Subsequence of a Set of Strings
—We investigate the k-LCS problem that is finding a longest common subsequence (LCS) for k given input strings. The problem is known to have practical solutions for k = 2, but f...
Marina Barsky, Ulrike Stege, Alex Thomo, Chris Upt...