Sciweavers

1522 search results - page 59 / 305
» On the Complexity of Several Haplotyping Problems
Sort
View
IAT
2005
IEEE
14 years 1 months ago
An Approximate Pareto Optimal Cooperative Negotiation Model for Multiple
Cooperative negotiation is proved to be an effective paradigm to solve complex dynamic multi-objective problems in which each objective is associated to an agent. When the multi-o...
Nicola Gatti, Francesco Amigoni
APPT
2003
Springer
14 years 1 months ago
Scheduling Outages in Distributed Environments
This paper focuses on the problem of scheduling outages to computer systems in complex distributed environments. The interconnected nature of these systems makes scheduling global ...
Anthony Butler, Hema Sharda, David Taniar
CDC
2010
IEEE
118views Control Systems» more  CDC 2010»
13 years 2 months ago
Explicit solutions for root optimization of a polynomial family
Abstract-- Given a family of real or complex monic polynomials of fixed degree with one fixed affine constraint on their coefficients, consider the problem of minimizing the root r...
Vincent D. Blondel, Mert Gurbuzbalaban, Alexandre ...
JCSS
2007
88views more  JCSS 2007»
13 years 7 months ago
Counting lattice vectors
We consider the problem of counting the number of lattice vectors of a given length and prove several results regarding its computational complexity. We show that the problem is â™...
Denis Xavier Charles
FGCS
2002
133views more  FGCS 2002»
13 years 7 months ago
Computational and data Grids in large-scale science and engineering
As the practice of science moves beyond the single investigator due to the complexity of the problems that now dominate science, large collaborative and multi-institutional teams ...
William E. Johnston