2100 search results - page 64 / 420 » Fundamentals of the problem |
CP
2007
Springer
14 years 2 months ago
2007
Springer
Abstract. Computing the minimal network (or minimal CSP) representation of a given set of constraints over the Point Algebra (PA) is a fundamental reasoning problem. In this paper ...
ICIS
2000
13 years 11 months ago
2000
As the basis of value creation increasingly depends on the leverage of the intangible assets of firms, Knowledge Management Systems (KMS) are emerging as powerful sources of compe...
IGPL
2006
13 years 10 months ago
2006
Abstract. k-SAT is a fundamental constraint satisfaction problem. It involves S(m), the satisfaction set of the conjunction of m clauses, each clause a disjunction of k literals. T...
CORR
2011
Springer
13 years 5 months ago
2011
Springer
In Combinatorial Public Projects, there is a set of projects that may be undertaken, and a set of selfinterested players with a stake in the set of projects chosen. A public plann...
CP
2009
Springer
14 years 1 months ago
2009
Springer
Abstract. This paper considers the automatic generation of architectural tests (ATGP), a fundamental problem in processor validation. ATGPs are complex conditional constraint satis...