25,161
edits
Changes
no edit summary
'''Walter A. Kosters''',<br/>
a Dutch computer scientist and mathematician, and associate professor of CS at LIACS, the Leiden Institute of Advanced Computer Science at [[Leiden University]]. His research interests include [[Neural Networks|neural networks]], [[Genetic Programming#GeneticAlgorithm|genetic algorithms]], [https://en.wikipedia.org/wiki/Analysis_of_algorithms analysis of algorithms], [https://en.wikipedia.org/wiki/Concrete_Mathematics concrete mathematics], [https://en.wikipedia.org/wiki/NP-complete NP-completeness], [https://en.wikipedia.org/wiki/Bioinformatics bioinformatics], [https://en.wikipedia.org/wiki/Data_mining data mining] and [[Artificial Intelligence|artificial intelligence]]. Along with [[Hendrik Jan Hoogeboom]] et al., Walter Kosters works on the [https://en.wikipedia.org/wiki/Computational_complexity_theory computational complexity] of [https://en.wikipedia.org/wiki/Tetris Tetris] <ref>[httphttps://www.cs.jhu.edu/~susan/600.363/tetris.pdf Tetris is Hard: An Introduction to P vs NP] (pdf) slides based on [[Erik D. Demaine]], [[Mathematician#SHohenberger|Susan Hohenberger]], [[Mathematician#DLibenNowell|David Liben-Nowell]] ('''20032002'''). ''Tetris is Hard, Even to Approximate''. [httphttps://wwwarxiv.informatik.uni-trier.de/~leyorg/dbabs/confcs/cocoon0210020 arXiv:cs/cocoon2003.html COCOON 20030210020]</ref>, and maintains the ''How to Construct Tetris Configurations'' site <ref>[http://liacs.leidenuniv.nl/~kosterswa/tetris/ How to Construct Tetris Configurations]</ref>.
=Nonograms=
* [[Joost Batenburg]], [[Walter Kosters]] ('''2005'''). ''[https://www.researchgate.net/publication/220799946_Neural_Networks_for_Discrete_Tomography Neural Networks for Discrete Tomography]''. [https://dblp.uni-trier.de/db/conf/bnaic/bnaic2005.html#BatenburgK05 BNCAI 2005]
* [[Joost Batenburg]], [[Walter Kosters]] ('''2006'''). ''[https://link.springer.com/chapter/10.1007/11774938_31 A Neural Network Approach to Real-Time Discrete Tomography]''. [https://dblp.uni-trier.de/db/conf/iwcia/iwcia2006.html#BatenburgK06 IWCIA 2006]
* [[Joost Batenburg]], [[Walter Kosters]] ('''2009'''). ''Solving Nonograms by combining relaxations''. [http://www.journals.elsevier.com/pattern-recognition/ Pattern Recognition], Vol. 42, No. 8
==2010 ...==
* [[Joost Batenburg]], [[Walter Kosters]] ('''2012'''). ''Nonograms''. [http://www.liacs.nl/ LIACS - Leiden Institute of Advanced Computer Science], [http://www.liacs.nl/~kosters/nvti2012.pdf pdf]
* [[Joost Batenburg]], [[Walter Kosters]] ('''2012'''). ''On the Difficulty of Nonograms''. [[ICGA Journal#35_4|ICGA Journal, Vol. 35, No. 4]]
* [[Hendrik Jan Hoogeboom]], [[Walter Kosters]], [[Jan van Rijn]], [[Jonathan K. Vis]] ('''2014, 2016'''). ''Acyclic Constraint Logic and Games''. [[ICGA Journal#37_1|ICGA Journal, Vol. 37, No. 1]], [https://arxiv.org/abs/1604.05487 arXiv:1604.05487]
* [[Jaap van den Herik]], [[Walter Kosters]], [[Aske Plaat]], [[Johanna Hellemons]] ('''2015'''). ''The 18th Computer Olympiad 2015''. [[ICGA Journal#38_4|ICGA Journal, Vol. 38, No. 4]] » [[18th Computer Olympiad]]
