Sciweavers

1971 search results - page 175 / 395
» Tabu search - Uncharted domains
Sort
View
ROBOCOMM
2007
IEEE
16 years 22 days ago
Achieving connectivity through coalescence in mobile robot networks
—Coalescence is the problem of isolated mobile robots independently searching for peers with the goal of forming a single connected network. This paper analyzes coalescence time ...
Sameera Poduri, Gaurav S. Sukhatme
IROS
2006
IEEE
166views Robotics» more  IROS 2006»
16 years 14 days ago
Anytime RRTs
— We present an anytime algorithm for planning paths through high-dimensional, non-uniform cost search spaces. Our approach works by generating a series of Rapidly-exploring Rand...
Dave Ferguson, Anthony Stentz
ITNG
2006
IEEE
16 years 14 days ago
Evaluating Parallel Computing Systems in Bioinformatics
The utilization of parallel processing in bioinformatics is a relatively new development, and wide spread use of parallel processing in this domain has been limited by the availab...
Erik S. Gough, Michael D. Kane
ICCV
2005
IEEE
16 years 2 days ago
Common Pattern Discovery Using Earth Mover's Distance and Local Flow Maximization
In this paper, we present a novel segmentationinsensitive approach for mining common patterns from 2 images. We develop an algorithm using the Earth Movers Distance (EMD) framewor...
Hung-Khoon Tan, Chong-Wah Ngo
OOPSLA
2005
Springer
15 years 12 months ago
Inferring context-free grammars for domain-specific languages
Grammatical inference (or grammar inference) has been applied to various problems in areas such as computational biology, and speech and pattern recognition but its application to...
Faizan Javed