1404 search results - page 61 / 281 » Complexity of admissible rules |
159
Voted
AINA
2006
IEEE
15 years 9 months ago
2006
IEEE
— In today’s service market the provisioning of high quality services has become a critical issue for providers as the business success of their customers is often based on the...
145
Voted
DOCENG
2003
ACM
15 years 9 months ago
2003
ACM
XPath [3, 5] is a powerful and quite successful language able to perform complex node selection in trees through compact specifications. As such, it plays a growing role in many ...
117
Voted
HT
2003
ACM
15 years 9 months ago
2003
ACM
Analogy-based estimation has, over the last 15 years, and particularly over the last 7 years, emerged as a promising approach with comparable accuracy to, or better than, algorith...
134
Voted
SDM
2010
SIAM
15 years 5 months ago
2010
SIAM
A relational probability tree (RPT) is a type of decision tree that can be used for probabilistic classification of instances with a relational structure. Each leaf of an RPT cont...
139
Voted
NAACL
2001
15 years 5 months ago
2001
Developing dialogue systems is a complex process. In particular, designing efficient dialogue management strategies is often difficult as there are no precise guidelines to develo...