In this paper, we study two fast algorithms--HashRF and PGM-Hashed--for computing the Robinson-Foulds (RF) distance matrix between a collection of evolutionary trees. The RF distan...
The current evaluation functions for heuristic planning are expensive to compute. In numerous domains these functions give good guidance on the solution, so it worths the computat...
We consider 3D object retrieval in which a polygonal mesh serves as a query and similar objects are retrieved from a collection of 3D objects. Algorithms proceed first by a normal...
The Vehicle Routing Problem with Time Windows involves finding the lowest-cost set of routes to deliver goods to customers, which have service time windows, using a homogeneous ...
Background: Affymetrix GeneChip microarrays are popular platforms for expression profiling in two types of studies: detection of differential expression computed by p-values of t-...
Jakub Mieczkowski, Magdalena E. Tyburczy, Michal D...