1167 search results - page 219 / 234 » Relational Markov Games |
ASPDAC
2007
ACM
14 years 1 months ago
2007
ACM
Abstract-- SAT sweeping is the process of merging two or more functionally equivalent nodes in a circuit by selecting one of them to represent all the other equivalent nodes. This ...
CICLING
2009
Springer
14 years 1 months ago
2009
Springer
Abstract. Automated language identification of written text is a wellestablished research domain that has received considerable attention in the past. By now, efficient and effecti...
HRI
2007
ACM
14 years 1 months ago
2007
ACM
Intelligent planning algorithms such as the Partially Observable Markov Decision Process (POMDP) have succeeded in dialog management applications [10, 11, 12] because of their rob...
AAAI
2008
14 years 4 days ago
2008
Classification of texts potentially containing a complex and specific terminology requires the use of learning methods that do not rely on extensive feature engineering. In this w...
KDD
2010
ACM
13 years 11 months ago
2010
ACM
Linked or networked data are ubiquitous in many applications. Examples include web data or hypertext documents connected via hyperlinks, social networks or user profiles connected...