318 search results - page 13 / 64 » Decomposition of Domains |
94
Voted
IAT
2006
IEEE
15 years 4 months ago
2006
IEEE
In this paper, we propose a novel approach to solving the distributed constraint optimisation problem (DCOP) that guarantees completeness, while having linear communication comple...
IPPS
2003
IEEE
15 years 3 months ago
2003
IEEE
In this paper, we discuss a parallel tabu search algorithm with implementation in a heterogeneous environment. Two parallelization strategies are integrated: functional decomposit...
CSCLP
2005
Springer
15 years 3 months ago
2005
Springer
We give an efficiently executable specification of the global constraint of lexicographic order in the Constraint Handling Rules (CHR) language. In contrast to previous approaches...
GRAPHICSINTERFACE
2001
14 years 11 months ago
2001
Digital watermarking embeds a structure called watermark into the target data, such as image and 3D polygonal models. The watermark can be used, for example, to enforce copyright ...
AIPS
1994
14 years 11 months ago
1994
An intelligent problem solver must be able to decompose a complex problem into simpler parts. A decomposition algorithm would not only be bene cial for traditional subgoal-oriente...