Questions tagged [algorithm-design]
Questions related to general, high level, techniques for the design of algorithms.
99 questions
0
votes
0
answers
65
views
What algorithm should be used to find the closest set of dates?
I have tried to outline my problem as structured as possible, here is a rough overview, I am trying to find the best matching stay for a hotel booking system. If someone inputs check in and checkout ...
- 101
0
votes
2
answers
200
views
Greedy solution for minimum weight where all tasks are allocated
I'm trying to solve exercise 13 from Chapter 04 of Algorithms Design (Eva Tardos) books. The problem is the following:
The way I solved: was to have a greedy solution, where I always choose, for an i,...
2
votes
1
answer
103
views
Seeking help in designing an algorithm
I am not a computer science nor a math person, but if given a pseudo-code or a English outline of steps. I can probably fumble my way through and write some code. I Apologize for the wall of text/...
- 31
1
vote
0
answers
98
views
How do I optimally fuse nodes in a tree structure?
I am trying to solve the following problem. I've tried to find the name of this problem, but could not really find what I was looking for. I assume there should be some graph-theory that covers it, ...
- 239
1
vote
1
answer
116
views
longest symmetric sequence
Suppose we are given a $n$-vector $A$ of real numbers. We need to find the longest sequence of symmetrical numbers. The numbers $a_i$ and $a_j$ are symmetrical if they are located at the same distance ...
- 175
1
vote
1
answer
56
views
How can a fault tolarent Distributed Data Saving Algorithm can be developed?
I am trying to design an algorithm. For now, I am trying to give myself a large overview.
Assume I have K (for example, K can ...
- 155
2
votes
1
answer
217
views
Faster selection algorithm for small order statistics
SELECT(A,p,r,i) is an algorithm that
partitions $A[p:r]$ around the $i$ th order statistic ie. in the output, we have $l\in A[p:p+i-2]<A[p+i-1]< h\in A[p+i:...
- 225
1
vote
1
answer
124
views
Algorithm design: Model redundancy in tests
I've run across an interesting problem at work that I'm not quite sure how to grapple.
Broadly, there is a suite of of $n$ tests to ensure the quality of a product. However, the tests are both time-...
- 11
3
votes
2
answers
276
views
The awkward status of Mersenne Twister
Random number generators generally fit into 3 categories IMO:
ad-hoc designs serving as stub to be replaced by something else if this ever happens,
considerate designs aiming at achieving statistical ...
- 448
1
vote
2
answers
571
views
How can I find 2 median values of an array which is an union of 2 arrays in O(log n)?
So I have 2 sorted arrays which will have the same length and what I need to do is sort the union array (the union of the two sorted arrays) and then find two median values, I need to do this in O(log ...
- 13
1
vote
1
answer
60
views
An algorithm to evaluate the strength of Quiz Participants
As a side-project, I had the idea to write some kind of an algorithm that would evaluate all participations in our weekly Pub quiz, to then calculate the average strength of the participants.
This is ...
0
votes
2
answers
239
views
Are there any guidelines on how to decide algorithm strategy when approaching a problem?
There are many different general strategies when designing algorithms for a problem like divide and conquer, greedy, dynamic programming, etc. I understand that it is not always obvious which to use ...
-2
votes
1
answer
66
views
How to design algorithm
I am a newbie to algorithm designing. I am working on user association and load balancing algorithm designing in millimeter wave wireless communications.
In this topic I am able to formulate the ...
- 1
0
votes
0
answers
50
views
Understanding the step in given algorithm?
I am a newbie to the world of algorithms design and currently working on a algorithm which is related to cell-phone user associating with cell-phone tower. Let $\mathcal{K} = \{1,\dots,K\}$ be set of ...
- 1
1
vote
1
answer
179
views
3-colouring with a bounded amount of colors
The topic of 3-colouring is often talked about, but what happens if we limit the amount of times we can use one color? Take a graph $G=(V,E)$ with $k$ being the number of vertices, is it possible for ...
- 49