Электронный научный архив УрФУ: Browsing DSpace

Browsing by Subject SATISFIABILITY PROBLEM

Jump to: 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
А Б В Г Д Е Ж З И Й К Л М Н О П Р С Т У Ф Х Ц Ч Ш Щ Ъ Ы Ь Э Ю Я
or enter first few letters:

Showing results 1 to 11 of 11

Issue Date	Title	Author(s)
2013	Computational experiments for the problem of hamiltonian path with fixed number of color repetitions	Gorbenko, A.; Popov, V.
2012	The far from most string problem	Gorbenko, A.; Popov, V.
2013	A graph-based model of object recognition self-learning	Gorbenko, A.
2012	Hamiltonian alternating cycles with fixed number of color appearances	Gorbenko, A.; Popov, V.
2012	Multi-agent path planning	Gorbenko, A.; Popov, V.
2012	Multiple occurrences shortest common superstring problem	Gorbenko, A.; Popov, V.
2013	On multiple occurrences shortest common superstring problem	Gorbenko, A.; Popov, V.
2012	On the longest common subsequence problem	Gorbenko, A.; Popov, V.
2015	The permutation problem using a unit-capacity robot	Gorbenko, A.; Popov, V.
2012	The problem of finding two edge-disjoint hamiltonian cycles	Gorbenko, A.; Popov, V.
2012	Task-resource scheduling problem	Gorbenko, Anna; Popov, Vladimir

Showing results 1 to 11 of 11