Anna Swiecicka

Learn More
The paper presents cellular automata (CA)-based multiprocessor scheduling system, in which an extraction of knowledge about scheduling process occurs and this knowledge is used while solving new instances of the scheduling problem. There are three modes of the scheduler: learning, normal operating, and reusing. In the learning mode, a genetic algorithm is(More)
Cellular automata (CAs) are interesting because complex global behaviour arises from simple local interactions. In this paper, CAs are proposed to design parallel scheduling algorithm for allocating tasks of a parallel program in the two processor system. CAs solving the scheduling problem act according to some rules which must be found. Effective rules for(More)
In this paper we report new results concerning developing parallel multiprocessor scheduling algorithms working in cellular automata (CAs) based scheduler. We consider the simplest case when a multiprocessor system is limited to two processors, but we not imply any limitations on a size and parameters of parallel programs. We use an approach called a(More)
PURPOSE One of the aims of the treatment in ambulant cerebral palsy (CP) patients is improvement of gait. The level of gait pathology is assessed by instrumented gait analysis, including surface electromyography. The aim of this study was to investigate the relation of the abnormality level of the gait and the co-contraction of the agonist-antagonist(More)
  • 1