Deterministic/nondeterministic vs Episodic/Sequential? Computer Science |
- Deterministic/nondeterministic vs Episodic/Sequential?
- Security issues when generating passwords programmatically?
- Computer Science Fall internship 2021
- Latest research on the k-stacker crane problem?
- What makes a minimum spanning tree unique?
| Deterministic/nondeterministic vs Episodic/Sequential? Posted: 09 Apr 2021 12:31 AM PDT Currently learning intro to AI, I am confused between Deterministic vs Sequantial. Definition of Deterministic: The next state of the environment is completely determined by the current state and the actions selected by the agent Sequantial: Each episode is affected by the previous taken actions Are they not the same thing? [link] [comments]  |
| Security issues when generating passwords programmatically? Posted: 09 Apr 2021 03:25 AM PDT I've seen some people say that generating passwords by randomly selecting characters/symbols/numbers in python is a security risk as the standard 'random' library doesn't generate true random. But no one has explained WHY this is a problem. If I use that library to get a 'random' 20 character string, surely that is better than most passwords your mom or dad might have? What if I randomly exchange characters out a few times after that? I can't see how this is a risk, especially if you add/remove randomly multiple times [link] [comments]  |
| Computer Science Fall internship 2021 Posted: 09 Apr 2021 01:32 AM PDT Are there generally good amount of intern position starting in fall for computer science? If so when do they normally open? Thanks for the help! [link] [comments]  |
| Latest research on the k-stacker crane problem? Posted: 07 Apr 2021 11:37 AM PDT I was searching for the k-scp problem on google scholar but so far I don't see any new work since the original paper in 1976 (link to paper). Of course there are application papers and heuristic algorithms but I need some papers that focus on approximation results (constant approximation, PTAS, etc.). For those who don't know what the problem is: the 1-scp problem involves a mixed graph (a graph with both directed and undirected edges), the task is to find the shortest tour to travel all directed edges (undirected edges are optional). It is NP-hard. The k-scp problem is similar but now we have k different cranes and we want to find k tours so that the length of the longest tour is minimized, with the condition that each directed edge must be traversed by at least one crane. If there are other similar problems with different names / terminologies please let me know. Thanks! [link] [comments]  |
| What makes a minimum spanning tree unique? Posted: 07 Apr 2021 04:56 PM PDT My DS&A textbook mentions that a given MST is unique but doesn't once explain what that means. What makes a minimum spanning tree unique? [link] [comments]  |
| You are subscribed to email updates from Computer Science: Theory and Application. To stop receiving these emails, you may unsubscribe now. | Email delivery powered by Google |
| Google, 1600 Amphitheatre Parkway, Mountain View, CA 94043, United States | |
No comments:
Post a Comment