Ditutup

Mozart/Oz Search Strategy

hi this is Alexander Burias...i have a problem translating this algorithm in Mozart/Oz using computational spaces...if anybody can help i would gladly pay if anyone can implement the project...this is really URGENT...

ALGORITHM...

function ac3(X, D, R1, R2)

// Initial domains are made consistent with unary constraints.

for each x in X

D(x) := { x in D(x) | R1(x) }

// 'worklist' contains all arcs we wish to prove consistent or not.

worklist := { (x, y) | there exists a relation R2(x,y) or a relation R2(y,x) }

do

select any arc (x, y) from worklist

worklist := worklist - (x, y)

if arc-reduce(x, y)

if D(x) is empty

return failure

else

worklist := worklist + { (z, x) | z != y }

while worklist not empty

function arc-reduce(x, y)

bool change = false

for each vx in D(x)

find a value vy in D(y) such that vx and vy satisfy the constraint R2(x,y)

if there is no such vy {

D(x) := D(x) - vx

change := true

}

return change

its an arc consisteny algorithm...AC3...

Kemahiran:

Lihat lebih lanjut: web development mozart, search we, search d, computational algorithm, algorithm function, mozart, search ozmozart, vx, relation, r2, oz, computational, bool, arc in, daos, algorithm search, algorithm find, function search, empty, change strategy, arc algorithm, anyone can, reduce, search project, prove

Tentang Majikan:
( 0 ulasan ) Iligan City, Philippines

ID Projek: #98597

1 pekerja bebas membida secara purata $30 untuk pekerjaan ini

InfotechUK

Please note this bid is only an expression of our interest in your project. We may come back to you for more information, through personal message. We will place a more realistic bid and time of completion within 2-3 d Lagi

$30 USD dalam 7 hari
(0 Ulasan)
0.0