Questions tagged [algorithm]

For questions about algorithm's that exhibit characteristics of intelligence, or are critical components in systems that exhibit intelligence, and problem-solving and goal-based algorithms in general.

Filter by
Sorted by
Tagged with
2
votes
0answers
9 views

Metrics of quality of parameter space exploration

Considering a black box optimization problem on non-linear, non-convex function where we want to minimize an objective function. One way to assess the quality of an optimizer is to look at the best ...
4
votes
1answer
45 views

How do we determine whether a heuristic is better than another?

I am trying to solve a Maze puzzle using the A* algorithm. I am trying to analyze the algorithm based on different applicable heuristics. Currently, I explored the Manhattan and Euclidean distances. ...
1
vote
0answers
25 views

I am trying to create a network with dynamic connections for every different training example

I have developed a new algorithm which has dynamic connections. it is based off of the following paper: https://www.researchgate.net/publication/...
3
votes
1answer
67 views

Is there any computer vision technology that can detect any type of object?

Is there any computer vision technology that can detect any type of object? For example, there is a camera fixed, looking in one direction always looking at a similar background. If there is an object,...
0
votes
0answers
13 views

Discover a grammar from a set of phrases

The use case would be to give to digest to an ANTLR variant of, a huge data set of phrases of a language, and hopefully progress to discover a ponderated tree or graph, or some sort of mathematics ...
1
vote
1answer
46 views

Is an optimization algorithm equivalent to a neural network?

Is an optimization algorithm equivalent to a neural network?
0
votes
0answers
11 views

Is Rapidly-exploring random tree the appropriate algorithm for solving Sokoban?

In the game of Sokoban, a robot has to push boxes to a goal in a map. He has only the ability to move in four directions (left, right, up, down) and the map is small (15x15 fields) so it looks like an ...
0
votes
0answers
34 views

How to approach a problem with infinite solutions

Think Angry Birds kind of game. You need to hit a target at some point by adjusting angle and power. There is infinite number of parabolas that will solve this problem. My problem is not exactly that ...
1
vote
1answer
27 views

How to transform a PDDL to search?

I have a question about search and planning: I still haven't understood the difference from the two, but they seem very similar to me; here is a question I am struggling with: "Having formulated a ...
5
votes
1answer
59 views

Understanding the expansion phase in Monte Carlo Tree Search

