Sciweavers

2489 search results - page 259 / 498
» On the Subgroup Distance Problem
Sort
View
JUCS
2007
137views more  JUCS 2007»
15 years 4 months ago
An Approach to Polygonal Approximation of Digital Curves Based on Discrete Particle Swarm Algorithm
: An approach to polygonal approximation of regular digital curves based on PSO algorithm is presented. In this paper, each particle corresponds to a candidate solution to the poly...
Fangmin Dong, Renbin Xiao, Yifang Zhong, Yong Liu
IJCGA
2000
85views more  IJCGA 2000»
15 years 4 months ago
Obnoxious Facility Location: Complete Service with Minimal Harm
We present e cient algorithms for several instances of the following facility location problem. Facilities and demand sites are represented as points in the plane. Place k obnoxio...
Boaz Ben-Moshe, Matthew J. Katz, Michael Segal
JDA
2008
122views more  JDA 2008»
15 years 4 months ago
An approximation algorithm for sorting by reversals and transpositions
Abstract. Genome rearrangement algorithms are powerful tools to analyze gene orders in molecular evolution. Analysis of genomes evolving by reversals and transpositions leads to a ...
Atif Rahman, Swakkhar Shatabda, Masud Hasan
ICRA
2010
IEEE
265views Robotics» more  ICRA 2010»
15 years 3 months ago
A generalization of the metric-based Iterative Closest Point technique for 3D scan matching
— Scan matching techniques have been widely used to compute the displacement of robots. This estimate is part of many algorithms addressing navigation and mapping. This paper add...
Leopoldo Armesto, Javier Minguez, Luis Montesano
ICRA
2010
IEEE
131views Robotics» more  ICRA 2010»
15 years 3 months ago
Optimal coverage of a known arbitrary environment
— The problem of coverage of known space by a mobile robot has many applications. Of particular interest is providing a solution that guarantees the complete coverage of the free...
Raphael Mannadiar, Ioannis M. Rekleitis