# Search Results

Results tagged with Search options user 30481
17 results

An algorithm is a sequence of well-defined steps that defines an abstract solution to a problem. Use this tag when your issue is related to design and analysis of algorithms.

It took me about a week to understand how does it works, but still, I'm wondering if it actually works! I. The algorithm EXPLORE EXPLORE (S:sommet, D:following vertices of vertex X, visited:TAB) var …
asked Sep 29 '15 by ThePassenger
I have had comparative algorithm exercise to do about algorithm propoerties such as completeness, time complexity, memory complexity... I discovered Iterative deepening depth-first search algorithm. …
asked Sep 26 '16 by ThePassenger
What algorithm to apply when a graph have cycles ("circuits") and some negatives values in order to find the shortest path from $x1$ to all vertices? For instance in the following graph? I know I can' …
asked Jan 1 '16 by ThePassenger
I'm trying to find out how many circuits exist in a graph $G$, given its adjacency matrix. Yet, the only thing I know is how to find out if there is a circuit in a graph $G(X,U)$ given a list of out- …
asked Sep 27 '15 by ThePassenger
I try to understand and apply nested Monte Carlo Research. Yet, after reading its designer's paper I didn't understood why he added an if after an if-else condition. Shouldn't the last if be always sk …
asked Jan 23 '18 by ThePassenger
that using two algorithms lead me to have several solutions. I'm not asking for the whole solution, some hints would be really appreciated! ;) …
asked Oct 1 '15 by ThePassenger
This the answer that was accepted for the arrangement problem of a library: we have books with heights $H_n,$ $1 \le n \le N$ and widths $W_n,$ with heights in ascending order for each book, and w …
asked Nov 1 '15 by ThePassenger
I was given in a lecture the following algorithm that wwas said to be a graph-traversal algorithm. The algorithm given during the lecture The algorithm EXPLORE (s:sommet, D:list of the following …
asked Sep 27 '15 by ThePassenger
I just had a course on algorithm, we just started to study graph traversal. the teacher wrote analgorithm but I think there is a mistake: I'm a bit shy so I didn't asked her why so... EXPLORE (s:somm …
asked Sep 23 '15 by ThePassenger
I have two automata of states, transition and events (Etat, Transition, evenements) and I want to create a function that create the synchronized product between those two automata. For instance, given …
asked Dec 19 '18 by ThePassenger
Let's consider a greedy algorithm for the coloration problem called the Dsatur algorithm, designed by Daniel Brélaz in 1979 at the EPFL, Switzerland.. This algorithm is based on an order of vertices w …
asked Mar 16 '17 by ThePassenger
Good evening! I tried to model the Binomial theorem, that allows to expand any power of x + y into a sum of the form: (x+y)^n = {n \choose 0}x^n y^0 + {n \choose 1}x^{n-1}y^1 + {n \choose 2}x^{n-2 …