Question

Euler Lagrange equation for an objective function with integral

score 531 · Answer 1 · 2019-10-10 15:50:18

531

Views

Euler Lagrange equation for an objective function with integral

Published on 10 Oct 2019 - 15:50

score 410 · Answer 2 · 2019-10-11 18:53:18

410

Views

Shortest time for passing the bridge $t(t_1,t_2,t_3,\dots;\text{Max},\text{Min})$

Published on 11 Oct 2019 - 18:53

score 40 · Answer 3 · 2019-10-19 18:06:30

40

Views

Is there a "theoretical limit" on how much dynamic programming can speed up an algorithm?

Published on 19 Oct 2019 - 18:06

score 15 · Answer 4 · 2026-03-06 03:37:28

15

Views

Solving MDP Value function with large state using Neural Networks

Published on 06 Mar 2026 - 3:37

score 417 · Answer 5 · 2019-10-23 19:54:06

417

Views

Construct Permutation with longest arithmetic progression subsequence of predefined length

Published on 23 Oct 2019 - 19:54

score 294 · Answer 6 · 2019-10-25 22:06:00

294

Views

Optimal strategy of a slot machine game

Published on 25 Oct 2019 - 22:06

score 339 · Answer 7 · 2019-10-26 09:37:55

339

Views

Dynamic programming - Variant of shortest path problem

Published on 26 Oct 2019 - 9:37

score 594 · Answer 8 · 2019-10-30 21:22:14

594

Views

Find the total number of ways to select a non-empty subset of these people, such that no two adjacent people are selected.

Published on 30 Oct 2019 - 21:22

score 273 · Answer 9 · 2019-10-31 12:18:36

273

Views

ways to select a non-empty subset of these people, such that no two adjacent people are selected.

Published on 31 Oct 2019 - 12:18

score 284 · Answer 10 · 2019-11-03 19:32:15

284

Views

How to correctly formulate multiple constraints to multiple feasible regions into one?

Published on 03 Nov 2019 - 19:32

score 118 · Answer 11 · 2019-11-06 03:30:41

118

Views

Removing nodes from graphs such that one is dependent on other - ZIO $2010$, P$1$

Published on 06 Nov 2019 - 3:30

score 193 · Answer 12 · 2019-11-07 08:17:49

193

Views

Finding the maximum value of elements to be selected in a grid - ZIO $2009$, P$1$

Published on 07 Nov 2019 - 8:17

score 157 · Answer 13 · 2026-03-25 17:21:30

157

Views

Distribution of number of clusters after randomly choosing a subset of points

Published on 25 Mar 2026 - 17:21

score 75 · Answer 14 · 2019-11-20 13:37:22

75

Views

How do we efficiently compute the value of expression given below?

Published on 20 Nov 2019 - 13:37

score 54 · Answer 15 · 2019-11-28 03:34:43

54

Views

Knap sack: Dynamic Programming

Published on 28 Nov 2019 - 3:34

List Question

Euler Lagrange equation for an objective function with integral

Shortest time for passing the bridge $t(t_1,t_2,t_3,\dots;\text{Max},\text{Min})$

Is there a "theoretical limit" on how much dynamic programming can speed up an algorithm?

Solving MDP Value function with large state using Neural Networks

Construct Permutation with longest arithmetic progression subsequence of predefined length

Optimal strategy of a slot machine game

Dynamic programming - Variant of shortest path problem

Find the total number of ways to select a non-empty subset of these people, such that no two adjacent people are selected.

ways to select a non-empty subset of these people, such that no two adjacent people are selected.

How to correctly formulate multiple constraints to multiple feasible regions into one?

Removing nodes from graphs such that one is dependent on other - ZIO $2010$, P$1$

Finding the maximum value of elements to be selected in a grid - ZIO $2009$, P$1$

Distribution of number of clusters after randomly choosing a subset of points

How do we efficiently compute the value of expression given below?

Knap sack: Dynamic Programming

Trending Questions

Popular # Hahtags

Popular Questions