Questions tagged [computational-complexity]

The amount of resources required to run a given algorithm in relation to a given task.

Filter by
Sorted by
Tagged with
0
votes
0answers
23 views

Why would my neural network run faster on my laptop than on my university's supercomputer?

I am trying to get my neural network running on my university's supercomputer in order to decrease its runtime (not for training, for testing - feedforward runs only). However, the Matlab function I ...
2
votes
1answer
30 views

Why is the space-complexity of greedy best-first search is $\mathcal{O}(b^m)$?

I am reading through Artificial Intelligence: Modern Approach and it states that the space complexity of the GBFS (tree version) is $\mathcal{O}(b^m)$. While I am reading, at some points, I found ...
4
votes
0answers
35 views

Given an input $x \in R^{1\times d}$ and a network with $s$ hidden layers, is the time complexity of the forward pass $O(d^{2}s)$? [duplicate]

I have a neural network that takes as an input a vector of $x \in R^{1\times d}$ with $s$ hidden layers and each layer has $d$ neurons (including the output layer). If I understand correctly the ...
2
votes
2answers
58 views

Using human driver behavior data to train autonomous vehicles

If I have a car and a human is driving a car on a daily basis. I create a system to analyze the human routines of driving and implement this system in maybe 10,000 cars. I use that data to train an ...
1
vote
1answer
278 views

How to estimate the cost and time to complete an AI Projects

If you are a freelancer, when a client asks to create a website we can easily measure how much the total cost is needed based on the requirements of the client. (the backend, UI/UX design, features, ...
1
vote
1answer
267 views

Why is exact inference in a Bayesian network both NP-hard and P-hard?

I should show that exact inference in a Bayesian network (BN) is NP-hard and P-hard by using a 3-SAT problem. So, I did formulate a 3-SAT problem by defining 3-CNF: $$(x_1 \lor x_2) \land (\neg x_3 \...