hilaliya Goto Github PK

7-gunde-python-0-dan-100-e-pyt101

Udemy Kurs İçeriği: 1 hafta boyunca günde 1.5 saat ayırarak Python'ı tüm detaylarıyla öğrenin. (+Pomodoro tekniği ile birlikte)

bisection

Bisection Algorithm is a method that is used to find the root of an equation in a given interval that is the value of ‘x’ for which f(x) = 0. It applies a line search using derivatives. Thus it is only applicable for derivative functions

branch-and-bound

This program enables to find the optimal solution of a mathematical model with explicit formulation information using the simplex algorithm and (if the variables are integers) the branch-bound algorithm.

customer-manager

Kodlama.io 3. gün ödevi

fibonacci

The Fibonacci method is a line search procedure for minimizing a strictly quasiconvex function over a closed bounded interval

hacklive4-stock-price-prediction-3rd-place-solution

Provided a dataset of a public stock market for 104 stocks, the challenge is to forecast the future closing prices for these stocks for the next 2 months. https://datahack.analyticsvidhya.com/contest/hacklive-4-guided-community-hackathon/#About

hooke-and-jeevs

The method of Hooke and Jeeves, does not perform line searches but, instead, adopts a simple scheme involving functional evaluations.

re-cap-project-with-csharp

Araba Kiralama Sistemi | Kodlama.io | Recap Project

slam