Zobrazeno 1 - 5
of 5
pro vyhledávání: '"Mahanta, Anjana K."'
Autor:
Dutta, Malay, Mahanta, Anjana K.
In this paper we propose a new approach for developing a proof that P=NP. We propose to use a polynomial-time reduction of a NP-complete problem to Linear Programming. Earlier such attempts used polynomial-time transformation which is a special form
Externí odkaz:
http://arxiv.org/abs/2302.09024
Autor:
Dutta, Malay, Mahanta, Anjana K.
In this paper we introduce the notion of a complete time graph of order n. We define time paths and Hamiltonian time paths in a complete time graph. Each Hamiltonian time path (htp) is associated with some permutation p of the integers 1 to n. The ch
Externí odkaz:
http://arxiv.org/abs/2211.05069
Autor:
Mahanta, Anjana K., Dutta, Mala
Publikováno v:
International Journal of Data Mining & Knowledge Management Process (IJDKP) Vol.2, No.1, pp. 17-31,January 2012
We present a novel technique to identify calendar-based (annual, monthly and daily) periodicities of an interval-based temporal pattern. An interval-based temporal pattern is a pattern that occurs across a time-interval, then disappears for some time
Externí odkaz:
http://arxiv.org/abs/1202.2926
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Publikováno v:
Journal of Experimental & Theoretical Artificial Intelligence; Dec2006, Vol. 18 Issue 4, p481-499, 19p, 7 Diagrams, 3 Charts, 2 Graphs
