In this paper, we introduce a new approach for solving the traveling salesman problems (TSP) and provide a solution algorithm for a variant of this problem. The concept of the proposed method is based on the Hungarian algorithm, which has been used to solve an assignment problem for reaching an optimal solution. We introduced a new fittest criterion for crossing over such problems, and illu...

Teaching programming in an efficient and effective method has been the most difficult subject world of computing for last couple decades. Aside from a lack laboratory equipment, prevalent issues are lengthy time it takes to understand problem, devising algorithms, writing coding, syntax, semantic complexity language. Because wide range students' backgrounds, misconceptions about course, traditi...

Classical computing has well-established formalisms forspecifying, refining, composing, proving, and otherwise reasoningabout computations. These formalisms have matured over the past70 years or so.Unconventional Computing includes the use novel kinds of sub-strates – from black holes and quantum effects, through to chem-icals, biomolecules, even slime moulds – to perfor...

Cryptographic protocols are used in distributed systems to identify users and authenticate transactions. They may involve the exchange of about 2–5 messages, and one might think that a program of this size would be fairly easy to get right. However, this is absolutely not the case: bugs are routinely found in well known protocols, and years after they were first published. The problem is the pr...

Analogies, examples, narratives, case studies and stories are common tools used in teaching. When teaching computer programming, the value of using these tools is amplified due to the abstract nature of the discipline. Analogies such as eating Smarties out of a packet can be used to illustrate the concept of loops, and the example of transferring water from one glass to another glass already f...

The aim of 'programming the global computer' was identified by Milner and others as one of the grand challenges of computing research. At the time this phrase was coined, it was natural to assume that this objective might be achieved primarily through extending programming and specification languages. The Internet, however, has brought with it a different style of computation that (although har...

COLUMBIA UNIVERSITY HIGH SCHOOL SCIENCE HONORS PROGRAM 2007Apr 14 Sat Week 10 1. Machine Learning Intro Wikipedia: As a broad subfield of artificial intelligence, machine learning is concerned with the development of algorithms and techniques that allow computers to "learn". Most of machine learning works on extracting rules and patterns out of massive data sets. Some parts of machine learning ...

A paintable computer is defined as an agglomerate of numerous, finely dispersed, ultra-miniaturized computing particles; each positioned randomly, running asynchronously and communicating locally. Individual particles are tightly resource bound, and processing is necessarily distributed. Yet computing elements are vanishingly cheap and are regarded as freely expendable. In this regime, a limiti...

Note:I have made one change to the text of the proposal: At the request of some supporters of other languages, I've withdrawn a language comparison chart that contained highly personal and sometimes unfounded opinions of other languages. The table was being used out of context in a way that some found objectionable. (Not all of the table is disputed, but it seems wiser not to engage in direct l...