Stack Exchange Network

Stack Exchange network consists of 174 Q&A communities including Stack Overflow, the largest, most trusted online community for developers to learn, share their knowledge, and build their careers.

Visit Stack Exchange

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.

0
votes
0answers
26 views

Ability to create new algorithm [on hold]

The notion of algorithm creation is central in considering the complexity of the human brain as well as the AI. The ability to create new algorithm can be qualified of algorithmic in the AI context ...
0
votes
1answer
20 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^{-...
0
votes
1answer
17 views

time complexity for shortest path: Ant colony optimization algorithms vs. Classical routing algorithms

For the shortest path problem in a graph, which type of algorithms have better average time complexity? Ant colony optimization algorithms vs. Classical routing algorithms? In general, can we compare ...
0
votes
2answers
34 views

Continuous Domains vs. Discrete Combinatorial Optimization

According to this website: http://yarpiz.com/67/ypea104-acor (in the website it is mentioned that it is a project aiming to be a resource of academic and professional scientific source codes and ...
0
votes
2answers
46 views

Simulated Annealing vs genetic algorithm?

What kind of problems does simulated annealing perform better than genetic algorithms if any? From my experience, genetic algorithm seems to perform better than simulated annealing for most problems
1
vote
0answers
19 views

which search methods belongs to A*

A* algorithm is based on which search methods?Explain me with example and is it optimal or complete if yes then how explain briefly?
2
votes
2answers
54 views

Daily life Example of Simulated Annealing

In AIMA, 3rd Edition on Page 125, Simulated Annealing is described as: Hill-climbing algorithm that never makes “downhill” moves toward states with lower value (or higher cost) is guaranteed to be ...
1
vote
0answers
12 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
33 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
49 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?
1
vote
1answer
33 views

Why does hill climbing algorithm not return a final solution and just return Local maximum?

According to hill climbing algorithm it just return local maximum and not reached to final goal/solution.It stuck on local maximum.What the reason behind this incompleteness of hill climbing algorithm?...
0
votes
1answer
58 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?
1
vote
0answers
21 views

Are all Ant routing algorithms the same?

Are all Ant routing algorithms the same? And 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
50 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
41 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?
0
votes
1answer
64 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
51 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?
1
vote
0answers
28 views

Why does Q-learning converges to optimal policy even if I am acting suboptimally?

In Q-learning, during training, it doesn’t matter how I select actions. The algorithm always converges to optimal optimal policy. Why does this happen?
1
vote
0answers
25 views

What Actually is Off-Policy Q-Learning?

Recently I have come across an information stating: Q-learning converges to optimal policy -- even if you’re acting suboptimally! It also states: When an optimal policy is still learned from ...
2
votes
1answer
77 views

What is the time complexity of the value iteration algorithm?

Recently, I have come across the information that the time complexity for each iteration of the value iteration algorithm is $\mathcal{O}(|S|^{2}|A|)$, where $|S|$ is the number of states and $|A|$ ...
0
votes
1answer
37 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
128 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
2k 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
1answer
130 views

How is simulated annealing better than hill climbing methods?

In hill climbing methods, at each step, the current solution is replaced with the best neighbour (that is, the neighbour with highest/smallest value). In simulated annealing, "downhills" moves are ...
1
vote
0answers
58 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 ...
0
votes
1answer
36 views

How does the internal convolution Neural Network work?

I found the below image of how a CNN works but I don't really understand it. I do understand CNNs (I think) but I find this diagram very confusing. My summarized, simplified understanding : -...
2
votes
0answers
49 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
1
vote
0answers
81 views

What are the differences between uniform-cost search and greedy best-first search?

What are the differences between the uniform-cost search (UCS) and greedy best-first search (GBFS) algorithms? How would you convert a UCS into a GBFS?
1
vote
1answer
63 views

Weighted move rating for AI

My AI (for the card game schnapsen) currently calculates every possible way the game could end and then evaluates the percentage of winning for every playable card / move. The calculation is done ...
2
votes
1answer
406 views

What are the practical differences between A* and greedy best-first search?

What are the differences between the A* algorithm and the greedy best-first search algorithm? Which one should I use? Which algorithm is the better one, and why?
-1
votes
1answer
32 views

How the number of trees to be generated in Random Forest algorithm?

The default number of trees to be generated is 10. But I thought it should be a very large number and I put 500 trees. However it performed better when the number of trees are 10 than 500. My question ...
5
votes
1answer
79 views

Which algorithm is used in robot Sophia to understand and answers the questions?

Which algorithm is used in robot Sophia to understand and answer the questions ?
3
votes
2answers
78 views

Which Algorithm is best for Robots?

I am a student and I study Algorithms like tree search algorithm graph search algorithm Then apply BFS DFS UCS IDS DLS Where are all these algorithms are used? I know there is a long list of ...
4
votes
2answers
529 views

How does the uniform-cost search algorithm work?

What is the uniform-cost search algorithm? How does it work? I would appreciate to see a graphical execution of the algorithm. How does the "frontier" evolve in the case of UCS?
2
votes
2answers
141 views

When should the iterative deepening search and the depth-limited search be used?

When should the iterative deepening search (IDS), also called iterative deepening depth-first search (IDDFS), and the depth-limited search be used?
1
vote
2answers
344 views

Greedy best first Search Algorithm vs A* search Algorithm

Greedy best first search Algorithm take the history and then check value ans then reach to goal. In A* search Algorithm take history and also cost then calculate value then reach to goal. When we ...
1
vote
1answer
64 views

Question in NLP

I'm working on a project,whereby; one of the actors is "Teacher" and it's role will be, insert the course name, outcomes of skills, then insert the question, student degree and automatically will be ...
5
votes
1answer
80 views

what other computer science algorithms could use tensor specific hardware?

It seems like only neural networks need tensor hardware? Are there any other artificial intelligence algorithms that could benefit from many tensor calculations in parallel? Are there any other ...
4
votes
1answer
138 views

Algorithms for games with very high branching factors (Connect6)

Connect6 is an example of a game with a very high branching factor. It is about 45 thousand, dwarfing even the impressive Go. What algorithms can you use on games with such high branching factors? I ...
3
votes
1answer
163 views

Monte Carlo Tree Search Expansion Phase

I'm confused regarding a specific detail of MCTS. To illustrate my question, lets take the simple example of tic-tac-toe. After the selection phase, when a leaf node is reached, the tree is expanded ...
4
votes
1answer
238 views

TRPO/PPO importance sampling term in loss function

In the Trust-Region Policy Optimisation (TRPO) algorithm (and subsequently in PPO also), I do not understand the motivation behind replacing the log probability term from standard policy gradients ...
6
votes
3answers
437 views

Why does the discount rate (γ) in the Monte-Carlo Policy-Gradient Method (episodic) appears twice?

I was reading the book Reinforcement Learning: An Introduction by Richard S. Sutton and Andrew G. Barto (complete draft, November 5, 2017). On page 271, the pseudo-code for the episodic Monte-Carlo ...
3
votes
2answers
74 views

Are there any discount-factors based on branching factors?

I recently came across this function: $$\sum_{t = 0}^{\infty} \gamma^t R_t.$$ It's elegant and looks to be useful in the type of deterministic, perfect-information, finite models I'm working with. ...
6
votes
7answers
2k views

Keeping track of visited states in Breadth-first Search

So I was trying to implement BFS on a Sliding Blocks puzzle (number type). Now the main thing I noticed that is if you have a 4*4 board the number of states can be ...
4
votes
1answer
89 views

Algorithm For Making Balanced Weapons In A Game?

I am trying to make balanced weapon pairs. So there are five stats per weapon, and I am simulating a number of combats (1000) with different stats randomized, and counting the win, lose, and draw of ...
2
votes
1answer
69 views

What's an appropriate algorithm for classification with categorical features?

My input data consists of a series of 8 integers. Each integer is a discrete token, rather than a relative numeric value (i.e. '1' and '2' are as distinct as are '1' and '100'). The output is a ...
7
votes
3answers
225 views

Mathematics for AI researcher

What are the mathematical prerequisites for understanding the core part of the algorithms in artificial intelligence and developing own algorithm? Please refer me the specific books.
1
vote
0answers
22 views

Simple question about HS algorithm's formul(Optical flow)

In the below pic, I can not understand what U vector is? It says flow field but I can not imagie what really is the flow field?
2
votes
4answers
147 views

What is a “generalized” machine learning algorithm?

What does it mean when it is said that Machine Learning algorithm results can be "generalized"? I don't understand what "generalized" algorithms, routines or functions are. I have searched ...
0
votes
0answers
20 views

A question about visualizing “Lucas-Kanade(optical flow)” algorithm

I am reading O'Reilly's OpenCV 3 book. In keypoints section(for tracking objects), there is an algorithm named "Lucas-Kanade". in the below image it tries to give a visualization of it but I can not ...