12673 search results - page 2095 / 2535 » Learning while designing |
195
click to vote
COMGEO
2008
ACM
15 years 7 months ago
2008
ACM
We present an algorithm for approximating a given open polygonal curve with a minimum number of circular arcs. In computer-aided manufacturing environments, the paths of cutting t...
182
click to vote
CORR
2010
Springer
15 years 7 months ago
2010
Springer
During the last decade, incremental sampling-based motion planning algorithms, such as the Rapidly-exploring Random Trees (RRTs), have been shown to work well in practice and to po...
218
click to vote
CORR
2008
Springer
15 years 7 months ago
2008
Springer
Results for Gaussian relay channels typically focus on maximizing transmission rates for given locations of the source, relay and destination. We introduce an alternative perspecti...
222
click to vote
Publication
State-of-the-art techniques for probability sampling of users of online social networks (OSNs) are based on random walks on a single social relation. While powerful, these methods ...
185
click to vote
CORR
2008
Springer
15 years 7 months ago
2008
Springer
In wireless networks, the knowledge of nodal distances is essential for performance analysis and protocol design. When determining distance distributions in random networks, the u...