2526 search results - page 410 / 506 » A New Algorithm for Answer Set Computation |
DAC
2003
ACM
14 years 10 months ago
2003
ACM
SAT-based decision procedures for quantifier-free fragments of firstorder logic have proved to be useful in formal verification. These decision procedures are either based on enco...
DAC
2006
ACM
14 years 10 months ago
2006
ACM
In this paper we propose a new communication synthesis approach targeting systems with sequential communication media (SCM). Since SCMs require that the reading sequence and writi...
ICML
2007
IEEE
14 years 10 months ago
2007
IEEE
Given a sample covariance matrix, we examine the problem of maximizing the variance explained by a particular linear combination of the input variables while constraining the numb...
APPROX
2009
Springer
14 years 3 months ago
2009
Springer
Abstract. This work considers the problem of approximating fixed predicate constraint satisfaction problems (MAX k-CSP(P)). We show that if the set of assignments accepted by P co...
ICDM
2008
IEEE
14 years 3 months ago
2008
IEEE
Order-preserving submatrices (OPSM’s) have been shown useful in capturing concurrent patterns in data when the relative magnitudes of data items are more important than their ab...