4378 search results - page 135 / 876 » On the Complexity of Ordered Colourings |
158
click to vote
AAAI
2008
15 years 8 months ago
2008
Many real-world problems are characterized by complex relational structure, which can be succinctly represented in firstorder logic. However, many relational inference algorithms ...
165
click to vote
AIPS
2008
15 years 8 months ago
2008
We present a faster method of solving optimal planning problems and show that our solution performs up to an order of magnitude faster than Satplan on a variety of problems from t...
186
click to vote
EDCC
2008
Springer
15 years 8 months ago
2008
Springer
This work addresses the problem of software fault diagnosis in complex safety critical software systems. The transient manifestations of software faults represent a challenging is...
160
click to vote
ACL
2007
15 years 8 months ago
2007
A minimally supervised machine learning framework is described for extracting relations of various complexity. Bootstrapping starts from a small set of n-ary relation instances as...
205
click to vote
EMNLP
2008
15 years 8 months ago
2008
Complex questions that require inferencing and synthesizing information from multiple documents can be seen as a kind of topicoriented, informative multi-document summarization. I...