For questions about various search algorithms.

learn more… | top users | synonyms

2
votes
1answer
22 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
31 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
18 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
164 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
31 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
44 views
1
vote
0answers
34 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
54 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
13 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
25 views

Fewest questions to reach an arbitrary confidence level about the number of words a person knows in a foreign language

I have a list of 13060 Chinese characters that are pre-sorted from most frequently used to least frequently used. I would like to design a simple test to determine the total number (or approximate ...
0
votes
0answers
31 views

Breadth First Search Question

The adjacency matrix for a simple graph is shown here (as an HTML table). The questions below refer to the graph that this table represents. Give the path that is found from vertex G to vertex E ...
0
votes
0answers
15 views

Estimate parameters of a system on realtime defined as follows

I have a motor I need to estimate the parameters on real time. To simplify the problem I will put the general equation in matrix form that governs it in discrete time: $$ u_q(k) = \left[ ...
0
votes
0answers
52 views

binary search worst case for a set database of entries some good some bad

A database has 10,000 sorted entries, 20% known to be good. When looking up a record in the database, the good entries account for 60%. Two design options are considered to store the data in the ...
0
votes
0answers
22 views

Obtaining Pareto front for more than 2 objectives

I have a reasonably tractable problem withe >2 objectives in which I apply multi-objective evolutionary algorithms (MOEA) like PSO, ACO, GA. I would like to compare the performance and quality of ...
0
votes
0answers
44 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 - ...