191 search results - page 27 / 39 » Reformulating Constraint Satisfaction Problems to Improve Sc... |
AI
2000
Springer
13 years 7 months ago
2000
Springer
GENET is a heuristic repair algorithm which demonstrates impressive e ciency in solving some large-scale and hard instances of constraint satisfaction problems (CSPs). In this pap...
SIGMOD
2005
ACM
14 years 8 months ago
2005
ACM
Data integrated from multiple sources may contain inconsistencies that violate integrity constraints. The constraint repair problem attempts to find "low cost" changes t...
BMCBI
2006
13 years 8 months ago
2006
Background: Structure matching plays an important part in understanding the functional role of biological structures. Bioinformatics assists in this effort by reformulating this p...
TMC
2002
13 years 7 months ago
2002
This paper proposes a scheme of optimal resource management for reverse-link transmissions in multimedia wideband code-division multiple-access (WCDMA) communications. It is to gua...
ICCV
2009
IEEE
15 years 26 days ago
2009
IEEE
Clustering performance can often be greatly improved by
leveraging side information. In this paper, we consider constrained
clustering with pairwise constraints, which specify
s...