2657 search results - page 269 / 532 » On the complexity of hierarchical problem solving |
157
click to vote
RAS
1998
15 years 6 months ago
1998
We present a new approach to the multi-robot path planning problem, where a number of robots are to change their positions through feasible motions in the same static environment....
168
click to vote
TVCG
2010
15 years 5 months ago
2010
—This paper presents the first practical method for “origamizing” or obtaining the folding pattern that folds a single sheet of material into a given polyhedral surface with...
195
click to vote
MDM
2009
Springer
16 years 1 months ago
2009
Springer
— This work aims at minimize the cost of answering snapshot multi-predicate queries in high-communication-cost networks. High-communication-cost (HCC) networks is a family of net...
141
click to vote
WADS
1997
Springer
15 years 11 months ago
1997
Springer
A fundamental task for an autonomous robot is to plan its own motions. Exact approaches to the solution of this motion planning problem suffer from high worst-case running times. ...
184
click to vote
SIP
2003
15 years 8 months ago
2003
This paper presents an efficient method for designing full band IIR digital differentiators in the complex Chebyshev sense. The proposed method is based on the formulation of a g...