For questions about various search algorithms.

learn more… | top users | synonyms

1
vote
1answer
30 views

Having objects trajctories and directions how to find where objects traverse same path?

I have N objects that travel on some trajectories (unique for each object). At each agent curve point we can get object speed (direction). Having some distance ...
2
votes
0answers
157 views

Partition minimizing maximum of Euler's totient function across terms

Given natural numbers $M$ and $N$, I'd like to find a partition of $2^N$ with $M$ or fewer terms, $t_1 + t_2 + ... + t_M$, such that $\max(\phi(t_1), \phi(t_2), ..., \phi(t_M))$ is minimized, where ...
1
vote
0answers
33 views

State Space Search

I searched in the web about simple example about State Space Search, but I didn't find any simple and clear one. Can anybody explain to me what State Space Search about by a simple example? Thanks ...
1
vote
0answers
47 views

How to formulate a best-search algorithm limited by a count of nodes visited?

The problem I'm doing a search by computer program. Each node takes about 5 minutes of wall time to get a result so I'm looking to carefully choose the nodes to inspect so as to find the best result ...
0
votes
0answers
35 views

Why using Gradient Descent?

i'm currently trying to understand the backpropagation Method to train artificial neural networks, an what i didn't get now is: why should you use a Gradient Descent Method in the first place? Can't ...
0
votes
0answers
13 views

Estimating how many searches will be needed to justify time spent on presorting an array.

Problem Estimate how many searches will be needed to justify time spent on presorting an array of $10^3$ elements if sorting is done by merge sort and searching is done by binary search. (You may ...
0
votes
0answers
586 views

Difference between breadth first search and iterative deepening depth first search

I knew until now, the graph search algorithms BFS and DFS. Today I had a lecture at the university and the professor introduced us to ID-DFS (Iterative deepening depth first search). However I find it ...
0
votes
0answers
42 views

How to search for an object in more efficient way?

I have a doubt how to check if structure contains an object. Simple sketch of my structure: Root - is a group which can contain groups, keys, values. Group - can contain groups keys, values. Key - ...
-1
votes
0answers
43 views

Adjacency and incidence matrix, algorithms for finding connected components (breadth/width search, matrix approach), Dijkstra's algorithm.

(5pts) Consider the graph C5 (cycle with 5 vertices). Let A be its adjacency matrix. Calculate A^4, the fourh power of the matrix. Draw the graph corresponding to the adjacency matrix A^4. (5pts) ...