Sciweavers

1040 search results - page 163 / 208
» Rounding algorithms for covering problems
Sort
View
IROS
2008
IEEE
167views Robotics» more  IROS 2008»
15 years 4 months ago
Multi-robot complete exploration using hill climbing and topological recovery
— This article addresses the problem of autonomous map building and exploration of an unknown environment with mobile robots. The proposed method assumes that mobile robots use o...
Rui Rocha, João Filipe Ferreira, Jorge Dias
IPPS
2007
IEEE
15 years 4 months ago
ESSTCP: Enhanced Spread-Spectrum TCP
Having stealth and lightweight authentication methods is empowering network administrators to shelter critical services from adversaries. Spread-Spectrum TCP (SSTCP) [1] is one of...
Amir R. Khakpour, Hakima Chaouchi
ICRA
2006
IEEE
217views Robotics» more  ICRA 2006»
15 years 3 months ago
Complete Coverage Control for Nonholonomic Mobile Robots in Dynamic Environments
— We study the problem of generating continuous steering control for robots to completely cover a bounded region over a finite time. First, we pack the area by disks of minimum ...
Yi Guo, Mohanakrishnan Balakrishnan
EVOW
2005
Springer
15 years 3 months ago
Evolutionary Biclustering of Microarray Data
In this work, we address the biclustering of gene expression data with evolutionary computation, which has been proven to have excellent performance on complex problems. In express...
Jesús S. Aguilar-Ruiz, Federico Divina
SGAI
2005
Springer
15 years 3 months ago
Geometric Proportional Analogies In Topographic Maps: Theory and Application
This paper details the application of geometric proportional analogies in the sub-classification of polygons within a topographic (land cover) map. The first part of this paper co...
Emma-Claire Mullally, Diarmuid P. O'Donoghue, Amy ...