# Bfs ucs jobs

### Filter

to
to
to
##### Job State
615 bfs ucs jobs found, pricing in USD
BFS algorithm expert needed 5 days left
VERIFIED

I need a BFS algortith to complete me a simple project

\$29 (Avg Bid)
\$29 Avg Bid
17 bids

I need help with copy writers in the below mentions topics, search, graph, FSM data-goal driven, BT algorithm BFS (breadth first search) DFS (depth first search) and-or-graph Expert Systems ES, architecture, guidelines, conceptual model rule based ES heuristics hill-climbing DP BFS (best first search) Probabilistic reasoning Uncertainty in AI Probabilistic reasoning VE and AR slides - Machine Learning - Symbol-Based Machine Learning Introduction Version space search Decision tree and ID3

\$329 (Avg Bid)
\$329 Avg Bid
22 bids

I need help with artificial intelligence in the below mentions topics, search, graph, FSM data-goal driven, BT algorithm BFS (breadth first search) DFS (depth first search) and-or-graph Expert Systems ES, architecture, guidelines, conceptual model rule based ES heuristics hill-climbing DP BFS (best first search) Probabilistic reasoning Uncertainty in AI Probabilistic reasoning VE and AR slides - Machine Learning - Symbol-Based Machine Learning Introduction Version space search Decision tree and ID3

\$600 (Avg Bid)
\$600 Avg Bid
16 bids

Using Java implement the Breadth-First Search (BFS) algorithm: BFS(s): Set Discovered[s] = true and Discovered[v] = false for all other v Initialize L[0] to consist of the single element s Set the layer counter i = 0 Set the current BFS tree T = ∅ While L[i] is not empty Initialize an empty list L[i + 1] For each node u ∈ L[i] Consider each edge (u, v) incident to u If Discovered[v] = false then Set Discovered[v] = true Add edge (u, v) to the tree T Add v to the list L[i + 1] Endif Endfor Increment the layer counter i by one Endwhile In your implementation, use adjacency list to ensure O(m+n) space for representing graphs. Also, ensure to have a O(m + n) running time as you implement the BFS(s) function. your code should have the following three f...

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

as title says, I need someone who is able to quickly solve algorithm problems especially those relating to topics like red black trees, greedy algorithms, elementary graph algorithms, bfs, dfs, topological sort, etc. No coding is involved and I can post a sample of what the problems are like. Pls message if you are able to do these types of problems. Also, the project will be time sensitive(1 hour total) pls message for further details .

\$19 (Avg Bid)
\$19 Avg Bid
2 bids

-JAVA CODERS -making graphs graphs expert -dfs/bfs -NO ADTS URGENT PROGRAMMERS REQUIRED

\$101 (Avg Bid)
\$101 Avg Bid
16 bids

mining methods for 3 types of ore Deposit 1 A massive porphyry style deposit located at high altitude in West Papua. Average grade of the deposit is 0.5g/t Au and 0.8% Cu. The deposit has a UCS of 200MPa and is highly fractured; country rock is similar in nature. The deposit has a large foot print area 200m by 400m and is located 300m from surface and open at depth. Deposit 2 A seam like deposit of gypsum, ranging in thickness from 2.5 to 3.5 m. the total area of the deposit is 10km2. It outcrops at surface at the northern end of the mine lease and dips in a southerly direction at 3°. The floor strata is a mudstone and the roof consists of a well consolidated sandstone. Deposit 3 A coal seam 2.5 m thick, located 1000m underground. Dip is about 2°. The mining lease is l...

\$30 (Avg Bid)
\$30 Avg Bid
2 bids

Solving N queen problem using (IDS, BFS, A* )algorithm Using java

\$31 (Avg Bid)
\$31 Avg Bid
9 bids

...stands for an exit (finish node). (2) Letters are rooms; "-" stands for walls; "*" means corners; " " shows tunnels. Program Requirements [30% points] Input files: The three input mazes files (, , and ) are listed on Canvas: Canvas --> Files-->project1_maze Two Algorithms Usually, two graph search algorithms, Depth-First Search (DFS) and Breadth-First Search (BFS), are broadly utilized to solve mazes. You also need to use STACK and Queue. Output results: Your program implements algorithms, and the output files should be *. txt files. For example, if your input file is "", your output files are "" and "" In output files, your results clearly show a step-by-step travel map. Demo and Presentation

\$139 (Avg Bid)
\$139 Avg Bid
12 bids

which path returns the DFS ALGORITH/BFS/UCS

\$15 (Avg Bid)
\$15 Avg Bid
4 bids

