1277 search results - page 21 / 256 » Terminating Decision Algorithms Optimally |
143
click to vote
CI
2006
15 years 3 months ago
2006
This paper investigates decision-theoretic planning in sophisticated autonomous agents operating in environments of real-world complexity. An example might be a planetary rover ex...
215
click to vote
SIGMOD
2007
ACM
16 years 3 months ago
2007
ACM
Managing uncertain data using probabilistic frameworks has attracted much interest lately in the database literature, and a central computational challenge is probabilistic infere...
121
click to vote
ICVS
2009
Springer
15 years 9 months ago
2009
Springer
Traditionally computer vision and pattern recognition algorithms are evaluated by measuring differences between final interpretations and ground truth. These black-box evaluations ...
128
click to vote
CP
1998
Springer
15 years 7 months ago
1998
Springer
The constraint paradigm provides powerful concepts to represent and solve different kinds of planning problems, e. g. factory scheduling. Factory scheduling is a demanding optimiz...
133
click to vote
GLOBECOM
2006
IEEE
15 years 9 months ago
2006
IEEE
— Next-generation mobile communication systems will provide “always best connected” services to mobile users via cellular networks that provide wide area coverage for global ...