메뉴 건너뛰기




Volumn , Issue , 2000, Pages 29-33

Cellular automata approach to scheduling problem

Author keywords

Computer architecture; Computer science; Concurrent computing; Content addressable storage; Delay; Electronic mail; Linear approximation; Multiprocessing systems; Processor scheduling; Scheduling algorithm

Indexed keywords

APPROXIMATION ALGORITHMS; ASSOCIATIVE STORAGE; CELLULAR AUTOMATA; COMPUTER SCIENCE; ELECTRONIC MAIL; GENETIC ALGORITHMS; MULTIPROCESSING SYSTEMS; PARALLEL PROCESSING SYSTEMS; PROBLEM SOLVING; PROGRAM PROCESSORS; SCHEDULING; SCHEDULING ALGORITHMS;

EID: 0012581954     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/PCEE.2000.873596     Document Type: Conference Paper
Times cited : (11)

References (5)
  • 2
    • 84878540553 scopus 로고    scopus 로고
    • Discovery with Genetic Algorithm Scheduling Strategies for Cellular Automata
    • Parallel Problem Solving from Nature - PPSN V, A. E. Eiben, T. Back, M. Schoenauer and H.-P. Schwefel (eds.), Springer
    • F. Seredyński, Discovery with Genetic Algorithm Scheduling Strategies for Cellular Automata, in Parallel Problem Solving from Nature - PPSN V, LNCS 1498, A. E. Eiben, T. Back, M. Schoenauer and H.-P. Schwefel (eds.), Springer, 1998, pp. 643-65.
    • (1998) LNCS , vol.1498 , pp. 643-665
    • Seredyński, F.1
  • 3
    • 84951867116 scopus 로고    scopus 로고
    • Multiprocessor Scheduling with Support by Genetic Algorithms - Based Learning Classifier System
    • Białystok, 26-28 listopada
    • F. Seredyński, Multiprocessor Scheduling with Support by Genetic Algorithms - based Learning Classifier System, konferencja Melody analizy informacji niekompletnej i rozproszonej, Białystok, 26-28 listopada 1999.
    • (1999) Konferencja Melody Analizy Informacji Niekompletnej i Rozproszonej
    • Seredyński, F.1


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.