One competition in the TT is to get out of a labyrinth as quickly as possible. Your task as the tournament supervisor is: given the labyrinth map, initial positions of the three competing wizards and their speeds (in corridors per minute) predict which of them will reach the exit first. Assume that the magical wands used in the play are capable of guiding the wizards to the exit along the shortest possible path.

\$26 (Avg Bid)
\$26 Avg Bid
7 bids

I need someone who can manage Prolog programming (also related to AI). Prolog Topics are: recursion cut backtracking lists (member, reverse, append) graphs tree CLP(FD) library STRIPS in prolog minimax algorithm DFS algorithm BFS algorithm greedy search algorithm A / A* algorithm

\$27 / hr (Avg Bid)
\$27 / hr Avg Bid
18 bids

Basically all i want is to implement the water jug problem using bfs algorithm and add a gui for it using tiknter

\$33 (Avg Bid)
\$33 Avg Bid
11 bids

Artificial Intelligence The DragonGame AI Environment

\$8 - \$20
\$8 - \$20
0 bids

I'm a small business startup and new a website built for a client presentation. I have the content and images in w website design outline but need someone to build me a website in the next 3-5 days. The outline lays out the desired pages and associated content. Here is an example website of what I'm looking for

\$175 (Avg Bid)
\$175 Avg Bid
44 bids

I have 10 assignment questions related to Cisco UCS Director. Individual must know how to configure self provisioning & self service catalog on Cisco UCS.

\$115 (Avg Bid)
\$115 Avg Bid
1 bids

Hello Kamlesh, Some months ago you created a Prestashop module for me to import csv file. Now I have another csv file and I´m trying to do a similar module but encode is UCS-2 LE instead of UTF-8 and i have lot of strange characters. Could you please help me to convert this data to correct encode? Regards,

\$23 (Avg Bid)
\$23 Avg Bid
1 bids

I have 13 questions regarding private cloud management. Its all related on how to use Cisco UCS Director.

\$14 (Avg Bid)
\$14 Avg Bid
5 bids
Logo for a new company Ended

We are looking for a new logo for our partner company UCS (United computer services and trading). The logo should only contain UCS highlighted hence we are not describing what the company actually does to avoid confusion. A sample of what we are looking for is attached.

\$6 (Avg Bid)
\$6
109 entries

