Sciweavers

366 search results - page 36 / 74
» fast 2011
Sort
View
IJRR
2011
174views more  IJRR 2011»
14 years 4 months ago
Bounding on rough terrain with the LittleDog robot
— 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 ...
Alexander C. Shkolnik, Michael Levashov, Ian R. Ma...
78
Voted
IJRR
2011
126views more  IJRR 2011»
14 years 4 months ago
Optimization and learning for rough terrain legged locomotion
We present a novel approach to legged locomotion over rough terrain that is thoroughly rooted in optimization. This approach relies on a hierarchy of fast, anytime algorithms to p...
Matthew Zucker, Nathan D. Ratliff, Martin Stolle, ...
JCNS
2011
61views more  JCNS 2011»
14 years 4 months ago
Automating the design of informative sequences of sensory stimuli
Adaptive stimulus design methods can potentially improve the efficiency of sensory neurophysiology experiments significantly; however, designing optimal stimulus sequences in re...
Jeremy Lewi, David M. Schneider, Sarah M. N. Wooll...
155
Voted
TAPAS
2011
286views Algorithms» more  TAPAS 2011»
14 years 4 months ago
Alternative Route Graphs in Road Networks
Every human likes choices. But today’s fast route planning algorithms usually compute just a single route between source and target. There are beginnings to compute alternative r...
Roland Bader, Jonathan Dees, Robert Geisberger, Pe...
TVLSI
2011
265views more  TVLSI 2011»
14 years 4 months ago
Decoding-Aware Compression of FPGA Bitstreams
Abstract—Bitstream compression is important in reconfigurable system design since it reduces the bitstream size and the memory requirement. It also improves the communication ba...
Xiaoke Qin, Chetan Muthry, Prabhat Mishra