The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
We consider the parallel approximability of two problems arising from high multiplicity scheduling, namely the unweighted model with variable processing requirements and the weighted model with identical processing requirements. These two problems are known to be modelled by a class of quadratic programs that are efficiently solvable in polynomial time. On the parallel setting, both problems are P-complete and hence cannot be efficiently solved in parallel unless P = NC. To deal with the parallel...
We consider the parallel approximability of two problems arising
from high multiplicity scheduling, namely the unweighted
model with variable processing requirements and the weighted model with identical processing requirements. These two
problems are known to be modelled by a class of quadratic programs
that are efficiently solvable in polynomial time. On the parallel
setting, both problems are P-complete and hence cannot be
efficiently solved in parallel unless P = NC. To deal with the
parallel...
We investigate the computational structure of the biological kinship assignment problem by abstracting away all biological details that are irrelevant to computation. The computational structure depends on phenotype space, which we formally define. We illustrate this approach by exhibiting an approximation algorithm for kinship assignment in the case of the Simpson index with a priori error bound and running time that is polynomial in the bit size of the population, but exponential in phenotype...
We investigate the computational structure of the biological kinship assignment problem by abstracting away all biological details that are irrelevant to computation. The computational structure depends on phenotype space, which we formally define.
We illustrate this approach by exhibiting an approximation algorithm for
kinship assignment in the case of the Simpson index with a priori error bound and
running time that is polynomial in the bit size of the population, but exponential in phenotype...
Bref survol du théorème de non-plongement de J. Cheeger et B. Kleiner pour le groupe d’Heisenberg dans .
Currently displaying 1 –
5 of
5