949 search results - page 83 / 190 » Can Doxastic Agents Learn |
99
Voted
AAAI
1997
15 years 2 months ago
1997
The absolute loss is the absolute difference between the desired and predicted outcome. I demonstrateworst-case upper bounds on the absolute loss for the perceptron algorithm and ...
AGENTS
1997
Springer
15 years 5 months ago
1997
Springer
Abstract. We present a purely vision-based scheme for learning a topological representation of an open environment. The system represents selected places by local views of the surr...
99
Voted
AAAI
2008
15 years 3 months ago
2008
In this paper, we study a sequential decision making problem. The objective is to maximize the average reward accumulated over time subject to temporal cost constraints. The novel...
109
click to vote
IFIP12
2004
15 years 2 months ago
2004
: Conventional discussion environments provide the technical platform for distributed discussion and collaboration, but apart from some statistical data collected, rarely provide i...
109
click to vote
AAAI
1998
15 years 2 months ago
1998
Automatedreasoning or theorem proving essentially amounts to solving search problems. Despite significant progress in recent years theorem provers still have manyshortcomings. The...