« first day (1482 days earlier)      last day (3295 days later) » 

12:06
Hello @ThomasKlimpel !!!
Are you familiar with dynamic programming?
 
1 hour later…
13:21
@evinda Well, I know about it in a computer science context:
As a subject of scientific computing, it would probably be related to stochastic differential equations, but I would be quickly at the end of my knowledge there:
The Hamilton–Jacobi–Bellman (HJB) equation is a partial differential equation which is central to optimal control theory. The solution of the HJB equation is the 'value function' which gives the minimum cost for a given dynamical system with an associated cost function. When solved locally, the HJB is a necessary condition, but when solved over the whole of state space, the HJB equation is a necessary and sufficient condition for an optimum. The solution is open loop, but it also permits the solution of the closed loop problem. The HJB method can be generalized to stochastic systems as well...
 
1 hour later…
14:26
It is given a graph and I want to find the shortest path..And I wanted to vrify if the way I did it is right... @ThomasKlimpel
15:09
@evinda So you mean you don't really have a problem, you just want to talk with someone about what you have implemented?
 
3 hours later…
18:31
Yes...@ThomasKlimpel

« first day (1482 days earlier)      last day (3295 days later) »