1117 search results - page 187 / 224 » Partial Models of Extended Generalized Logic Programs |
78
Voted
CORR
2006
Springer
14 years 9 months ago
2006
Springer
We address the problem of autonomously learning controllers for visioncapable mobile robots. We extend McCallum's (1995) Nearest-Sequence Memory algorithm to allow for genera...
108
click to vote
KDD
2007
ACM
15 years 10 months ago
2007
ACM
Characterising the differences between two databases is an often occurring problem in Data Mining. Detection of change over time is a prime example, comparing databases from two b...
STOC
2005
ACM
15 years 10 months ago
2005
ACM
We consider the problem of computing market equilibria and show three results. (i) For exchange economies satisfying weak gross substitutability we analyze a simple discrete versi...
CRYPTO
2008
Springer
14 years 11 months ago
2008
Springer
Abstract. The study of deterministic public-key encryption was initiated by Bellare et al. (CRYPTO '07), who provided the "strongest possible" notion of security for...
101
click to vote
ICALP
2011
Springer
14 years 1 months ago
2011
Springer
Competitive analysis is the established tool for measuring the output quality of algorithms that work in an online environment. Recently, the model of advice complexity has been in...