4378 search results - page 74 / 876 » On the Complexity of Ordered Colourings |
157
click to vote
AAAI
2008
15 years 8 months ago
2008
Unifying first-order logic and probability is a long-standing goal of AI, and in recent years many representations combining aspects of the two have been proposed. However, infere...
174
click to vote
AIPS
2007
15 years 8 months ago
2007
Most traditional approaches to probabilistic planning in relationally specified MDPs rely on grounding the problem w.r.t. specific domain instantiations, thereby incurring a com...
160
click to vote
ARCS
2008
Springer
15 years 8 months ago
2008
Springer
Due to increasing complexity of modern real-time image processing applications, classical hardware development at register transfer level becomes more and more the bottleneck of te...
186
click to vote
ATAL
2008
Springer
15 years 8 months ago
2008
Springer
Decentralized Markov decision processes are frequently used to model cooperative multi-agent systems. In this paper, we identify a subclass of general DEC-MDPs that features regul...
177
click to vote
WSCG
2003
15 years 7 months ago
2003
The computation of global illumination in a dynamic scene constitutes a real challenge in computer graphics. In radiosity algorithms, this problem is far from being easy, especial...