4526 search results - page 81 / 906 » Algorithmic problems related to the Internet |
110
click to vote
ATAL
2007
Springer
15 years 10 months ago
2007
Springer
This paper proposes a context-dependent case-based mechanism for selecting negotiation partners with the focus on the adaptation of similarity relations to a specific context. Th...
133
Voted
ESA
2004
Springer
15 years 9 months ago
2004
Springer
We obtain the following results related to dynamic versions of the shortest-paths problem: (i) Reductions that show that the incremental and decremental singlesource shortest-paths...
144
click to vote
AAECC
2006
Springer
15 years 3 months ago
2006
Springer
So-called nonadjacent representations are commonly used in elliptic curve cryptography to facilitate computing a scalar multiple of a point on an elliptic curve. A nonadjacent rep...
129
Voted
ICRA
2010
IEEE
15 years 2 months ago
2010
IEEE
Abstract— This paper describes a new algorithm for cooperative and persistent simultaneous localization and mapping (SLAM) using multiple robots. Recent pose graph representation...
163
click to vote
ADBIS
2007
Springer
15 years 10 months ago
2007
Springer
In solving the classification problem in relational data mining, traditional methods, for example, the C4.5 and its variants, usually require data transformations from datasets sto...