460 - Katedra informatiky / Department of Computer Science: Nedávno přidané
Zobrazují se záznamy 511-520 z 562
-
On the complexity of consistency and complete state coding for signal transition graphs
(Fundamenta Informaticae. 2008, vol. 86, no. 3, p. 227-253.) -
Bouziane’s transformation of the Petri net reachability problem and incorrectness of the related algorithm
(Information and Computation. 2008, vol. 206, issue 11, p. 1259-1263.) -
Selected ideas used for decidability and undecidability of bisimilarity
(Developments in Language Theory : 12th International Conference, DLT 2008, Kyoto, Japan, September 16-19, 2008 : Proceedings. 2008, p. 56-71.) -
Compression of small text files
(Advanced engineering informatics. 2008, vol. 22, issue 3, p. 410-417.) -
Undecidability of bisimilarity by defender's forcing
(Journal of the ACM. 2008, vol. 55, issue 1, art. no. 5.) -
On the road to genetic Boolean matrix factorization
(Neural Network World. 2007, vol. 17, issue 6, p. 675-688.) -
A note on emptiness for alternating finite automata with a one-letter alphabet
(Information Processing Letters. 2007, vol. 104, issue 5, p. 164-167.) -
Some hard problems on matroid spikes
(Theory of Computing Systems. 2007, vol. 41, no. 3, p. 551-562.) -
Grow up precision recall relationship curve in IR system using GP and fuzzy optimization in optimizing the user query
(Neural Network World. 2007, vol. 17, issue 4, p. 295-309.) -
Evolutionary improving World Wide Web queries
(Neural Network World. 2007, vol. 17, issue 4, p. 321-334.)