You can connect me if you required ETL testing training. Just message me. Testing Skills: • ETL Testing / Big data testing (Hive , impala) • DB Testing / Data warehouse testing • Functional Testing. Domain Knowledge: • BFS ( Client : RBS & CITI Bank ) • Retail Domain ( Client : Hennes & Mauritz ) • Travel & Transport Domain ( Client : Japan Airlines ) Professional Summary: • Engineering Professional having about 9 Years of Software Testing /data analyst Experience. • Familiar with phases of Software Testing Life cycle. • Worked in different Levels of Testing (System Testing and User Acceptance testing and smoke testing, Retesting, Regression testing, End to End testi...

\$30 (Avg Bid)
\$30 Avg Bid
1 bids

Hi i need accountants details scraped from i want all UK accountant details inc name, address, email and contact number.

\$23 (Avg Bid)
\$23 Avg Bid
43 bids

the three competing wizards and their speeds the wizards to the exit along the shortest possible path. (bfs)

\$30 (Avg Bid)
\$30 Avg Bid
4 bids

first task: a naive (linear list) approach, string BBST, trie and a hash map comparison second task: three competing wizards, bfs maze third task: small problem for dfs

\$35 (Avg Bid)
\$35 Avg Bid
6 bids

This project is based on importing an image into python using very basic openCV. Then convert that image into a black and white image. This image acts as the grid where the black lines are walls and while areas are paths that the user can traverse. The user selects one point on the graph ,say point A and a...into python using very basic openCV. Then convert that image into a black and white image. This image acts as the grid where the black lines are walls and while areas are paths that the user can traverse. The user selects one point on the graph ,say point A and another point say point B. You have to design a path of travel from A to B and display it in the image. A sample code which implements BFS is attached in the files section For each algorithm you may earn INR 500 so tota...

\$16 (Avg Bid)
\$16 Avg Bid
2 bids

ello, I have a school project to be done in A.I: Using search Algorithms and Heuristics I need a routing algorithm using search techniques (e.g. BFS, DFS or A*) to provide COVID vaccine distribution system. - Similar to traveling salesman problem. python is to be used. and a report of 4000 words is to be written

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

Hello, We are looking for a freelancer who has experience or ready project to integrate the following in STM32 or similar chip. 1. MDB integration to monitor transactions and telemetry auditing; 2. EVA-DTS integration for telemetry auditing; 3. DEX integration for telemetry auditing; Please reply only if you have had experience developing this.

\$3143 (Avg Bid)
\$3143 Avg Bid
6 bids

Need someone who can draw Depth-first search, breadth-first search, uniform cost search diagrams etc based on very simple cases that will be provided. Budget and time fixed. Ideal if a person is available urgently.

\$23 (Avg Bid)
\$23 Avg Bid
4 bids

We have a Cisco UCS C220 Server of which the CIMC has got corrupt. We need help by someone who can help fix it so we can reload the Operating System. Alternatively help us load the drivers for the HDD so it can recognise and load the OS

\$18 (Avg Bid)
\$18 Avg Bid
4 bids

Need BFS maze and solver in 2 days. Solver uses multithreading

\$106 (Avg Bid)
\$106 Avg Bid
3 bids

Need of a Java Developer who is well versed with Dynamic Programming and knows Graphs (BFS, DFS) & other concepts well. Needed for a Coding challenge which requires use of Dynamic Programming and more. Will pay extra if needed.

\$30 (Avg Bid)
\$30 Avg Bid
1 bids

Need of a Java Developer who is well versed with Dynamic Programming and knows Graphs (BFS, DFS) & other concepts well. Need assistance for only one hour for a Coding challenge which might include Graph questions and more... Will pay extra if needed.

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

I have a coding challenge which requires use of Graph ( Bfs and Dfs) and I am really struggling with it. Can you please assist me with the challenge. If I get through (requires me to score more than 850 out of 1000), I'll pay you \$10 extra than the money I am paying now. Please help me as this is just for one hour and you'll be earning \$30.

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

I have a coding challenge which requires use of Graph ( Bfs and Dfs) and I am really struggling with it. Can you please help me as I am a student and I would really appreciate it. This is just one hour coding challenge and I'll pay you \$20 instantly and extra if required.

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

I have a coding challenge which requires use for Graphs (Dfs and Bfs) and I am really struggling with it. I am a student and I would appreciate if you could help me, please!

\$20 / hr (Avg Bid)
\$20 / hr Avg Bid
1 bids

we want game pacman by using breadth first search or depth first search just choses one of them, we just need i simple graph of game like simple maze and goul is just one dot so, the game is pacman go to the goul by use BFS or DFS Also, use java and write comment Note: - we want simple game not advanse

\$189 (Avg Bid)
\$189 Avg Bid
6 bids

Hi, I would like to build a solver for rush hour puzzle in Python. (puzzle) Basically we will give the solver an initial state and the solver will find the most efficient way to play the game. - BFS - Iterative Deepening - A* - Hill climbing Is that something you could do?

\$6 / hr (Avg Bid)
\$6 / hr Avg Bid
1 bids

I need to solve 8-puzzle problem by using BFS, DFS, UCS and A* search algorithms. There is a baseline code provided in the attachment. It is not allowed to change , and graph.py. My expectation is to write the code segments to the places mentioned as """Your code here""" for each search method (, , , ).

\$115 (Avg Bid)
\$115 Avg Bid
3 bids

for example transition matrix, bfs with gnn, etc...

\$81 (Avg Bid)
\$81 Avg Bid
3 bids

I have an algorithm problem that is need solved. I've uploaded the pdf with the problem. The solution should be in c#, good coding standard and should be optimized. This problem would use a BFS or DFS I believe.

\$30 (Avg Bid)
\$30 Avg Bid
2 bids

"Implement the following search algorithms for solving different mazes:Breadth-first search (BFS), Depth-first search (DFS), Greedy best-first search (GBFS), A* search

\$33 (Avg Bid)
\$33 Avg Bid
3 bids

JAVA Problem description: A group of K persons (K > 1) want to cross a bridge from East to West during the night. The persons that are crossing the bridge must use a flashlight. There is only one flashlight. The bridge is very narrow and allows two persons to cross ...flashlight. The bridge is very narrow and allows two persons to cross it at the same time at most. Two persons go from east to west and one person returns with the flashlight from west to east. If the two persons are crossing the bridge together, they are crossing it at the speed of the slower one. These people are trying to cross the bridge as quickly as possible. Use 3 search strategies (UCS (Uniform-cost search), IDS (Iterative deepening search) and A*) to find the best order for these persons to cross...

\$40 (Avg Bid)
\$40 Avg Bid
3 bids

Knowledge of BFS and Dijkstra's algorithm for finding shortest path in a weighted graph. Deliverable is one java file containing answers to a few questions. Files will be shared with interested freelancers, thanks

\$89 (Avg Bid)
\$89 Avg Bid
10 bids

...only one flashlight. The bridge is very narrow and allows two persons to cross it at the same time at most. Two persons go from east to west and one person returns with the flashlight from west to east. If the two persons are crossing the bridge together, they are crossing it at the speed of the slower one. These people are trying to cross the bridge as quickly as possible. Use 3 search strategies (UCS, IDS and A*) to find the best order for these persons to cross the bridge. Input file: 1) C, number of test cases 2) For each test case: a. K, number of people b. A list of K numbers, showing the time required by each person to pass to the other side. Output: Your program should printout the following information for each search strategy: 1) Sequence of trips taken by the group alo...

\$20 (Avg Bid)
\$20 Avg Bid
5 bids

Newsly installed UCS needs to be configured as per the best practice as per data centre updates,configuring system template for linux and windows OS.

\$19 / hr (Avg Bid)
\$19 / hr Avg Bid
7 bids

...only one flashlight. The bridge is very narrow and allows two persons to cross it at the same time at most. Two persons go from east to west and one person returns with the flashlight from west to east. If the two persons are crossing the bridge together, they are crossing it at the speed of the slower one. These people are trying to cross the bridge as quickly as possible. Use 3 search strategies (UCS, IDS and A*) to find the best order for these persons to cross the bridge. Input file: 1) C, number of test cases 2) For each test case: a. K, number of people b. A list of K numbers, showing the time required by each person to pass to the other side. Output: Your program should printout the following information for each search strategy: 1) Sequence of trips taken by the group alo...

\$20 - \$20
\$20 - \$20
0 bids

...only one flashlight. The bridge is very narrow and allows two persons to cross it at the same time at most. Two persons go from east to west and one person returns with the flashlight from west to east. If the two persons are crossing the bridge together, they are crossing it at the speed of the slower one. These people are trying to cross the bridge as quickly as possible. Use 3 search strategies (UCS, IDS and A*) to find the best order for these persons to cross the bridge. Input file: 1) C, number of test cases 2) For each test case: a. K, number of people b. A list of K numbers, showing the time required by each person to pass to the other side. Output: Your program should printout the following information for each search strategy: 1) Sequence of trips taken by the group alo...

\$23 (Avg Bid)
\$23 Avg Bid
4 bids

Problem description: A group of K persons (K > 1) want to cross a bridge from East to West during the night. The persons that are crossing the bridge must use a flashlight. There is only one flashlight. The bridge is very narrow and allows two persons to cross it at the same time at most. Two persons go from east to we...only one flashlight. The bridge is very narrow and allows two persons to cross it at the same time at most. Two persons go from east to west and one person returns with the flashlight from west to east. If the two persons are crossing the bridge together, they are crossing it at the speed of the slower one. These people are trying to cross the bridge as quickly as possible. Use 3 search strategies (UCS, IDS and A*) to find the best order for these persons to cros...

\$45 (Avg Bid)
\$45 Avg Bid
2 bids

...flashlight. The bridge is very narrow and allows two persons to cross it at the same time at most. Two persons go from east to west and one person returns with the flashlight from west to east. If the two persons are crossing the bridge together, they are crossing it at the speed of the slower one. These people are trying to cross the bridge as quickly as possible. Use 3 search strategies (UCS, IDS and A*) to find the best order for these persons to cross the bridge. Input file: C, number of test cases For each test case: K, number of people A list of K numbers, showing the time required by each person to pass to the other side. Output: Your program should printout the following information for each search strategy: Sequence of trips taken by the group along with directi...

\$26 (Avg Bid)
\$26 Avg Bid
3 bids

...flashlight. The bridge is very narrow and allows two persons to cross it at the same time at most. Two persons go from east to west and one person returns with the flashlight from west to east. If the two persons are crossing the bridge together, they are crossing it at the speed of the slower one. These people are trying to cross the bridge as quickly as possible. Use 3 search strategies (UCS, IDS and A*) to find the best order for these persons to cross the bridge. Input file: C, number of test cases For each test case: K, number of people A list of K numbers, showing the time required by each person to pass to the other side. Output: Your program should printout the following information for each search strategy: Sequence of trips taken by the group along with directi...

\$56 (Avg Bid)
\$56 Avg Bid
3 bids

I have an AI task solving a group of K persons (K > 1) who wants to cross a bridge from East to West during the night. Use 3 search strategies (UCS, IDS, and A*)

\$21 (Avg Bid)
\$21 Avg Bid
3 bids