1522 search results - page 173 / 305 » On the Complexity of Several Haplotyping Problems |
CEC
2009
IEEE
15 years 4 months ago
2009
IEEE
— By dividing the multiobjective optimization of the decision space into several small regions, this paper proposes multi-objective optimization algorithm based on sub-regional s...
INFOCOM
2009
IEEE
15 years 4 months ago
2009
IEEE
—In hop-by-hop networks, provision of multipath routes for all nodes can improve fault tolerance and performance. In this paper we study the multipath route calculation by constr...
EMISA
2009
Springer
15 years 4 months ago
2009
Springer
: Integrated process support is highly desirable in environments where data related to a particular (business) process are scattered over distributed, heterogeneous information sys...
GECCO
2009
Springer
15 years 4 months ago
2009
Springer
Solving complex, real-world problems with genetic programming (GP) can require extensive computing resources. However, the highly parallel nature of GP facilitates using a large n...
PKDD
2009
Springer
15 years 4 months ago
2009
Springer
Abstract. Polytope Faces Pursuit (PFP) is a greedy algorithm that approximates the sparse solutions recovered by 1 regularised least-squares (Lasso) [4,10] in a similar vein to (Or...