894 search results - page 126 / 179 » Game Theory with Costly Computation |
153
Voted
AAAI
2012
13 years 4 months ago
2012
This paper addresses the problem of automated advice provision in settings that involve repeated interactions between people and computer agents. This problem arises in many real ...
141
click to vote
CVPR
2000
IEEE
15 years 6 months ago
2000
IEEE
The general problem of surface matching is taken up in this study. The process described in this work hinges on a geodesic distance equation for a family of surfaces embedded in t...
109
click to vote
CORR
2010
Springer
15 years 1 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...
ISSAC
2004
Springer
15 years 7 months ago
2004
Springer
Many polynomial factorization algorithms rely on Hensel lifting and factor recombination. For bivariate polynomials we show that lifting the factors up to a precision linear in th...
108
click to vote
ACMACE
2008
ACM
15 years 3 months ago
2008
ACM
With many industrialized societies bearing the cost of an increasingly sedentary on the health of their populations there is a need to find new ways of encouraging physical activi...