180 search results - page 32 / 36 » Complexity of Homogeneous Co-Boolean Constraint Satisfaction... |
DOCENG
2006
ACM
14 years 1 months ago
2006
ACM
For most users, authoring multimedia documents remains a complex task. One solution to deal with this problem is to provide template-based authoring tools but with the drawback of...
AAAI
2004
13 years 9 months ago
2004
Algorithms based on following local gradient information are surprisingly effective for certain classes of constraint satisfaction problems. Unfortunately, previous local search a...
LATIN
2010
Springer
13 years 6 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...
STOC
2009
ACM
14 years 8 months ago
2009
ACM
The quantum analog of a constraint satisfaction problem is a sum of local Hamiltonians - each (term of the) Hamiltonian specifies a local constraint whose violation contributes to...
GECCO
2008
Springer
13 years 8 months ago
2008
Springer
The process of creating e-learning contents using reusable learning objects (LOs) can be broken down in two sub-processes: LOs finding and LO sequencing. Sequencing is usually per...