20197 search results - page 3455 / 4040 » Comparing Computational Power |
154
Voted
CP
2007
Springer
16 years 19 days ago
2007
Springer
Shaving and constructive disjunction are two main refutation principles used in constraint programming. The shaving principle allows us to compute the singleton arc-consistency (SA...
177
click to vote
CPAIOR
2007
Springer
16 years 19 days ago
2007
Springer
A linear pseudo-Boolean constraint (LPB) is an expression of the form a1 · 1 + . . . + am · m ≥ d, where each i is a literal (it assumes the value 1 or 0 depending on whether a...
155
click to vote
DAGM
2007
Springer
16 years 19 days ago
2007
Springer
Abstract. Model-based image interpretation extracts high-level information from images using a priori knowledge about the object of interest. The computational challenge is to dete...
165
click to vote
DAWAK
2007
Springer
16 years 19 days ago
2007
Springer
Representative-based clustering algorithms are quite popular due to their relative high speed and because of their sound theoretical foundation. On the other hand, the clusters the...
168
click to vote
DCOSS
2007
Springer
16 years 19 days ago
2007
Springer
Macroprogramming—the technique of specifying the behavior of the system, as opposed to the constituent nodes—provides application developers with high level abstractions that a...