Sciweavers

ICRA
2010
IEEE
105views Robotics» more  ICRA 2010»
13 years 8 months ago
On the implementation of single-query sampling-based motion planners
— Single-query sampling-based motion planners are an efficient class of algorithms widely used today to solve challenging motion planning problems. This paper exposes the common...
Ioan Alexandru Sucan, Lydia E. Kavraki
ICRA
2010
IEEE
121views Robotics» more  ICRA 2010»
13 years 8 months ago
Real-world validation of three tipover algorithms for mobile robots
— Mobile robot tipover is a concern as it can create dangerous situations for operators and bystanders, cause collateral damage to the surrounding environment, and result in an a...
Philip R. Roan, Aaron Burmeister, Amin Rahimi, Kev...
ICRA
2010
IEEE
144views Robotics» more  ICRA 2010»
13 years 8 months ago
Adaptation to robot failures and shape change in decentralized construction
— Our prior work [1] presented a decentralized algorithm for coordinating the construction of a truss structure out of multiple components. In this paper, we discuss adaptation i...
Seung-kook Yun, Daniela Rus
IAJIT
2010
115views more  IAJIT 2010»
13 years 8 months ago
An Enhancement of Major Sorting Algorithms
: One of the fundamental issues in computer science is ordering a list of items. Although there is a huge number of sorting algorithms, sorting problem has attracted a great deal o...
Jehad Alnihoud, Rami Mansi
GIS
2010
ACM
13 years 8 months ago
An algorithmic framework for segmenting trajectories based on spatio-temporal criteria
In this paper we address the problem of segmenting a trajectory such that each segment is in some sense homogeneous. We formally define different spatio-temporal criteria under ...
Maike Buchin, Anne Driemel, Marc J. van Kreveld, V...
FAW
2010
Springer
217views Algorithms» more  FAW 2010»
13 years 8 months ago
Path Separability of Graphs
In this paper we investigate the structural properties of k-path separable graphs, that are the graphs that can be separated by a set of k shortest paths. We identify several grap...
Emilie Diot, Cyril Gavoille
FAW
2010
Springer
203views Algorithms» more  FAW 2010»
13 years 8 months ago
Online Algorithms for the Newsvendor Problem with and without Censored Demands
The newsvendor problem describes the dilemma of a newspaper salesman—how many papers should he purchase each day to resell, when he doesn’t know the demand? We develop approach...
Peter Sempolinski, Amitabh Chaudhary
FAW
2010
Springer
238views Algorithms» more  FAW 2010»
13 years 8 months ago
Minimum Common String Partition Revisited
Haitao Jiang, Binhai Zhu, Daming Zhu, Hong Zhu
EVOW
2010
Springer
13 years 8 months ago
Finding Gapped Motifs by a Novel Evolutionary Algorithm
Background: Identifying approximately repeated patterns, or motifs, in DNA sequences from a set of co-regulated genes is an important step towards deciphering the complex gene reg...
Chengwei Lei, Jianhua Ruan
EC
2008
157views ECommerce» more  EC 2008»
13 years 8 months ago
The Crowding Approach to Niching in Genetic Algorithms
A wide range of niching techniques have been investigated in evolutionary and genetic algorithms. In this article, we focus on niching using crowding techniques in the context of ...
Ole J. Mengshoel, David E. Goldberg