2223 search results - page 309 / 445 » Ontological Framework for Approximation |
136
Voted
IJCAI
2007
15 years 6 months ago
2007
Diagnosability of systems is an essential property that determines how accurate any diagnostic reasoning can be on a system given any sequence of observations. Generally, in the l...
143
click to vote
NIPS
2008
15 years 6 months ago
2008
We show that an important and computationally challenging solution space feature of the graph coloring problem (COL), namely the number of clusters of solutions, can be accurately...
174
click to vote
ACST
2006
15 years 6 months ago
2006
A constraint satisfaction problem (CSP) is a general framework that can formalize various application problems in artificial intelligence. However, practical real-world problems t...
145
click to vote
EMNLP
2006
15 years 6 months ago
2006
We extended language modeling approaches in information retrieval (IR) to combine collaborative filtering (CF) and content-based filtering (CBF). Our approach is based on the anal...
138
click to vote
NIPS
2001
15 years 6 months ago
2001
Massive transaction data sets are recorded in a routine manner in telecommunications, retail commerce, and Web site management. In this paper we address the problem of inferring p...