Project Detail

Hi, Please see your PM. Best Regards, Yousef

-- Perform action on this bid -- Spam or advertising in bid Fake bid Obscenities in bid

Ready to do please check reference work.

-- Perform action on this bid -- Spam or advertising in bid Fake bid Obscenities in bid

Hello - Please see PMB for details of my bid. - Thank you.

-- Perform action on this bid -- Spam or advertising in bid Fake bid Obscenities in bid

I would try an iterative positionning by simulating physical forces. imagine each link is a wire or a string. the longer the link is, the higher would be the strength. this constraint is not enough of course, there should be an opposite repulsive force to avoid every nodes to collapse in the center. to guarantee a minimal spacing, I would apply the equivalent of an electrical charge to each node to make them push each over. During thousands of cycles, positions would arrange themselves. when it stops moving, the optimal has been found. for example, if 3 projects are linked to a fourth one. they will arrange themselves to form 120 degrees sectors because that would give an equal distance, so equal forces... When I was a beginner, I did that in 3D to find an optimal geodesical volume. Of course, if you have more than 100 nodes, computing time increases a lot. I had also to deal with foatting point truncation errors. And I made a few exceptions to the free moving rule : one node must be fixed to avoid the hole figure to shift because of truncation errors. Another node (the farest one) must be bound to a line crossing the center to avoid the hole thing to rotate for the same reasons.

-- Perform action on this bid -- Spam or advertising in bid Fake bid Obscenities in bid

Wecan provide you with exactly what you are looking for. Best Regards Mike

-- Perform action on this bid -- Spam or advertising in bid Fake bid Obscenities in bid

I can do it. Math is my major. Have a similar program for graph visualization

-- Perform action on this bid -- Spam or advertising in bid Fake bid Obscenities in bid

BizSol is providing e-commerce, e-marketing, e-business, MobileCommerce, VoIP, P2P, Mobile Games, Mobile Software Development and ERP solutions. We focus on empowering your business by introducing a business-driven approach to development. It is our commitment to provide real time, cutting edge business solutions, and have long-term business relations by delighting all those who are touched by our services. Our dedicated professionals are always ready to serve our valuable clients. Regards BizSol Team

-- Perform action on this bid -- Spam or advertising in bid Fake bid Obscenities in bid

i would deliver within the stipulated time

-- Perform action on this bid -- Spam or advertising in bid Fake bid Obscenities in bid

I'll do it.

-- Perform action on this bid -- Spam or advertising in bid Fake bid Obscenities in bid

Hi: You CANNOT simultaneously minimize the number of lines crossing each other as well as the overall length of all lines combined. As I pointed out in your previous post of the same problem, the problem is very close to the minimum crossing number problem in graph theory. You need someone who understands discrete math and algorithm formulation specifically for the class called NP Complete combinatorial optimization problems, to advise you on problem formulation and to design your algorithm. If the algorithm is designed correctly, coding it is child's play. I would be happy to help you with this project. I would be able to contribute in terms of building the algorithm and reviewing the algorithm implementation code (I am a capable programmer too). My bid is for providing the algorithm and reviewing the implementation code in detail. I have a PhD in Combinatorial Optimization and a published paper in the journal "Mathematical Programming" which is considered the #1 journal in discrete math; that should be sufficient to prove my credentials in discrete math. Thank you! -Ram

-- Perform action on this bid -- Spam or advertising in bid Fake bid Obscenities in bid

Hey, if you can't find someone that can help you on this, I would be willing to take a crack at it. I don't have a degree but I have independently read stephen hawking, einstein, and looked over their formulas. I have a very outside view of things and perhaps could have a fresh perspective to troubleshoot. If I can tell immediately that it is out of my league, I'd let you know as soon as I review the project. I won't lead you on.

-- Perform action on this bid -- Spam or advertising in bid Fake bid Obscenities in bid

I could help to you, I did some simulators (about graph teory, NP Complete and routes). I know about VBScript and XML. The last simultator I did, was one to optimize paths, It was done in VB. Regards. Josue Rojas

-- Perform action on this bid -- Spam or advertising in bid Fake bid Obscenities in bid

Hi! I can do this project for you! i have large experience in this domain! For details and samples of my work please contact me by PM and we'll discuss time and best ways to perform your project! Have a nice day.

-- Perform action on this bid -- Spam or advertising in bid Fake bid Obscenities in bid