5316 search results - page 191 / 1064 » Which Search Problems Are Random |
165
Voted
IJRR
2011
14 years 10 months ago
2011
— In this paper we develop an RRT-based motion planner that achieved bounding in simulation with the LittleDog robot over extremely rough terrain. LittleDog is a quadruped robot ...
133
click to vote
CORR
2008
Springer
15 years 3 months ago
2008
Springer
A string matching--and more generally, sequence matching--algorithm is presented that has a linear worst-case computing time bound, a low worst-case bound on the number of compari...
108
click to vote
CP
2006
Springer
15 years 7 months ago
2006
Springer
This paper presents an enumerative approach for a sports league scheduling problem. This simple method can solve some instances involving a number T of teams up to 70 while the bes...
127
click to vote
IJON
2010
15 years 1 months ago
2010
Genetic Algorithms (GAs), as nondeterministic conformational search techniques, are promising for solving protein structure prediction (PSP) problems. The crossover operator of a ...
IPPS
2009
IEEE
15 years 10 months ago
2009
IEEE
In this paper we present the results of parallelizing two life sciences applications, Markov random fieldsbased (MRF) liver segmentation and HMMER’s Viterbi algorithm, using GP...