1. Электронный научный архив УрФУ

Просмотр коллекции по группе - По автору Gorbenko, A.

Перейти к: 0-9 A B C D E F G H I J K L M N O P Q R S T U V W X Y Z
А Б В Г Д Е Ж З И Й К Л М Н О П Р С Т У Ф Х Ц Ч Ш Щ Ъ Ы Ь Э Ю Я
или введите несколько первых букв:  
Отображение результатов 1 до 57 из 57
Дата публикацииНазваниеАвторы
2012Anticipation in simple robot navigation and finding regularitiesGorbenko, A.; Popov, V.
2012Anticipation in simple robot navigation and learning of effects of robot's actions and changes of the environmentGorbenko, A.; Popov, V.
2012The binary paint shop problemGorbenko, A.; Popov, V.
2012The c-fragment longest arc-preserving common subsequence problemGorbenko, A.; Popov, V.
2012Clustering algorithm in mobile ad hoc networksGorbenko, A.; Popov, V.
2013Coevolving solutions of the 3-satisfiability problemGorbenko, A.; Popov, V.
2013Computational experiments for the problem of footstep planning for humanoid robotsGorbenko, A.; Popov, V.
2013Computational experiments for the problem of hamiltonian path with fixed number of color repetitionsGorbenko, A.; Popov, V.
2012Computational experiments for the problem of selection of a minimal set of visual landmarksGorbenko, A.; Popov, V.
2020Deceptive actions and demonstrations of intentions for robot collision avoidancePopov, V.; Gorbenko, A.
2013Face detection and visual landmarks approach to monitoring of the environmentGorbenko, A.; Popov, V.
2012The far from most string problemGorbenko, A.; Popov, V.
2013The farthest substring problemGorbenko, A.; Popov, V.
2012Footstep planning for humanoid robotsGorbenko, A.; Popov, V.
2013The force law design of artificial physics optimization for starting population selection for GSATGorbenko, A.; Popov, V.
2013A genetic algorithm with expansion and exploration operators for the maximum satisfiability problemGorbenko, A.; Popov, V.
2013A graph-based model of object recognition self-learningGorbenko, A.
2012Hamiltonian alternating cycles with fixed number of color appearancesGorbenko, A.; Popov, V.
2013The identity checking problem for semigroupsGorbenko, A.; Popov, V.
2013An intelligent gradient detector for monitoring of passenger flowsGorbenko, A.; Popov, V.
2013An intelligent gradient detector with minimization of visual landmarks distortion for monitoring of passenger flowsGorbenko, A.; Popov, V.
2013The law of luminous intensity variation and technical visionGorbenko, A.; Popov, V.
2012The longest common parameterized subsequence problemGorbenko, A.; Popov, V.
2013Longest common parameterized subsequences with fixed common substringGorbenko, A.; Popov, V.
2013The minimum k-cover problemGorbenko, A.; Popov, V.
2013The minimum k-cover problemGorbenko, A.; Popov, V.
2013The minimum test collection problemGorbenko, A.; Popov, V.
2012Multi-agent path planningGorbenko, A.; Popov, V.
2012Multiple occurrences shortest common superstring problemGorbenko, A.; Popov, V.
2013On Hamilton paths in grid graphsGorbenko, A.; Popov, V.
2013On multiple occurrences shortest common superstring problemGorbenko, A.; Popov, V.
2015On the adjustment of the weights of the levenshtein distance for the description of sequences of rhythmic motor primitivesGorbenko, A.; Popov, V.
2012On the longest common subsequence problemGorbenko, A.; Popov, V.
2012On the problem of placement of visual landmarksGorbenko, A.; Popov, V.
2012On the problem of sensor placementGorbenko, A.; Popov, V.
2013On the shortest common parameterized supersequence problemGorbenko, A.; Popov, V.
2015The permutation problem using a unit-capacity robotGorbenko, A.; Popov, V.
2012The problem of finding two edge-disjoint hamiltonian cyclesGorbenko, A.; Popov, V.
2013The problem of fingerprints selection for topological localizationGorbenko, A.
2012The problem of selection of a minimal set of visual landmarksGorbenko, A.; Popov, V.
2013The problem of selection of a set of partially distinguishable guardsGorbenko, A.; Popov, V.
2012The problem of sensor placementGorbenko, A.; Mornev, M.; Popov, V.; Sheka, A.
2012A real-world experiments setup for investigations of the problem of visual landmarks selection for mobile robotsGorbenko, A.; Popov, V.
2013Restricted common superstringsGorbenko, A.; Popov, V.
2012Robot self-awareness: Exploration of internal statesGorbenko, A.; Popov, V.; Sheka, A.
2012Robot self-awareness: Formulation of hypotheses based on the discovered regularitiesGorbenko, A.; Popov, V.
2012Robot self-awareness: usage of co-training for distance functions for sequences of imagesGorbenko, A.; Popov, V.
2012Robot's actions and automatic generation of distance functions for sequences of imagesGorbenko, A.; Popov, V.
2012SAT solvers for the problem of sensor placementGorbenko, A.; Popov, V.
2013The shortest common ordered supersequence problemGorbenko, A.
2013The shortest common parameterized supersequence problemGorbenko, A.; Popov, V.
2013The shortest common superstring problemGorbenko, A.; Popov, V.
2013The string barcoding problemGorbenko, A.; Popov, V.
2013The swap common superstring problemGorbenko, A.; Popov, V.
2013A system of intelligent algorithms for a module of onboard equipment of mobile vehiclesGorbenko, A.
2012Usage of the laplace transform as a basic algorithm of railroad tracks recognitionGorbenko, A.; Popov, V.
2013Visual landmarks systems for humanoid robotsGorbenko, A.; Popov, V.
Отображение результатов 1 до 57 из 57