3946 search results - page 728 / 790 » The computational complexity of choice sets |
152
click to vote
ICRA
2006
IEEE
16 years 12 days ago
2006
IEEE
— We propose a novel solution to the problem of inverse kinematics for redundant robotic manipulators for the purposes of goal selection for path planning. We unify the calculati...
206
click to vote
P2P
2006
IEEE
16 years 12 days ago
2006
IEEE
Given some of the recent advances in Distributed Hash Table (DHT) based Peer-To-Peer (P2P) systems we ask the following questions: Are there applications where unstructured querie...
202
click to vote
ICCV
2005
IEEE
15 years 12 months ago
2005
IEEE
We address the problem of seeking the global mode of a density function using the mean shift algorithm. Mean shift, like other gradient ascent optimisation methods, is susceptible...
167
click to vote
PADS
2004
ACM
15 years 11 months ago
2004
ACM
Computer simulation is the most common approach to studying wireless ad-hoc routing algorithms. The results, however, are only as good as the models the simulation uses. One shoul...
155
click to vote
PODC
2004
ACM
15 years 11 months ago
2004
ACM
The Border Gateway Protocol (BGP) for interdomain routing is designed to allow autonomous systems (ASes) to express policy preferences over alternative routes. We model these pref...