2266 search results - page 296 / 454 » Some Solutions to the Ignoring Problem |
164
click to vote
EVOW
2009
Springer
16 years 1 months ago
2009
Springer
The Maximum Parsimony problem aims at reconstructing a phylogenetic tree from DNA, RNA or protein sequences while minimizing the number of evolutionary changes. Much work has been ...
196
click to vote
IPPS
2009
IEEE
16 years 1 months ago
2009
IEEE
We are interested in this paper to study scheduling problems in systems where many users compete to perform their respective jobs on shared parallel resources. Each user has speci...
164
click to vote
ISSAC
2009
Springer
16 years 1 months ago
2009
Springer
We present an iterative algorithm for calculating approximate greatest common divisor (GCD) of univariate polynomials with the real coefficients. For a given pair of polynomials a...
177
click to vote
GECCO
2007
Springer
16 years 22 days ago
2007
Springer
Adaptive Memetic Algorithms couple an evolutionary algorithm with a number of local search heuristics for improving the evolving solutions. They are part of a broad family of meta...
134
click to vote
IPOM
2007
Springer
16 years 22 days ago
2007
Springer
Abstract. On the inter-domain Internet today, the address prefix origin in our BGP operations has become a major security concern. This critical problem can be stated simply as ...