391 search results - page 48 / 79 » Locally Consistent Constraint Satisfaction Problems with Bin... |
ASPDAC
2005
ACM
13 years 9 months ago
2005
ACM
-- This paper presents a novel global routing algorithm, AT-PO-GR, to minimize the routing area under both congestion, timing, and RLC crosstalk constraints. The proposed algorithm...
AAAI
2004
13 years 9 months ago
2004
We present an efficient approach to adding soft constraints, in the form of preferences, to Disjunctive Temporal Problems (DTPs) and their subclass Temporal Constraint Satisfactio...
GLOBE
2008
Springer
13 years 8 months ago
2008
Springer
This paper addresses the problem of data integration in a P2P environment, where each peer stores schema of its local data, mappings between the schemas, and some schema constraint...
ICTAI
2009
IEEE
13 years 5 months ago
2009
IEEE
We address the problem of merging qualitative constraints networks (QCNs). We point out a merging algorithm which computes a consistent QCN representing a global view of the input...
ECAI
2000
Springer
14 years 9 hour ago
2000
Springer
Abstract. In constraint networks, the efficiency of a search algorithm is strongly related to the local consistency maintained during search. For a long time, it has been consider...