![]() ![]() |
Home |
How it works |
Projects archive |
Contact Us Air Compressor Bot |
|
| The Career Path of Freelance Programming Jobs |
Mozart/Oz Search Strategy |
![]() |
Bidding Time: |
17/10/2006 22:51 - 21/11/2006 00:00 |
Budget: |
$30-100 |
Status: |
Closed |
|
|
|
Job Type: |
|
Description: |
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... Related Projects: This project is the proprietary information of .
Click here to remove this project from OUR database.
|
Operating System: |
(None) |
Database System: |
(None) |
| <<< back |
|
| Home | Projects archive | RSS | Resources | Links | Contact Us | © 2004-2008 ProjectsList.biz /5.946 |