All sources I can find provide a similar explanation to each phase. In the Selection Phase, we start at the root and choose child nodes until reaching a leaf. Once the leaf is reached (assuming the ...
2
votes
1answer
43 views

Is the Markov property assumed in the forward algorithm?

I'm majoring in pure linguistics (not computational), and I don't have any basic knowledge regarding computational science or mathematics. But I happen to take "Automatic Speech Recognition" course in ...
0
votes
1answer
48 views

Railway set artificial inteligence

P3 A basic wooden railway set contains the pieces shown in Figure 3 The task is to connect these pieces into a railway that has no overlapping tracks and no loose ends where a train could run off onto ...
0
votes
0answers
29 views

Can AC-3 algorithm solve N-Queens problem?

I am building CSP NQueens solver and apply the AC-3 algorithm.But,the domain reduction doesn't occur and gets more search time.How does it happen?Is it a nature of AC-3 algorithm?
0
votes
1answer
41 views

Algorithm that creates new images based on other images

Are there any open sourced algorithms that can take a couple of images as an input and generate a new, similar image based on that input? Or are there any resources where I can learn to create such an ...
1
vote
0answers
33 views

Action spaces for an RTS game

I think reinforcement learning would be a good fit for this problem, but I am not sure of how to deal with a seemingly infinite number of actions. In the beginning of each game (generic RTS game), the ...
3
votes
1answer
64 views

Is there research about teaching AI to “analyze the problem and design a solution”?

Update on 2019-05-19: My question is about teaching AI to solve the problem, not letting AI teach a human developer to solve a problem. Original post: I'm a software developer but very new to AI. ...
0
votes
0answers
30 views

Can't create datasets and load images in COCO annotator

I'm trying to annotate images with COCO key points for pose estimation using https://github.com/jsbroks/coco-annotator. As described in the Installation section I cloned the repo. I installed Docker ...
3
votes
1answer
52 views

How to find optimal mutation probability and crossover probability?

I have a genetic algorithm that maximizes a fitness function with two variables f(X,Y). I have been running the algorithm with various parameters in mutation and crossover probability (0.1, 0.2, ...) ...
1
vote
1answer
85 views

How do I choose the search algorithm for a particular task?

How do I choose the search algorithm for a particular task? Which criteria should I take into account?
0
votes
2answers
55 views

How can the A* algorithm be optimized?

How can the A* algorithm be optimized? Any references that shows the optimization of A* algorithm are also appreciated.
1
vote
1answer
50 views

Similarities and differences between UCT algorithms in (i), (ii), (iii) and (iv)?

I am trying to understand the similarities and differences between: (i) the UCT algorithm in Kocsis and Szepesvári (2006); (ii) the UCT algorithm in Section 3.3 of Browne et al (2012); (iii) the MCTS ...
1
vote
0answers
102 views

KnnBasic vs KnnWithMeans

I'm learning a bit about the use of the Surprise library and I have a set of data with users and ratings. I'm training a network with this library, using KNNBasic and KNNWithMeans, this last algorithm ...
1
vote
1answer
45 views

How can I calculate the shortest route between two 2d vector points with obstacles?

I have a 2D plane, with a fixed height and width of 10M. The plane has a robot in the point (1,2.2), and an electric outlet in the point (8.2, 9.1). The plane has a series of obstacles like polygons ...
4
votes
1answer
52 views

Can machine learning be used to improve the average case complexity of an algorithm?

I am developing an algorithm that, in certain moment, must explore an exponential number of objects derived from a graph: ...
1
vote
0answers
42 views

How to translate algorithm from logic to equation, and back?

I just recently got into machine learning, and have been hitting a lot of obstacles understanding the algorithms involved in the programmings. My issue isnt with the programming, but how they're ...
1
vote
1answer
45 views

Chess Engine for low clock cycle CPU

I'm looking for a simple chess algorithm that works well on a ~132MHz CPU. I know that MiniMax would take too long to go deep in order to find good moves. Is Monte Carlo Tree Search working well on ...
1
vote
1answer
18 views

Use AI to auto-correlate the words of human-translated texts?

There are many, many literary works in the public domain, along with human translations, many of which have entered the public domain as well. (Public domain = easily available) In order for me to ...
2
votes
0answers
63 views

Understanding an execution of the Monte Carlo tree search algorithm

I have these Monte Carlo Tree Search, and I need to expand it, but I don't understand the step 1 and 2, why it it goes to the first Node and then make a new Node? instead of go to the depthest left ...
2
votes
0answers
58 views

Is a very powerful oracle sufficient to trigger the AI singularity?

Lets say we have a oracle $S$ that, given any function $F$ and desired output $y$, can find an input $x$ that causes $F$ to output $y$ if it exists, or otherwise returns nil. I.e.: $$S(F, y) = x \...
0
votes
0answers
59 views

How can we estimate the transition model and reward function?

In reinforcement learning (RL), there are model-based and model-free algorithms. In short, model-based algorithms use a transition model (e.g. a probability distribution) and the reward function, even ...
1
vote
0answers
31 views

What is the genetic algorithm for? [duplicate]

I am new in the field of genetic algorithms, and I want to learn to use them in practice. How the genetic algorithm work and why it is applied ?
1
vote
1answer
46 views

Artificial intelligence as a product of algorithms

Is this approach nonsense since reason produces algorithms as a method of solving problems. The algorithm is a sequence of events that perform a task till completion of the problem. Reason is ...
0
votes
1answer
26 views

Simulated Annealing: Why is e-function used as propability function to decide to accept a worse solution

Why is the e-function used to decide whether to accept a worse solution or not? To be more specific: Why was $e$ chosen as basis? The propability to accept a worse solution is described with: $p=e^{-...
1
vote
1answer
102 views

Which algorithms, between ant colony or classical routing algorithms, have a better time complexity for the shortest path problem?

Which algorithms, between ant colony or classical routing algorithms, have a better time complexity for the shortest path problem? In general, can we compare efficiency of these two types of ...
1
vote
1answer
44 views

What kind of search method is A*?

What kind of search method is A*? Explain to me with an example.
1
vote
0answers
17 views

Change parameter in Karaboga's code of ABC algorithm

I'm working on a problem and need to use Karaboga's code of the ABC algorithm but I have some questions... Does this formula for calculating a parameter have to be changed: ...
1
vote
0answers
79 views

Which is the most straight forward approach for planning algorithm?

Which is the most straight forward approach for planning algorithm?can we use random algorithm like BFS,DFS,RBFS etc?
1
vote
2answers
74 views

why we apply mutation after getting offspring in genetic algorithm?

When we get the offspring and fitness so why we prefer to apply mutation in genetic algorithm?
0
votes
1answer
523 views

Why we use LIFO(Last in First Out) queue in depth first search?

As, we use FIFO(First In First Out) queue in breadth search algorithm but in depth first search we use LIFO.Why we use LIFO instead of FIFO in depth first search?
2
votes
0answers
37 views

Are all ant routing algorithms the same?

Are all ant routing algorithms the same? If no, what is the common properties of all of them? In other words, how we can detect a routing algorithm is an ant routing algorithm?
0
votes
1answer
56 views

Is the parent cost in A* added in every extended child?

How do we determine the cost of the parent path to its child in A* ("A star") search?
1
vote
1answer
71 views

Which search algorithm will use a limited amount of memory in online search? [closed]

Which search algorithm will use a limited amount of memory in online search mention its name?
1
vote
1answer
329 views

How to improve efficiency of backtracking?

Backtracking search is the basic uninformed algorithm for CSPs (constraint satisfaction problems). What are the directions along which backtracking efficiency can be improved ?
-2
votes
1answer
61 views

Describe the basic algorithm for performing local search. When would an algorithm such as A* search be preferred? [closed]

Describe the basic algorithm for performing local search. Give an example of a search problem for which it is an appropriate solution. When would an algorithm such as A* search be preferred?
2
votes
1answer
665 views

What is the time complexity of the value iteration algorithm?

Recently, I have come across the information (lecture 8 and 9 about MDPs of this UC Berkeley AI course) that the time complexity for each iteration of the value iteration algorithm is $\mathcal{O}(|S|^...
0
votes
1answer
264 views

Breadth first search VS recursive best first search?

What is the difference between breadth first search and recursive best first search ? How can I describe the key difference between them?
3
votes
2answers
2k views

What is an objective function?

Local search algorithms are useful for solving pure optimization problems, in which the aim is to find the best state according to an objective function. My question is what is the objective function ?...
9
votes
2answers
5k views

What are the limitations of the hill climbing algorithm and how to overcome them?

What are the limitations of the hill climbing algorithm? How can we overcome these limitations?
1
vote
0answers
71 views

Nature-inspired artificial intelligent methods for Blockchain?

I am working on the blockchain technology and I am not very familiar with the AI concept. The proposal of this web page: (http://www.euraxess.lu/jobs/349354) opens a discussion about use of nature ...
2
votes
0answers
56 views

What is the difference between IDS* and A* Algorithm? [duplicate]

What is the difference between IDS* and A* Algorithm. And how IDS* is better than A* Algorithm. Please explain your answer with pros and cons. Thanks