460 - Katedra informatiky / Department of Computer Science: Nedávno přidané
Zobrazují se záznamy 531-540 z 562
-
Deciding bisimilarity between BPA and BPP processes
(CONCUR 2003 - Concurrency Theory : 14th International Conference, Marseille, France, September 3-5, 2003. Proceedings. 2003, p. 159-173.) -
On matroid properties definable in the MSO logic
(Mathematical foundations of computer science 2003 : 28th International Symposium, MFCS 2003, Bratislava, Slovakia, August 25-29, 2003. Proceedings. 2003, p. 470-479.) -
Multidimensional term indexing for efficient processing of complex queries
(Kybernetika. 2004, vol. 40, no. 3, p. 381-396.) -
Knowledge sharing in organizational structures
(Kybernetika. 2004, vol. 40, no. 3, p. 305-316.) -
On matroid representability and minor problems
(Mathematical foundations of computer science 2006 : 31st International Symposium, MFCS 2006, Stará Lesná, Slovakia, August 28-September 1, 2006. Proceedings. 2006, p. 505-516.) -
DP lower bounds for equivalence-checking and model-checking of one-counter automata
(Information and Computation. 2004, vol. 188, issue 1, p. 1-19.) -
Parmenides Principle
(Philosophia. 2005, vol. 32, issues 1-4, p. 155-180.) -
Boolean queries optimization by genetic algorithms
(Neural Network World. 2005, vol. 15, issue 5, p. 395-409.) -
On possible counterexamples to Negami's planar cover conjecture
(Journal of Graph Theory. 2004, vol. 46, issue 3, p. 183-206.) -
Strategy extraction for mobile embedded control systems apply the multi-agent technology
(Computational Science - ICCS 2004 : 4th International Conference, Kraków, Poland, June 6-9, 2004, Proceedings, Part III. 2004, p. 631-637.)