Skip to main content
Fachgebiete
Automobil + Motoren Bauwesen + Immobilien Business IT + Informatik Elektrotechnik + Elektronik Energie + Nachhaltigkeit Finance + Banking Management + Führung Marketing + Vertrieb Maschinenbau + Werkstoffe Versicherung + Risiko
DE
EN
Bücher
Zeitschriften
Themenseiten
Organisationspsychologie Projektmanagement Marketing Smart Manufacturing
Weitere Formate
Podcasts Webinare Technik Webinare Wirtschaft Kongresse Veranstaltungskalender Awards
Jetzt Einzelzugang starten
Zugang für Unternehmen
Referenzkunden
SLX-Digitalkonferenz: Zukunftswerkstatt 2024

Mehr Umsatz mit Top-Kontakten

Am 7. Mai erfahren Sie, wie Vertriebsteams Leadgenerierung, Leadnurturing und Leadstrategien effizient steuern können.
Erweiterte Suche
Anmelden
nach oben
Erschienen in:
Modeling of Financial Asset Prices with Hyperbolic-Sine Stochastic Model Kapitel lesen Erstes Kapitel lesen

2020 | OriginalPaper | Buchkapitel

Basic Concepts of the Elective Course on the Hard Computing Problems

verfasst von : Boris Melnikov, Elena Melnikova, Svetlana Pivneva

Erschienen in: Convergent Cognitive Information Technologies

Verlag: Springer International Publishing

Einloggen

Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.

search-config
loading …

Abstract

We consider the material of the elective course for the young students, and briefly describe both so-called hard problems and some methods necessary to develop programs for their implementation on the computer. For this, we are considering several real problems of discrete optimization. For each of them we consider both “greedy” algorithms and more complex approaches. The latter are, first of all, are considered in the description of concepts, understandable to “advanced” young students and necessary for the subsequent program implementation of the branches and bounds method and some associated heuristic algorithms. According to the authors, all this “within reasonable limits” is available for “advanced” young students of 14–15 years.
Thus, we present our view on the consideration of difficult problems and possible approaches to their algorithmization – at a level “somewhat higher than the popular science”, but “somewhat less than scientific”. And for this, the paper formulates the starting concepts which allows one of such “complications” to be carried out within the next half-year.

Sie haben noch keine Lizenz? Dann Informieren Sie sich jetzt über unsere Produkte:

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

  • über 102.000 Bücher
  • über 537 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Maschinenbau + Werkstoffe
  • Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

Jetzt informieren

Springer Professional "Technik"

Online-Abonnement

Mit Springer Professional "Technik" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 390 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Maschinenbau + Werkstoffe




 

Jetzt Wissensvorsprung sichern!

Jetzt informieren

Springer Professional "Wirtschaft"

Online-Abonnement

Mit Springer Professional "Wirtschaft" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 340 Zeitschriften

aus folgenden Fachgebieten:

  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Versicherung + Risiko




Jetzt Wissensvorsprung sichern!

Jetzt informieren
Vorheriges Kapitel Digital Railway and How to Move from GSM-R to LTE-R and 5G
Fußnoten
1
“Ah, gentlemen, you know why we are here. We’ve not much time, and quite a problem here” (Andrew Lloyd Webber and Tim Rice).
 
2
Although the latter statement can also be disputed, if we consider it not as a problem of implementing the algorithm of its solution found beforehand by a person (namely, this problem is usually considered in literature not connected with artificial intelligence), but as a task of finding such a solution.
 
3
Let us also note, that in the final of the student team championship in programming in the world (according to the ACM version) back in 1992, there was a task about the mentioned nonograms.
 
4
The concept of “heuristics” will be briefly discussed below. According to the authors, the easiest example of a heuristic algorithm accessible for young students can be QuickSort, [9] etc.
 
5
This is a very important concept, but we shall not strictly define it. The meaning will always be clear from the context.
 
Literatur
1.
2.
3.
Lipski, W.: Kombinatoryka dla programistów. Wydawnictwa Naukowo-Techniczne, Warszawa (2004). (in Polish)
4.
Goodman, S., Stephen, S.: Introduction to the Design and Analysis of Algorithms. McGraw-Hill Computer Science Series, New York (1977)
5.
Melnikov, B., Melnikova, E.: Some competition programming problems as the beginning of artificial intelligence. Inf. Educ. 6(2), 385–396 (2007)
6.
7.
8.
9.
Wirth, N.: Algorithms + Data Structures = Programs. Prentice Hall, Upper Saddle River (1979)MATH
10.
Polák, L.: Minimization of NFA using the universal automaton. Int. J. Found. Comput. Sci. 16(999), 335–341 (2005)MATH
11.
Melnikov, B.: Multiheuristic approach to discrete optimization problems. Cybern. Syst. Anal. 42(3), 335–341 (2006)MathSciNetCrossRef
12.
Russel, S., Norvig, P.: Artificial Intelligence: A Modern Approach. Prentice Hall, Upper Saddle River (2010)
13.
Luger, G.: Artificial Intelligence: Structures and Strategies for Complex Problem Solving. Addison Wesley, Boston (2008)
14.
Makarkin, S., Melnikov, B., Trenina, M.: An approach to solving a pseudogeometric version of the traveling salesman problem. Izvestia of higher educational institutions. Volga Region. Phys. Math. Sci. 2(34), 135–147 (2015). https://​elibrary.​ru/​item.​asp?​id=​24254294. (in Russian)
15.
Melnikov, B.: The complete finite automaton. Int. J. Open Inf. Technol. 5(10), 9–17 (2017)
16.
Melnikov, B., Melnikova, E., Pivneva, S., Churikova, N., Dudnikov, V., Prus, M.: Multi-heuristic and game approaches in search problems of the graph theory. In: Information Technology and Nanotechnology Proceedings, ITNT-2018, pp. 2884–2894 (2018)
Metadaten
Titel
Basic Concepts of the Elective Course on the Hard Computing Problems
verfasst von
Boris Melnikov
Elena Melnikova
Svetlana Pivneva
Copyright-Jahr
2020
Buch
Convergent Cognitive Information Technologies

Print ISBN: 978-3-030-37435-8

Electronic ISBN: 978-3-030-37436-5

Copyright-Jahr: 2020

DOI
https://doi.org/10.1007/978-3-030-37436-5_35