874 search results - page 111 / 175 » Computing Weighted Solutions in Answer Set Programming |
113
Voted
PLDI
2010
ACM
16 years 5 days ago
2010
ACM
We define the reachability-bound problem to be the problem of finding a symbolic worst-case bound on the number of times a given control location inside a procedure is visited in ...
142
Voted
ECAI
2008
Springer
15 years 4 months ago
2008
Springer
Many real-world applications of AI require both probability and first-order logic to deal with uncertainty and structural complexity. Logical AI has focused mainly on handling com...
109
Voted
SAC
2009
ACM
15 years 9 months ago
2009
ACM
The molecular distance geometry problem can be formulated as the problem of finding an immersion in R3 of a given undirected, nonnegatively weighted graph G. In this paper, we di...
134
Voted
JAVA
2001
Springer
15 years 7 months ago
2001
Springer
Rapid commoditization of advanced hardware and progress of networking technology is now making wide area high-performance computing a.k.a. the ‘Grid’ Computing a reality. Sinc...
115
Voted
KDD
2005
ACM
15 years 8 months ago
2005
ACM
Data clustering represents an important tool in exploratory data analysis. The lack of objective criteria render model selection as well as the identification of robust solutions...