1941 search results - page 243 / 389 » On the Hardness of Approximate Reasoning |
176
click to vote
PAKM
2008
15 years 7 months ago
2008
With a rich variety of forms and types, digital resources are complex data objects. They grows fast in volume on the Web, but hard to be classified efficiently. The paper presents ...
170
click to vote
AIPS
2006
15 years 7 months ago
2006
Planning for partially observable, nondeterministic domains is a very signi cant and computationally hard problem. Often, reasonable assumptions can be drawn over expected/nominal...
141
click to vote
AAAI
2000
15 years 7 months ago
2000
The random k-SAT model is extensively used to compare satisfiability algorithms or to find the best settings for the parameters of some algorithm. Conclusions are derived from the...
149
click to vote
COLING
2000
15 years 7 months ago
2000
Data-Oriented Translation (DOT), which is based on Data-Oriented Parsing (DOP), comprises an experience-based approach to translation, where new translations are derived with refe...
170
click to vote
INFSOF
2008
15 years 6 months ago
2008
Architectural patterns are a fundamental aspect of the architecting process and subsequently the architectural documentation. Unfortunately, there is only poor support for modelin...