Browsing Computer Science by Author "Park, Kihong"

OpenBU

Browsing Computer Science by Author "Park, Kihong"

Sort by: Order: Results:

  • Park, Kihong (Boston University Computer Science Department, 1996-07-22)
    One-and two-dimensional cellular automata which are known to be fault-tolerant are very complex. On the other hand, only very simple cellular automata have actually been proven to lack fault-tolerance, i.e., to be mixing. ...
  • Carter, Robert; Park, Kihong (Boston University Computer Science Department, 1993-11)
    This paper investigates the power of genetic algorithms at solving the MAX-CLIQUE problem. We measure the performance of a standard genetic algorithm on an elementary set of problem instances consisting of embedded cliques ...
  • Park, Kihong (Boston University Computer Science Department, 1993-07-31)
    This paper presents a lower-bound result on the computational power of a genetic algorithm in the context of combinatorial optimization. We describe a new genetic algorithm, the merged genetic algorithm, and prove that for ...
  • Heddaya, Abdelsalam; Park, Kihong (Boston University Computer Science Department, 1994-02-07)
    For communication-intensive parallel applications, the maximum degree of concurrency achievable is limited by the communication throughput made available by the network. In previous work [HPS94], we showed experimentally ...
  • Carter, Bob; Park, Kihong (Boston University Computer Science Department, 1994-11-10)
    In this paper, we study the efficacy of genetic algorithms in the context of combinatorial optimization. In particular, we isolate the effects of cross-over, treated as the central component of genetic search. We show that ...
  • Park, Kihong; Kim, Gitae; Crovella, Mark (Boston University Computer Science Department, 1996-08-07)
    Recent measurements of local-area and wide-area traffic have shown that network traffic exhibits variability at a wide range of scales self-similarity. In this paper, we examine a mechanism that gives rise to self-similar ...
  • Heddaya, Abdelsalam; Park, Kihong; Sinha, Himanshu (Boston University Computer Science Department, 1993-06-04)
    Parallel computing on a network of workstations can saturate the communication network, leading to excessive message delays and consequently poor application performance. We examine empirically the consequences of integrating ...

Search OpenBU


Advanced Search

Browse

Deposit Materials