CS381_PSO_HW_Spring_2024

1 in java write code: in java write code for particle swarm optimization which has adds a forth force closer to nest. calculate the direction the particles must move to be in the centre.

Correct answer will be upvoted else downvoted. Computer science.    example of a chainword is the accompanying triple:    a line of m lowercase Latin letters;    the main clue: an arrangement of fragments with the end goal that the letters that compare to each portion spell a word from the word reference;    the subsequent clue: one more succession of portions with the end goal that the letters that relate to each section spell a word from the word reference.    Note that the successions of portions don't really need to be unmistakable.    Two occasions of chainwords are considered unique on the off chance that they have various strings, diverse first clues or distinctive second clues.    Count the number of various examples of chainwords. Since the number may be really huge, output it modulo 998244353.    Input    The primary line contains two integers n and m (1≤n≤8, 1≤m≤109) — the number of words in the word reference and the number of letter cells.    Every one of the following n…

no Ai please

Complete the task using the return search algorithm: Task: The labyrinth is represented by a Boolean square matrix A8x8. The cell (i, j) is considered passable if the element ai, j is true and otherwise impassable. Write a program that checks if there is a path from adjacent horizontally and vertically passable cells of the maze, which starts in its upper left corner (0.0) and ends in its lower right corner (7.7). Operating instructions: 1) Compose a Boolean function Path (i, j), called with initial parameters (0,0); 2) If cell (i, j) is outside the matrix Path returns false; 3) If cell (i, j) coincides with (7,7) a path is found and Path returns true; 4) If cell (i, j) is impassable Path returns false (because it cannot exit the cell), otherwise (if the cell is passable) there is a path from it to cell (7,7), if there is a path from any of the cells adjacent to (i, j) next to cell (7,7). Adjacent cells per cell (i, j) are cells (i + 1, j), (i, j + 1), (i-1, j), (i, j-1).

: |: Section 3 - Random Forests Decision Trees on their own are effectiev classifiers. The true power, though, comes from a forest of trees -- multiple decision trees working together as an ensemble learner. We create multiple trees, each using a subset of the available attributes, let them each make a guess at the correct classification, and then take the majority vote as the predicted class. Sounds tricky, right? Once again, sklearn to the rescue. We are going to see if a random forest can improve on our decision tree accuracy for the bank data. To begin, we are going to create a Random Forest using the wheat training and test data from the previous section. First, reload our data. 1 # reload the wheat dataset from UCI 2 3 df = pd. read_csv ("seeds_dataset.txt", sep='\\t', engine='python') 4 6 7 df.columns = ['a', 'p', 'compactness', 'length', 'width', 'coeff', 'length_g', 'type'] print (f'Our data has {df.shape [0]} rows and {df.shape [1]} columns') 8 #Mark 70% of the data for…

Binning methods sorted data value by consulting its “neighbor- hood,” that is, the values around it. Apply also the equal distance binning method in the sorted values   The sorted values are distributed into a number of “buckets,” or bins. Price = 4, 8, 15, 21, 21, 24, 25, 28, 34, 36, 40, 50   In smoothing by bin means, each value in a bin is replaced by the mean value of the bin. Smoothing by bin means: Bin a: Bin b: Bin c:

def solve_n_queens(n):    def is_safe(board, row, col):        # Verificar la columna        for i in range(row):            if board[i][col] == 1:                return False               # Verificar la diagonal izquierda        i, j = row, col        while i >= 0 and j >= 0:            if board[i][j] == 1:                return False            i -= 1            j -= 1        # Verificar la diagonal derecha - Tell me Tree, termination conditions of a branch, in this code, in simple words, please. -

def solve_n_queens(n):    def is_safe(board, row, col):        # Verificar la columna        for i in range(row):            if board[i][col] == 1:                return False               # Verificar la diagonal izquierda        i, j = row, col        while i >= 0 and j >= 0:            if board[i][j] == 1:                return False            i -= 1            j -= 1        # Verificar la diagonal derecha        i, j = row, col        while i >= 0 and j < n:            if board[i][j] == 1:                return False            i -= 1            j += 1        return True    def solve(board, row):        if row >= n:            solution = []            for r in board:                solution.append("".join(['R' if x == 1 else '.' for x in r]))            solutions.append(solution)            return               for col in range(n):            if is_safe(board, row, col):                board[row][col] = 1                solve(board, row + 1)…

Please don't use ai to answer I will report your answer please solve it with proper calculation and explanation

Subject: Design & Analysis of algorithms Questions: Write your theoretical analysis for the brute force case Write your theoretical analysis for the divide-and-conquer case Note: The algorithms of both techniques are both answered before but I need to know their theoretical analysis.

