|
|
|
|
|
Sergey Kurapov,Maxim Davidovsky
Pág. 1 - 8
In general, a universal algorithm for testing a pair of graphs G and H for isomorphism exists. It is grounded on the fact that the rows and the corresponding columns of the adjacency matrix of the graph G can be rearranged until it turns into another, eq...
ver más
|
|
|
|
|
|
|
|
|
Triyana Muliawati, . Kartono, Edi Cahyono
Pág. 17 - 25
In this paper we discuss the dynamics of exchange rate of Euro (EUR) relative to United States dollar (USD). The data is observed from daily data in the period 1 January 2005 to 31 December 2012. In this period of global financial crisis which is affecte...
ver más
|
|
|
|
|
|
|
|
|
Christian Muise
Pág. 67 - 74
Dead-end detection is a key challenge in automated planning, and it is rapidly growing in popularity. Effective dead-end detection techniques can have a large impact on the strength of a planner, and so the effective computation of dead-ends is central t...
ver más
|
|
|
|
|
|
|
|
|
Boris Melnikov,Alexey Vylitok,Elena Melnikova
Pág. 1 - 7
In this paper we consider the representation of iterations of finite languages using special nondeterministic finite automata. For two iterated languages, a special equivalence relation is defined. We give the reduction of the conditions for the fulfillm...
ver más
|
|
|
|