1453 search results - page 188 / 291 » Partial Constraint Satisfaction |
144
click to vote
JCIT
2008
15 years 4 months ago
2008
Commercial search engines, especially meta-search engines was designed to retrieve the information by submitting users' queries to multiple conventional search engines and in...
144
click to vote
EDBT
2004
ACM
16 years 4 months ago
2004
ACM
The join operation, which combines tuples from multiple relations, is the most fundamental and, typically, the most expensive operation in database queries. The standard approach t...
130
click to vote
GECCO
2004
Springer
15 years 10 months ago
2004
Springer
We discuss the computational complexity of random 2D Ising spin glasses, which represent an interesting class of constraint satisfaction problems for black box optimization. Two ex...
162
click to vote
AI
2010
Springer
15 years 4 months ago
2010
Springer
The Valued Constraint Satisfaction Problem (VCSP) is a generic optimization problem defined by a network of local cost functions defined over discrete variables. It has applicatio...
149
click to vote
LATIN
2010
Springer
15 years 3 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...