Đã hoàn thành

Prolog:Constraint Programming Graph Partition

The task is to solve a problem with Constraint Programming. The problem is to take a given graph as input with n nodes and it must be divided into two subgraphs with plenty of nodes equal(e.g n/2 each one) or difference by 1 node if needed. Furthermore, The purpose is to find optimal partition, more specific the number of edges between each partition must be minimized. I want this to be made in Prolog with one of the following tools you can choose (ECLiPSe,GNU Prolog,SWI Prolog).

Kĩ năng: Prolog

Xem nhiều hơn: write a report on the book you have read recently based on the results of task 1 and 2, programming ruby 1.9 & 2.0, eclipse uml2 tools download, constraint programming, excel complete task available resources choose data close, always unique spanning tree given graph, true false always unique spanning tree given graph, prolog game programming, iphone graph programming, graph coloring java programming, oracle eclipse constraint logic programming, interface swi prolog matlab, open http connection swi prolog, solving graph coloring problem using genetic programming code, outsource programming task, simple programming task java, freelance programming task, php task programming, graph partition genetic algorithm java, calculate salary application using prolog programming, fun programming task, bid prolog projects programming, programming task, concept prolog programming langouage, flash graph script programming

Về Bên Thuê:
( 6 nhận xét ) Athina, Greece

ID dự án: #16059156

Được trao cho:

ahmsak

Hello Sir, I am a computer science tutor, I teach (among others) Prolog, Scheme, LISP, Haskell, and Algorithms. I would prefer to work with SWI-Prolog, Sir. I have done many projects like this, and I'm one of the to Thêm

€90 EUR trong 3 ngày
(86 Đánh Giá)
6.1

9 freelancer đang chào giá trung bình €87 cho công việc này

€100 EUR trong 3 ngày
(18 Nhận xét)
3.7
milossimicms

Hi! I have more than four years of experience with Prolog and have, over the years, written a lot of Prolog programs and completed a lot of Prolog projects on this site. I would like to solve this problem for you a Thêm

€122 EUR trong 2 ngày
(4 Nhận xét)
3.7
€102 EUR trong 3 ngày
(3 Nhận xét)
2.6
ulisesrdom

I can have this for you stated as a constraint satisfaction problem, solved with an heuristic approach.

€48 EUR trong 3 ngày
(1 Nhận xét)
2.4
carneireiro

I have some experience in prolog projects. To solve this graph partitioning problem in prolog, when performance is not a requirement, is not a difficult task.

€50 EUR trong 1 ngày
(2 Nhận xét)
1.3
BeshoyMousaKhair

........................................................................................................................................

€120 EUR trong 3 ngày
(1 Nhận xét)
0.6
liveexperts123

Hi i can do this perfectly please inbox me for further details Thanks ................................................

€55 EUR trong 3 ngày
(0 Nhận xét)
0.0
€100 EUR trong 7 ngày
(0 Nhận xét)
0.0