Hypercube php jobs

Filter

My recent searches
Filter by:
Budget
to
to
to
Skills
Languages
    Job State
    27 hypercube php jobs found, pricing in USD

    Looking for an experienced python programmer to create structed P2P system that is organized as a ‘n’-dimensional hypercube. You will do experiments to see how many dimensions the virtual machine can support. Each node will be simulated with a thread. Thus, you will create threads with different binary identifiers as necessary.

    $323 (Avg Bid)
    Urgent
    $323 Avg Bid
    4 bids

    ...the code creates an animation of a spinning hypercube. The animation should be similar to the one shown in the attachment file. The hypercube is shown as vertices connected by lines. In the animation, the inner cube will increase and decrease in size (scaling) as the whole structure spins. The hypercube appears to rotate around a circular path, you

    $124 (Avg Bid)
    $124 Avg Bid
    23 bids
    Trophy icon polish 4 graphs Ended

    ...according to cloud . place word Mobile and Web under icons . actuators one line going to it, line grouping them . benefits cloud, groupd with line, DOTTED line going to it . hypercube, make cube color reference, ok shades, make hyper white logo, bottome cube . actuators, color, same as reference colors Graph 3 [url removed, login to view]

    $76 (Avg Bid)
    Guaranteed
    $76 Avg Bid
    1 entries

    ...points as black dots. Calculate the approximation error for each N using a separate set of 100 test points generated using Latin hypercube sampling(see more info in file exercise). I have a function for the Latin hypercube sampling, but it needs to be altered to fit this project. Try to make the code in functions with one small script to run the functions

    $58 (Avg Bid)
    $58 Avg Bid
    2 bids

    $370 (Avg Bid)
    $370 Avg Bid
    0 entries

    ...problems 1. Sorting: Bitonic sort, hyperquick sort, sorting by regular sampling, bucket and sample sort 2. Fast Fourier Transform: hypercube topology 3. Solving Linear Systems: Row oriented Gaussian elimination on hypercube topology, Jacobi algorithm, Gauss Seidel algorithm, Conjugate gradient. 4. Shortest Paths in a Graph 5. Traveling Sales Person 6

    $166 (Avg Bid)
    $166 Avg Bid
    7 bids

    ...problems 1. Sorting: Bitonic sort, hyperquick sort, sorting by regular sampling, bucket and sample sort 2. Fast Fourier Transform: hypercube topology 3. Solving Linear Systems: Row oriented Gaussian elimination on hypercube topology, Jacobi algorithm, Gauss Seidel algorithm, Conjugate gradient. 4. Shortest Paths in a Graph 5. Traveling Sales Person 6

    $150 (Avg Bid)
    $150 Avg Bid
    1 bids

    ...problems 1. Sorting: Bitonic sort, hyperquick sort, sorting by regular sampling, bucket and sample sort 2. Fast Fourier Transform: hypercube topology 3. Solving Linear Systems: Row oriented Gaussian elimination on hypercube topology, Jacobi algorithm, Gauss Seidel algorithm, Conjugate gradient. 4. Shortest Paths in a Graph 5. Traveling Sales Person 6

    $181 (Avg Bid)
    $181 Avg Bid
    6 bids

    ...problems 1. Sorting: Bitonic sort, hyperquick sort, sorting by regular sampling, bucket and sample sort 2. Fast Fourier Transform: hypercube topology 3. Solving Linear Systems: Row oriented Gaussian elimination on hypercube topology, Jacobi algorithm, Gauss Seidel algorithm, Conjugate gradient. 4. Shortest Paths in a Graph 5. Traveling Sales Person

    $110 (Avg Bid)
    $110 Avg Bid
    5 bids

    I need a visual application that simulates the following algorithms: 1) Fault tolerant routing algorithm in hypercube. It is described in detail in the attached pdf. 2) Algorithm for finding k shortest disjoint path-pair between nodes in regular graphs( see attached doc ). It can be any topology, a random topology Use OpenGl to draw the graphs:

    $476 (Avg Bid)
    $476 Avg Bid
    3 bids

    I need a visual application that simulates the following algorithms: 1) Fault tolerant routing algorithm in hypercube. It is described in detail in the attached pdf. 2) Algorithm for finding k shortest disjoint path-pair between nodes in regular graphs( see attached doc ). It can be any topology, a random topology Use OpenGl to draw the graphs:

    $30 - $250
    $30 - $250
    0 bids

    I need a visual application that simulates the following algorithms: 1) Fault tolerant routing algorithm in hypercube. It is described in detail in the attached pdf. 2) Algorithm for finding k shortest disjoint path-pair between nodes in regular graphs( see attached doc ). It can be any topology, a random topology Use OpenGl to draw the graphs:

    $30 - $250
    $30 - $250
    0 bids

    I need a visual application that simulates the following algorithms: 1) Fault tolerant routing algorithm in hypercube. It is described in detail in the following pdf. 2) Fault tolerant routing algorithm in crossed cube. Described in pdf. 3) Algorithm for finding k shortest disjoint path-pair between nodes in regular graphs. It can be any

    $272 (Avg Bid)
    $272 Avg Bid
    3 bids

    I need a visual application that simulates the following algorithms: 1) Fault tolerant routing algorithm in hypercube. It is described in detail in the following pdf. 2) Fault tolerant routing algorithm in crossed cube. Described in pdf. 3) Algorithm for finding k shortest disjoint path-pair between nodes in regular graphs. It can be any

    $253 (Avg Bid)
    $253 Avg Bid
    6 bids

    ...neighboring blocks 3 - Powerup row explosion: destroys the blocks of the selected row 4 - Powerup column explosion: destroys the blocks of the selected column 5 - Powerup hypercube: destroys all blocks of the selected color 6 - Powerup row plus explosion: destroys the blocks of the selected row and column 7 - Powerup bombing: destroys 6 sets of 5 random

    $170 (Avg Bid)
    $170 Avg Bid
    2 bids

    ...a simulation of this project. Please use the following Run Preferences: 2000 Trials, Use Same Sequence of Random Numbers with an Initial Seed Value of 999, and the Latin Hypercube Sampling Method with a Sample Size of 500. Use the Set Cell Value to Distribution Mean option under Cell Preferences. Also, be sure to clearly indicate which cells are assumption

    $242 (Avg Bid)
    $242 Avg Bid
    5 bids

    Latin Hypercube Sampling - Orthogonal Set up a simple example of LHS Orthogonal sampling. Consider X1, X2 as normally distributed. Y = F(X1,X2) Provide the code in Visual Basic or C#. ## Deliverables 1) Complete and fully-functional working program(s) in executable form as well as complete source code of all work done. 2) Deliverables must be

    $17 (Avg Bid)
    $17 Avg Bid
    1 bids

    ...designer are required, this is not a task for amateurs. 1. First image is the cube with a network on it: (check attaches document) Change the Cube picture. Keep, the hypercube concept, but instead of the small cube in the middle, create a sphere inside the cube. Inside the sphere in the middle, put the concept map related together with links

    $20 (Avg Bid)
    $20 Avg Bid
    1 bids

    ...speedup factor / number of processors. 8. Cross product of an array’s extent determines its: a. density. b. range. c. shape. d. rank. 9. Embedding chain topology in a hypercube involves the use of: a. gray code ordering. [url removed, login to view] algorithm. c. dynamic programming. d. branch and bound search. 10. The FORTRAN‑90 data parallel construct dp_locate

    $7 - $12
    $7 - $12
    0 bids