1480 search results - page 164 / 296 » Ants can solve constraint satisfaction problems |
178
click to vote
IJIIDS
2010
15 years 5 months ago
2010
With the advent of XML as a data representation and exchange format over the web, a massive amount of data is being stored in XML. The task of data transformation for integration ...
137
click to vote
TALG
2010
15 years 4 months ago
2010
Fractional hypertree width is a hypergraph measure similar to tree width and hypertree width. Its algorithmic importance comes from the fact that, as shown in previous work [14], ...
195
click to vote
LATIN
2010
Springer
15 years 5 months ago
2010
Springer
A predicate P : {−1, 1}k → {0, 1} can be associated with a constraint satisfaction problem Max CSP(P). P is called “approximation resistant” if Max CSP(P) cannot be approxi...
143
click to vote
ICIP
2002
IEEE
16 years 8 months ago
2002
IEEE
In this paper, we present a novel PDE based error concealment algorithm. We formulate the error concealment problem as a sequential optimization problem with both smoothing and or...
181
click to vote
KBSE
2007
IEEE
16 years 24 days ago
2007
IEEE
Monitoring the satisfaction of software requirements and diagnosing what went wrong in case of failure is a hard problem that has received little attention in the Software and Req...