Home * People * Jan Kozak

Jan Kozak,
a Polish computer scientist and researcher at Institute of Computer Science, University of Silesia, Sosnowiec. His research interests include data mining, decison trees, decision forest, ant colony optimization [1] , and combinatorial game theory. In their 2011 ICGA Journal paper New Trends in Clobber Programming, Wojciech Wieczorek, Rafał Skinderowicz, Jan Kozak, and Przemysław Juszczuk introduced four algorithms for playing the game of Clobber. Kozak's program became third (of eight) in the First Silesian University Clobber Tournament on June 22, 2011 [2] .

Shortest Path

Shortest path find by an ant colony [3]

See also

Selected Publications


External Links


  1. ^ COMPUTATIONAL SWARM INTELLIGENCE - High Effectiveness and Pick Efficiency in Optimization - Experts and organizers
  2. ^ Wojciech Wieczorek, Rafał Skinderowicz, Jan Kozak, Przemysław Juszczuk (2011). New Trends in Clobber Programming. ICGA Journal, Vol. 34, No. 3
  3. ^ Shortest path find by an ant colony, Author: Johann Dréo, May 27, 2006, Notes: 1) the first ant find a food source (F), using some path (a), then it comes back to the nest (N), laying a pheromone trail. 2) the ants follow one of the 4 possible paths, but the reinforcement of the trail make the shortest path more appealing. 3) the ants follow the shortest path, the pheromone trail of the longest ones evaporates, Ant colony optimization algorithms - Detailed, from Wikipedia
  4. ^ DBLP: Jan Kozak
  5. ^ Toads and Frogs (game) from Wikipedia

What links here?

Up one level