algorithm LeveledGraphWithAdvice(G, s, vi, birdAdvice) pre- & post-cond : Same as LeveledGraph except with advice.

A Topological Sorting AlgorithmThe basic algorithm for topological sorting is straightforward:1. Locate a vertex with no successors.2. Insert the vertex into the list of vertices.3. Subtract the vertex from the graph.4. Repetition Step 1 until all vertices have been deleted. Implement the algorithm by writing code.

Question 12 kana.in pseudo code Full explain this question and text typing work only     We should answer our question within 2 hours takes more time then we will reduce Rating Dont ignore this line

Hints Master Method Use recursion tree to give you the intuition Formulate a hypothesis and use Induction or Strong Induction to prove it Use change of variables to simpilify the recurrence

Crossover    and    Mutation    The    two    main    operations    in    evolutionary    computing    are    crossover    and    mutation.    Crossover    works    like    this:    Randomly    choose    two    parents    from    the    population.    Let’s    say    these:    Parent    1:        T        F        T        F        T        T        F    Parent    2:        T        T        T        F        F        T        T    Those    two    parents    will    create    a    child    whose    DNA    is    related    to    the    parents’.    It    works    like    this:    for    each    of    the    seven    genes    in    the    chromosome,    we    will    randomly    pick    a    number    between    1    and    10    and    use    it    to    choose    which    parents’    value    the    child    will    get.    If    the    random    number    is    1    through    5,    we    will    use    Parent    1’s    included    value    for    the    child;    if    it    is    6…

Crossover    and    Mutation    The    two    main    operations    in    evolutionary    computing    are    crossover    and    mutation.    Crossover    works    like    this:    Randomly    choose    two    parents    from    the    population.    Let’s    say    these:    Parent    1:        T        F        T        F        T        T        F    Parent    2:        T        T        T        F        F        T        T    Those    two    parents    will    create    a    child    whose    DNA    is    related    to    the    parents’.    It    works    like    this:    for    each    of    the    seven    genes    in    the    chromosome,    we    will    randomly    pick    a    number    between    1    and    10    and    use    it    to    choose    which    parents’    value    the    child    will    get.    If    the    random    number    is    1    through    5,    we    will    use    Parent    1’s    included    value    for    the    child;    if    it    is    6…

Correct answer will be upvoted else Multiple Downvoted. Don't submit random answer. Computer science.     every cell of the network contains a non-negative integer. Each turn, a player should play out every one of the accompanying activities all together.  Pick a beginning cell (r1,c1) with non-zero worth.  Pick a completing cell (r2,c2) to such an extent that r1≤r2 and c1≤c2.  Lessening the worth of the beginning cell by some sure non-zero integer.  Pick any of the most limited ways between the two cells and either increment, lessening or leave the upsides of cells on this way unaltered. Note that:  a most limited way is one that goes through the most un-number of cells;    all cells on this way barring the beginning cell, yet the completing cell might be altered;    the subsequent worth of every cell should be a non-negative integer;    the cells are changed freely and not really by a similar worth.    On the off chance that the beginning and finishing cells are something very…

implementalgorithm AdaptiveGreedy( set of objects ) pre-cond: The input consists of a set of objects. post-cond: The output consists of an optimal subset of them.

Correct answer will be upvoted else Multiple Downvoted. Don't submit random answer. Computer science. Two cells are adjoining in the event that they share a side. Thusly, every cell (x, y) has precisely three neighbors:    (x+1, y)    (x−1, y)    (x+1, y−1) in case x is even and (x−1, y+1) in any case.    At first a few cells are contaminated, all the others are sound. The course of recuperation starts. Each second, for precisely one cell (despite the fact that there may be different cells that could change its state) one of the accompanying occurs:    A sound cell with something like 2 contaminated neighbors likewise becomes tainted.    A contaminated cell with something like 2 solid neighbors likewise becomes sound.    In the event that no such cell exists, the course of recuperation stops. Patient is considered recuperated if the course of recuperation has halted and every one of the cells are solid.    We're keen on a most dire outcome imaginable: is it conceivable that the patient…

Set Proofs Discrete Math Computer Science

code in python   GAME SEARCH   One of the biggest areas of research in modern Artificial Intelligence is in making computer players for popular games. Make your own four depth binary tree. Solve the decision tree by applying gaming theory of your own choice (either apply Minimax or Alpha beta pruning etc. or any other technique), make a choice of your own values ranging from 0 to 50:    The game will be two player game, one will be user and other will be AI agent    Name and design of levels must be distinct for each student‟s game binary tree

No image and no hand written solution