Đã hoàn thành

Neural Networks

Consider an n × n environment with locations (i, j), i = 1, . . . , n, j =

1, . . . , n. A miner named Sue begins at location (1, 1) and can travel up, left, down,

or right, provided that she remains within the environment at all times. There is

a gold mine at location (n, 1) and miner’s home at location (1, n). Sue begins with

0 coins in her backpack. Each time she visits the mine, she can get one gold. The

maximum amount of gold that Sue can carry is given by some constant integer G > 0.

Sue and the gold mine cannot be on the same location (n, 1); instead Sue “visits”

the gold mine by first traveling to a location that is adjacent to the gold mine (either

(n − 1, 1) or (n, 2)) and then taking an action that would place herself on the mine.

This results in Sue acquiring one more gold provided that she is not carrying G golds

already, and meanwhile, Sue’s location remains the same. Sue can visit her home

whenever she wants, similarly by first traveling to a location that is adjacent to her

home, and taking an action that would place herself on top of her home. This results

in Sue unloading all the gold she carries to her home. She receives the amount of gold

she carries as the reward. Similarly, her location remains the same in this process.

Kĩ năng: Python

Xem nhiều hơn: efficient processing of deep neural networks: a tutorial and survey, neural networks and deep learning a textbook aggarwal, deepfruits: a fruit detection system using deep neural networks, a practical theory for designing very deep convolutional neural networks, deep learning a-z™: hands-on artificial neural networks download, stock price prediction using neural networks: a project report, strike (with) a pose: neural networks are easily fooled by strange poses of familiar objects, machine learning for wireless networks with artificial intelligence: a tutorial on neural networks, graph neural networks: a review of methods and applications, a comprehensive survey on graph neural networks, deep learning a-z™: hands-on artificial neural networks, artificial neural networks-based machine learning for wireless networks: a tutorial, a recipe for training neural networks, deep learning a-z ™ hands-on artificial neural networks download, a matlab based face recognition system using image processing and neural networks, neural networks and deep learning: a textbook, neural networks and deep learning: a textbook pdf, each time the machine sees a new flower and classify it into one of the 3 species, a survey of the recent architectures of deep convolutional neural networks, incremental learning using a grow-and-prune paradigm with efficient neural networks

Về Bên Thuê:
( 0 nhận xét ) Chicago, United States

ID dự án: #32222170

Được trao cho:

alamineee

Hi, Dear Employer, I have read your job post carefully. I have over seven-plus years of experience at ✔python, ✔Django ✔Algorithm✔java, and others. Please feel free, and you may award me the task; I'd be happy and pre Thêm

$100 USD trong 2 ngày
(10 Đánh Giá)
3.9

5 freelancer chào giá trung bình$148 cho công việc này

datascientist90

Hi - This job looks like a good fit with my skill set and experience. I hold Bachelor of Computer Science and Master of Data Science Please see my profile and reviews for references.

$200 USD trong 7 ngày
(10 Nhận xét)
5.2
kisanyt

Hello Sir, I read your job requirements very carefully and I can asure you that I can fully complete your job. Im python programmer specialized in: -data science -web scraping -process automation -crawling -bot making Thêm

$200 USD trong 7 ngày
(3 Nhận xét)
2.3
itcdamico

Hello, I'm a professional Python developer. I can help with your neural network task, please contact me so I can start reasoning on it.

$200 USD trong 3 ngày
(2 Nhận xét)
1.8
BICSoft

Hello sir, Software developer from BICSoft. I am expert in c, c++, java, perl, python with data structures, algorithm and also expert in website development using HTML, CSS, php, javascript, Ajax, Angular and react et Thêm

$40 USD trong 1 ngày
(1 Nhận xét)
0.0