MTA SZTAKIEU Centre of Excellence in Information Technology and AutomationMTA SZTAKI is a member of ERCIM - the European Research Consortium for Informatics and MathematicsMTA SZTAKI is a member of W3C - the World Wide Web ConsortiumISO 9001 Quality Management




NewsServicesThe InstituteContactIntrawebContentsSearchMagyarul


 
Artificial Intelligence Laboratory

Expert Systems Group

45-95
VÁMOS, T.: Automatisierung und ihre Randgebiete.
In: Automatisierungstechnik -- Trends und Visionen für die österreichische Wirtschaft 11. Österreichischer Automatisierungstag. Wien, 1995. (Ed. P. Kopacek.)
Wien, ÖPWZ, 1995. pp. 10-15.

46-95
VÁMOS, T.: Mesterséges? Intelligencia?
2000. 7 (2) : 17-21. (1995)

47-95
VÁMOS, T.: Multimédia -- új kulturális drog vagy új lehetőség?
In: A Neumann János Számítógéptudományi Társaság VI. országos kongresszusa. Informatikai alkalmazások '95, Siófok, 1995. 2. köt.
Vác, NJSzT, 1995. pp. 629-634.

48-95
VÁMOS, T. -- KOCH, P. -- KATONA, F.: A strategy of knoweldge representation for uncertain problems: experiments and relations to similar concepts.
IEEE Transactions on Systems, Mans, and Cybernetics. 25 (10) : 1371-1383. (1995)

49-95
VÁMOS, T.: A strategy of knowledge representation for uncertain problems: modeling domain expert knowledge with patterns.
IEEE Transactions on Systems, Mans, and Cybernetics. 25 (10) : 1365-1370. (1995)

Applications of Artificial Intelligence Methods in Mechanical Engineering

50-95
KIS, T. -- VÁNCZA, J.: Computational complexity of manufacturing process planning.
In: Preprints of the 3rd European workshop on planning. EWSP' 95. Assisi, 1995. (Ed. M. Ghallab.)
Assisi, AIIA, 1995. pp. 319-332.

51-95
KIS, T. -- MÁRKUS, A. -- VÁNCZA, J.: A market model of manufacturing control.
In: Life cycle modelling for innovative products and processes. Proceedings of the IFIP WG5.3 international conference on life-cycle modelling for innovative products and processes. Berlin, 1995. (Eds. F.-L. Krause, H. Jansen.)
London, Chapman & Hall, l995. pp. 195-206.

52-95
MÁRKUS, A. -- RENNER, G. -- VÁNCZA, J.: Genetic algorithms in free form curve design.
In: Mathematical methods for curves and surfaces. (Eds. T. Daehlen, T. Lyche, L. L. Schumaker.)
La Vergne, Vanderbilt University Press, 1995. pp. [1-12.]

53-95
MÁRKUS, A. -- RENNER, G. -- VÁNCZA, J.: A learning approach to spline interpolation.
In: Second international workshop on learning in intelligent manufacturing systems. Preprints. Budapest, 1995. (Ed. L. Monostori.)
Budapest, CIRP, 1995. pp. 58-70.

54-95
MÁRKUS, A. -- VÁNCZA, J. -- HORVÁTH, M.: Process planning for part families.
In: Second international workshop on learning in intelligent manufacturing systems. Preprints. Budapest, 1995. (Ed. L. Monostori.)
Budapest, CIRP, 1995. pp. 168-185.

Combinatorical Computer Science Research Group

55-95
AIGNER, M. -- TRIESCH, E. -- TUZA, Zs.: Searching for acyclic orientations of graphs.
Discrete Mathematics. 144 (1-3) : 3-10. (1995)

56-95
ALON, N. -- TUZA, Zs.: The acyclic orientation game on random graphs.
Random Structures and Algorithms. 6 (2-3) : 261-268. (1995)

57-95
BERTRAM, E. -- ERDőS, P. -- HORÁK, P. -- SIRÁN, J. -- TUZA, Zs.: Local and global average degree in graphs and multigraphs.
Journal of Graph Theory. 18 (7) : 647-661. (1994)

58-95
BODLAENDER, H. L. -- DEOGUN, J. S. -- JANSEN, K. -- KLOKS, T. -- KRATSCH, D. -- MULLER, H. -- TUZA, Zs.: Rankings of graphs.
In: Graph theoretical concepts in computer science.
(Eds. E. W. Mayr et al.)
Berlin, Springer, 1995. pp. 292-304.
(Lecture notes in computer science 903.)

