Hannenhalli and Pevzner [5] gave a polynomial time algorithm for computing the minimum number of reversals, translocations, fissions, and fusions, that would transform one multichr...
We consider the problem of scheduling n jobs with release dates on m identical parallel machines to minimize the average completion time of the jobs. We prove that the ratio of the...
Cynthia A. Phillips, Andreas S. Schulz, David B. S...
This paper introduces a new model of a spiking neuron with active dendrites and dynamic synapses (ADDS). The neuron employs the dynamics of the synapses and the active properties ...
: This paper presents a survey of key evolving cryptosystems in the public key setting, focusing on two main approaches: `forward security' and `intrusion resilience'. Th...
We present a simple family of algorithms for solving the Generalized Assignment Problem (GAP). Our technique is based on a novel combinatorial translation of any algorithm for the...