880 search results - page 76 / 176 » The SLAM problem: a survey |
196
click to vote
ACMICEC
2006
ACM
16 years 11 days ago
2006
ACM
In electronic marketplaces populated by self-interested agents, buyer agents would benefit by modeling the reputation of seller agents, in order to make effective decisions abou...
156
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
One possible escape from the Gibbard-Satterthwaite theorem is computational complexity. For example, it is NP-hard to compute if the STV rule can be manipulated. However, there is...
189
click to vote
ALT
2004
Springer
15 years 10 months ago
2004
Springer
Abstract. We present a survey of recent results concerning the theoretical and empirical performance of algorithms for learning regularized least-squares classifiers. The behavior ...
161
click to vote
LICS
2002
IEEE
15 years 11 months ago
2002
IEEE
Monadic query languages over trees currently receive considerable interest in the database community, as the problem of selecting nodes from a tree is the most basic and widesprea...
143
click to vote
DIMACS
2001
15 years 7 months ago
2001
We investigate visibility computations with moving viewpoints. The initial problems are of discrete and algorithmic nature, but even for simple classes of objects (such as balls an...