2569 search results - page 379 / 514 » Approximate Objects and Approximate Theories |
170
click to vote
ATAL
2003
Springer
15 years 11 months ago
2003
Springer
There has been substantial progress with formal models for sequential decision making by individual agents using the Markov decision process (MDP). However, similar treatment of m...
172
click to vote
CIKM
2003
Springer
15 years 11 months ago
2003
Springer
Searchers can have problems devising queries that accurately express their, often dynamic, information needs. In this paper we describe an adaptive approach that uses unobtrusive ...
161
click to vote
RTSS
2002
IEEE
15 years 11 months ago
2002
IEEE
Typical real-time scheduling theory has addressed deadline and energy constraints as well as deadline and reward constraints simultaneously in the past. However, we believe that e...
185
click to vote
COCO
2001
Springer
15 years 11 months ago
2001
Springer
Motivated by recent work on quantum black-box query complexity, we consider quantum versions of two wellstudied models of learning Boolean functions: Angluin’s model of exact le...
177
click to vote
EMMCVPR
2001
Springer
15 years 11 months ago
2001
Springer
Recent work (Yedidia, Freeman, Weiss [22]) has shown that stable points of belief propagation (BP) algorithms [12] for graphs with loops correspond to extrema of the Bethe free ene...