59-95
CHOU, W. S. -- MANOUSSAKIS, Y. -- MEGALALAKI, O. -- SPYRATOS, M. -- TUZA, Zs.: Paths through fixed vertices in edge-colored graphs.
Mathematiques, Informatique et Sciences Humaines. 32 (127) : 49-58. (1994)

60-95
CSUHAJ-VARJÚ E. -- PAUN, G. -- SALOMAA, A.: Conditional tabled eco-grammar systems.
In:
Artificial life: grammatical models. (Ed. G. Paun.)
Bucharest, Black Sea University, 1995. pp. 227-239.

61-95
CSUHAJ-VARJÚ, E. -- PAUN, G. -- SALOMAA, A.: Conditional tabled eco-grammar systems versus ETOL systems.
Journal of Universal Computer Science. 5 (1) : 252-291. (1995)

62-95
CSUHAJ-VARJÚ, E.: Eco-grammar systems: recent results and perspectives.
In: Artificial life: grammatical models. (Ed. G. Paun.)
Bucharest, Black Sea University, 1995. pp. 79-103.

63-95
CSUHAJ-VARJÚ, E.: Grammar systems: a multi-agent framework for natural language generation.
In: Mathematical aspects of natural and formal languages. (Ed. G. Paun.)
Singapore, World Scientific, 1994. pp. 63-78.
(World Scientific series in computer science 43.)

64-95
CSUHAJ-VARJÚ, E. -- PAUN, G.: Structured colonies: models of symbiosis and parasitism.
Analele Universitatii Bucuresti. Ser. Mathemetica-Informatica. 42-43 : 15-31. (1993-1994)

65-95
ERDőS, P. -- TUZA, Zs.: Vertex coverings of the edge set in a connected graph.
In: Graph theory, combinatorics, and applications. Proceedings of the seventh quadrennial international conference on the theory and applications of graphs. Kalamazoo, 1992. Vol. 2. (Eds. Y. Alavi, A. Schwenk.)
New York, Wiley, 1995. pp 1179-1187.

66-95
JIPSEN, P. -- MADDUX, R. D. -- TUZA, Zs.: Small representations of the relation algebra En+1(1,2,3).
Algebra Universalis. 33 (1) : 136-139. (1995)

67-95
KELEMENOVÁ, A. -- CSUHAJ-VARJÚ, E.: On the power of colonies.
In: Words, languages and combinatorics. Proceedings of the international conference. Kyoto, 1992. (Eds. M. Ito, H. Jürgensen.)
Singapore, World Scientific, 1994. pp. 222-233.

68-95
MILICI, S. -- TUZA, Zs.: Coverable graphs.
Studia Scientiarum Mathematicarum Hungarica. 30 (4) : 329-344. (1995)

69-95
NGUYEN VAN NGOC -- TUZA, Zs.: 4-chroamatic graphs with large odd girth.
Discrete Mathematics. 138 (1-3) : 387-392. (1995)

70-95
POLJAK, S. -- TUZA, Zs.: The expected relative error of the polyhedral approximation of the max-cut problem.
Operations Research Letters. 16 (4) : 191-198. (1994)

71-95
POLJAK, S. -- TUZA, Zs.: The Max-Cut problem -- a survey. Preprint.
Nankang, Taipei, Academia Sinica, 1993. 91 p.

72-95
POLJAK, S. -- TUZA, Zs.: Maximum cuts and large bipartite subgraphs.
In: Combinatorial optimization.
(Eds. W. Cook et al.)
Providence, American Mathematical Society, 1995. pp. 181-244.
(DIMACS series in discrete mathematics and theoretical computer science 20.)

73-95
TUZA, Zs.: Characterization of (m,1)-transitive and (3,2)-transitive semi-complete directed graphs.
Discrete Mathematics. 135 (1-3) : 335-347. (1994)

74-95
TUZA, Zs.: How to make a random graph irregular.
Random Structures and Algorithms. 6 (2-3) : 323-329. (1995)

75-95
TUZA, Zs.: Perfect triangle families.
Bulletin of the London Mathematical Society
. 26 : 321-324. (1994)

76-95
TUZA, Zs.: Small n-dominating sets.
Mathematica Pannonica. 5 (2) : 271-273. (1994)

77-95
TUZA, Zs.: Zero-sum block designs and graph labelings.
Journal of Combinatorial Designs. 3 (2) : 89-99. (1995)


 
 

wwwold.sztaki.hu
copyright (c) 2000 mta sztakiwebmaster