Find link

language:

Find link is a tool written by Edward Betts.

Longer titles found: Weighted constraint satisfaction problem (view)

searching for Constraint satisfaction problem 11 found (68 total)

alternate case: constraint satisfaction problem

Interval propagation (885 words) [view diff] exact match in snippet view article find links to article

Interval propagation considers an estimation problem as a constraint satisfaction problem. A contractor associated to an equation involving the variables

Max/min CSP/Ones classification theorems (1,062 words) [view diff] exact match in snippet view article find links to article

a problem defined by S. Given a set S of clauses, the Max constraint satisfaction problem (CSP) is to find the maximum number (in the weighted case:

Antoon Kolen (478 words) [view diff] exact match in snippet view article find links to article

MCA, Stan P.M. Van Hoesel, and Antoon WJ Kolen. "The partial constraint satisfaction problem: Facets and lifting theorems." Operations research letters

Martin Dyer (392 words) [view diff] case mismatch in snippet view article find links to article

Prize for the paper "An Effective Dichotomy for the Counting Constraint Satisfaction Problem." SIAM J. Computing. 42(3): 1245-1274 (2013) (Jointly with

Patrick Prosser (351 words) [view diff] case mismatch in snippet view article find links to article

Youtube. Prosser, Patrick (1993). "Hybrid Algorithms for the Constraint Satisfaction Problem". Computational Intelligence. 9 (3): 268–299. doi:10.1111/j

Georg Gottlob (1,048 words) [view diff] exact match in snippet view article find links to article

conjunctive queries on relational databases is equivalent to the constraint satisfaction problem. His recent work on XML query languages (notably XPath) has

Competitions and prizes in artificial intelligence (2,218 words) [view diff] exact match in snippet view article find links to article

challenges".[citation needed] The Eternity II challenge was a constraint satisfaction problem very similar to the Tetravex game. The objective is to lay

Tree decomposition (1,537 words) [view diff] exact match in snippet view article find links to article

Decomposition is used in Decomposition Method for solving constraint satisfaction problem. Gottlob et al. (2012). Diestel (2005) pp.354–355 Diestel (2005)

Paul Thagard (1,458 words) [view diff] exact match in snippet view article find links to article

particular formalization of the concept of coherence as a constraint satisfaction problem. The model posits that coherence operates over a set of representational

Aztec diamond (1,770 words) [view diff] exact match in snippet view article find links to article

the task of tiling the Aztec diamond may be reduced to a constraint satisfaction problem formulated as a binary integer program: min ∑ 1 ≤ i ≤ m 0 ⋅

Computational hardness assumption (3,303 words) [view diff] exact match in snippet view article find links to article

exponential time hypothesis. The unique label cover problem is a constraint satisfaction problem, where each constraint C {\displaystyle C} involves two variables