Sciweavers

5981 search results - page 247 / 1197
» time 2006
Sort
View
JCSS
2002
95views more  JCSS 2002»
15 years 6 months ago
Efficient algorithms for multichromosomal genome rearrangements
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...
Glenn Tesler
JCO
1998
80views more  JCO 1998»
15 years 6 months ago
Improved Bounds on Relaxations of a Parallel Machine Scheduling Problem
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...
IJON
2007
93views more  IJON 2007»
15 years 6 months ago
Computing with active dendrites
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 ...
Christo Panchev
IJSN
2006
123views more  IJSN 2006»
15 years 6 months ago
A survey of key evolving cryptosystems
: 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...
Matthew K. Franklin
IPL
2006
101views more  IPL 2006»
15 years 6 months ago
An efficient approximation for the Generalized Assignment Problem
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...
Reuven Cohen, Liran Katzir, Danny Raz