For questions about various search algorithms.

learn more… | top users | synonyms

2
votes
1answer
43 views

Find the three closest surrounding neighbors from a data

I have a data of coordinates $x$ and $y$ where we know the range of both variables, e.g. $(x,y)\in[0,1]^2$. So for a given any random point $\theta_0=(x_0~~y_0)^T$ in the range of $x$ and $y$ I would ...
1
vote
1answer
100 views

Weakly unimodal function using Golden Section Search

I was going through the Golden Section Search https://en.wikipedia.org/wiki/Golden_section_search and as I understand it should work for every unimodal function. Here, the definition of unimodal ...
1
vote
1answer
32 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 ...
0
votes
1answer
27 views

How to implement an algorithm for specific kinds of search in a graph

Imagine i have a graph called G. G has some parts. In one part, every node describes a person. I have another part in G which contains interests as nodes. ( Imagine that person A likes music. So, ...
2
votes
0answers
25 views

n-dimensional searching alogrithm

If you want to store various points in a $n$ dimensional (here $n=2$) space. Is there a possibility to do that with a tree (as a binary-tree for $n=1$ is usually used) for efficient and fast finding ...
2
votes
0answers
171 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
24 views

Enumerate 'one number from each set' from a set of sets in order of increasing sum.

This question is somewhat similar to: Algorithm wanted: Enumerate all subsets of a set in order of increasing sums but has a significant difference in that instead of enumerating all subsets of a set, ...
1
vote
0answers
38 views

Improving Simulated Annealing based on Measure of Goodness

can anyone answer this question or direct me to a reference that can help? Simulated Annealing returns the current state when the end of the annealing schedule is reached and if the annealing ...
1
vote
0answers
77 views

How to determine size and height balance of binary search tree?

I've been reading/ learning binary search trees and I've been stuck on the following question for a while now. I have the following tree, how do I determine the height and size balance of it? How do ...
1
vote
0answers
45 views
1
vote
0answers
37 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
60 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
22 views

How do you calculate search spaces like tic tac toe?

I'm studying search spaces and I've been looking through the internet and can't find relevant info on how to work it out myself, the sources I found give a bad explanation of it, and do not explain ...
0
votes
0answers
20 views

Uniqueness of spanning trees made using search algorithms?

For undirected graphs, the corresponding spanning trees can be obtained using various search algorithms like Depth-first search algorithm , Bredth-first algorithm, etc. I am not sure whether the ...
0
votes
0answers
18 views

3SUM problem solution on the basis of cubic function and a line?

The 3SUM problem formulation: in a given set of n real numbers find 3 elements that sum to specified value S. I am trying to understand mathematical solution of the 3SUM problem based on a polynomial ...
0
votes
0answers
25 views

What is the maximum number of times that absolute value of neighboring difference is larger than a threshold?

Suppose I have a sequence of data $x_1$, $x_2$, ..., $x_N$. Suppose for a particular value $X$, and for a particular interval $m$, the number of times that $|x_{i+m}-x_i|>X$ ($1\le i\le N-m$) is $...
0
votes
0answers
10 views

Searching if a value is returned by a function defined for 2-D lattice points

Two functions $f:(x, y) \rightarrow \Bbb N$ and $g:(x, y) \rightarrow \Bbb N$ are defined where $\Bbb N$ is set of positive integers and $x, y \in \Bbb N$. Properties and relations $g(x, y) \ge g(x-...
0
votes
0answers
23 views

Exhaustive Search

Suppose you have a vector of array with N elements, and each element can be an integer between 0 and M. For example, "1, 3, 0, 4, 0" where N = 5 and M = 4. I want to find this array by just doing an ...
0
votes
0answers
20 views

Binary search for the worst case.

I want to analyze binary search for the worst case, completely mathematically without any ellipses(...). I solved out the recurrence of the binary search. $$ T(n+1)=T(n/2)+C $$ I've already searched ...
0
votes
0answers
11 views

2d search with high cost

I have a function f(x,y) that returns a fitness value, but calculating f(x,y) is very costly, and I expect a fair number of local maxima that are much lower than the global maximum. I do, however, ...
0
votes
0answers
22 views

How does Best First Search Calculate the Heuristic Values in the Graph

I understand that Best First Search uses a sorted open list based on Heuristic Values of the Nodes (priority queue) and a closed list.But how are these Heuristic values of the Nodes calculated? The ...
0
votes
0answers
22 views

Optimally exploring a 2d grid

Given a 2D grid and an unknown starting location, what is the best way to search every node? The size of the grid would be known prior to starting but the method should scale easily.
0
votes
0answers
45 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 - ...