Találati lista | Tudóstér

001-es BibID:	BIBFORM029968
Első szerző:	Kósa Márk (programtervező matematikus)
Cím:	Search algorithms at ACM contests / Márk Kósa, János Pánovics
Dátum:	2007
Megjegyzések:	Students of the University of Debrecen majoring in informatics have been participating in regional ACM international collegiate programming contests since 1995. In this paper, we introduce the history and rules of ACM contests. The problems of this programming contest cover several topics from the area of mathematics and informatics. We deal with topics in which search algorithms may be used during problem solving. We show search algorithms which can be applied to solving problems presented in ACM contests of the last few years. Such algorithms are different versions of backtracking algorithmas well as breadth-first search and uniform-cost search. It is very important to find the best algorithm for problem solving in order to have the most efficient solution. We will see that even if using the same algorithm, the performance of these methods are highly dependent on the state space representation of the problem.
Tárgyszavak:	Természettudományok Matematika- és számítástudományok előadáskivonat search algorithms backtracking breadth-first search state space representation ACM contest uniform-cost search
Megjelenés:	Proceedings of the 7th International Conference on Applied Informatics, January 28-31, 2007, Eger, Hungary / szerk. Kovács Emőd, Olajos Péter, Tómács Tibor. - Vol. 2., p. 367-375.
További szerzők:	Pánovics János (1975-) (programtervező matematikus)
Internet cím:	Intézményi repozitóriumban (DEA) tárolt változat
Borító:
Saját polcon: