Sciweavers

4679 search results - page 217 / 936
» Modeling When Connections Are the Problem
Sort
View
ICRA
2002
IEEE
92views Robotics» more  ICRA 2002»
15 years 10 months ago
Resolution Complete Rapidly-Exploring Random Trees
Trajectory design for high-dimensional systems with nonconvex constraints is a challenging problem considered in this paper. Classical dynamic programming is often employed, but c...
Peng Cheng, Steven M. LaValle
GECCO
1999
Springer
133views Optimization» more  GECCO 1999»
15 years 9 months ago
Evolution of Goal-Directed Behavior from Limited Information in a Complex Environment
In this paper, we apply an evolutionary algorithm to learning behavior on a novel, interesting task to explore the general issue of learning e ective behaviors in a complex enviro...
Matthew R. Glickman, Katia P. Sycara
CORR
2008
Springer
101views Education» more  CORR 2008»
15 years 5 months ago
Sublinear Communication Protocols for Multi-Party Pointer Jumping and a Related Lower Bound
We study the one-way number-on-the-forehead (NOF) communication complexity of the k-layer pointer jumping problem with n vertices per layer. This classic problem, which has connec...
Joshua Brody, Amit Chakrabarti
159
Voted
ICPR
2004
IEEE
16 years 6 months ago
Registration of an Uncalibrated Image Pair to a 3D Surface Model
The following data fusion problem is considered: Given a 3D geometric model of an object and two uncalibrated images of the same object, and assuming that the object surface is te...
Dmitry Chetverikov, Zsolt Jankó
ICCVW
1999
Springer
15 years 9 months ago
A General Method for Feature Matching and Model Extraction
Abstract. Popular algorithms for feature matching and model extraction fall into two broad categories, generate-and-test and Hough transform variations. However, both methods su er...
Clark F. Olson