Continuous logic and combinatorial problems decision

Continuous logic and combinatorial problems decision

A class of combinatorial problems equivalent to mutual arrangement of N interval sequences is described. It is shown that a finite dynamic automaton without memory is an adequate mathematic model of the solution of the posed problem, and continuous logic is an appropriate mathematic tool. The soluti...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Journal of computer & systems sciences international 2008-06, Vol.47 (3), p.413-421
1. Verfasser: Levin, V. I.
Format: Artikel
Sprache:eng
Schlagworte:
Computer Methods
Control
Engineering
Mechatronics
Optimization
Robotics
Studies
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:A class of combinatorial problems equivalent to mutual arrangement of N interval sequences is described. It is shown that a finite dynamic automaton without memory is an adequate mathematic model of the solution of the posed problem, and continuous logic is an appropriate mathematic tool. The solution algorithms are constructed. An example is given.
ISSN:1064-2307
1555-6530
DOI:10.1134/S1064230708030118