main webpage
W Topic
Computer Science
arXiv (Cornell University)
Speed-up of Self-Organizing Networks for Routing Problems in a Polygonal Domain
2017
Routing problems are optimization problems that consider a set of goals in a graph to be visited by a vehicle (or a fleet of them) in an optimal way, while numerous constraints have to be satisfied. We present a solution based on multidimensional scaling whic…
Article

Computer Science

Study of computation

Computer science is the study of computation, information, and automation. Computer science spans theoretical disciplines (such as algorithms, theory of computation, and information theory) to applied disciplines (including the design and implementation of hardware and software).

Algorithms and data structures are central to computer science. The theory of computation concerns abstract models of computation and general classes of problems that can be solved using them. The fields of cryptography and computer security involve studying the means for secure communication and preventing security vulnerabilities. Computer graphics and computational geometry address the generation of images.

Exploring foci of:
arXiv (Cornell University)
Speed-up of Self-Organizing Networks for Routing Problems in a Polygonal Domain
2017
Routing problems are optimization problems that consider a set of goals in a graph to be visited by a vehicle (or a fleet of them) in an optimal way, while numerous constraints have to be satisfied. We present a solution based on multidimensional scaling which significantly reduces computational time of a self-organizing neural network solving a typical routing problem -- the Travelling Salesman Problem (TSP) in a polygonal domain, i.e. in a space where obstacles are represented by polygons. The preliminary result…
Click Computer Science Vs:
Travelling Salesman Problem
Vehicle Routing Problem
Mathematics
Algorithm
Programming Language
Mathematical Analysis