<span class="searchmatch">constraint</span> <span class="searchmatch">satisfaction</span> <span class="searchmatch">problem</span> (tsz. <span class="searchmatch">constraint</span> <span class="searchmatch">satisfaction</span> problems) (informatika) A <span class="searchmatch">Constraint</span> <span class="searchmatch">Satisfaction</span> <span class="searchmatch">Problem</span> (röviden: CSP, magyarul: korlátozásos...
target A <span class="searchmatch">constraint</span> propagation segít a tartományok leszűkítésében, hasonlóan mint a <span class="searchmatch">constraint</span> programming rendszerekben. A Kakuro CSP (<span class="searchmatch">Constraint</span> Satisfaction...
[LpVariable(f"x{i}", cat="Binary") for i in range(len(values))] prob = Lp<span class="searchmatch">Problem</span>("Knapsack", LpMaximize) prob += lpSum(x[i]*values[i] for i in range(len(x)))...
Keresési algoritmusok: DFS, BFS, A*, IDA* Heurisztikus keresés <span class="searchmatch">Constraint</span> <span class="searchmatch">satisfaction</span> problems (CSP) Propozicionális logika, elsőrendű logika Tudásbázis...
(or constraint networks), directing allowable solutions (uses <span class="searchmatch">constraint</span> <span class="searchmatch">satisfaction</span> or simplex algorithm) dataflow programming – forced recalculation...
szimuláció-alapú optimalizálás from pulp import * # Probléma definiálása prob = Lp<span class="searchmatch">Problem</span>("Simple LP", LpMaximize) x = LpVariable("x", lowBound=0) y = LpVariable("y"...
(continued) 7.2.2. backtrack programming (continued) 7.2.2.3. <span class="searchmatch">constraint</span> <span class="searchmatch">satisfaction</span> (released as pre-fascicle 7a) 7.2.2.4. hamiltonian paths and cycles...