|
|
O nemožnosti učení neuronů s impulsy
Sgall, Jiří ; Šíma, J.
The computational complexity of training a single spiking neuron N with adjustable synaptic delays and binary coded inputs and output is studied. A synchronization technique is introduced so that the results concerning the non-learnability of spiking neurons with binary delays are generalized to arbitrary delays.
|
|
| |
|
|
KAM-DIMATIA Series 2004-685 and ITI Series 2004-206. Two algorithms for general list matrix partitions
Sgall, Jiří ; Feder, T. ; Hell, P. ; Králď, D.
List matrix partitions are restricted binary list constraint satisfaction problems which generalize list homomorphisms and many graph partition problems arising, e.g., in the study of perfect graphs. Most of the existing algorithms apply to concrete small matrices, i.e., to partitions problems, provide algorithms for their solution, and discuss their implications.
|
|
| |
|
|
Proofs without words
Šimša, Jaromír
Proofs without words are generally pictures, diagrams or schemes that help to see why a given mathematical statement is true, and also to see how to prove it in the formal sense.
|
|
| |
|
|
Several ways into the world of solid geometry
Roubíček, Filip
The contribution deals with the cultivation of competences to orient in space, to distinguish and to represent geometric solids in primary school. Some pupil´s activities, methods of model representation and didactic games for the cognition of geometric solids are described.
|
|
| |
|
|
The didactic game We build a house
Roubíček, Filip
In the paper is described an activity focused on developing some geometric skills, such as modelling and representing three-dimensional objects, and communication skills in the teaching of geometry.
|
|
| |
guest ::
RSS feed.