What strategies one can use to keep maximum number of non attacking pieces on an $n \times n$ chess board?
What are the strategies one can use to keep maximum number of non attacking pieces (all pieces other than pawn) on an $n\times n$ board? It is like an $n$-queen problem but here instead of only queen ...
The E-M algorithm does not guarantee convergence to global maxima. Following Applet shows this nicely: http://www.cs.cmu.edu/~alad/em/ Is it possible to generate data set, that guarantees reaching ...
For an assignment i need to program an application to schedule conversations. Something similar to speeddating or Pta meeting. The problem is that i know that this is hard to solve, but i dont know if ...
I am a beginner with meta-heuristic algorithms. A problem I have encountered while programming is the step: Generate a candidate solution. I have studied many papers, but none of them give me a hint ...
For optimization, from Wikipedia: In computer science, metaheuristic designates a computational method that optimizes a problem by iteratively trying to improve a candidate solution with ...
What heuristics can be used to minimize the asymptotic matrix bandwidth of a 5-point Laplacian discretization?
I can see that there are multiple heuristics to acheive a matrix with minimum bandwidth. As heuristics, they can't guarantee an optimal solution in polynomial time (after all, the problem is NP ...