146 search results - page 3 / 30 » Consistency Techniques for Numeric CSPs |
CP
2001
Springer
13 years 11 months ago
2001
Springer
Non-binary constraint satisfaction problems (CSPs) can be solved in two different ways. We can either translate the problem into an equivalent binary one and solve it using well-e...
SETN
2004
Springer
13 years 12 months ago
2004
Springer
Abstract. In order to obtain a solution to a constraint satisfaction problem, constructive methods iteratively extend a consistent partial assignment until all problem variables ar...
CONSTRAINTS
1998
13 years 6 months ago
1998
Many temporal applications like planning and scheduling can be viewed as special cases of the numeric and symbolic temporal constraint satisfaction problem. Thus we have developed ...
ICASSP
2011
IEEE
12 years 10 months ago
2011
IEEE
In this paper we first introduce four kinds of modification of Symmetric Scoring [1] which produce likelihood ratios that do not need to be explicitly normalized, i.e. T-norm, Z...
CIKM
2010
Springer
13 years 4 months ago
2010
Springer
We describe efficient techniques for construction of large term co-occurrence graphs, and investigate an application to the discovery of numerous fine-grained (specific) topics. A...