6562 search results - page 317 / 1313 » Noetherianity and Combination Problems |
170
click to vote
ECAI
2008
Springer
15 years 8 months ago
2008
Springer
Constraint satisfaction problems (CSPs) are ubiquitous in many real-world contexts. However, modeling a problem as a CSP can be very challenging, usually requiring considerable ex...
161
click to vote
UAI
2004
15 years 8 months ago
2004
We show that the class of strongly connected graphical models with treewidth at most k can be properly efficiently PAC-learnt with respect to the Kullback-Leibler Divergence. Prev...
166
click to vote
AAAI
2000
15 years 8 months ago
2000
Scheduling, routing, and layout tasks are examples of hard operations-research problems that have broad application in industry. Typical algorithms for these problems combine some...
164
click to vote
AAAI
1997
15 years 8 months ago
1997
Partially observable Markov decision processes (POMDPs) allow one to model complex dynamic decision or control problems that include both action outcome uncertainty and imperfect ...
168
click to vote
IJCAI
1989
15 years 8 months ago
1989
In many applications in mobile robotics, it is important for a robot to explore its environment in order to construct a representation of space useful for guiding movement. We refe...