Sciweavers

8647 search results - page 567 / 1730
» The Container Selection Problem
Sort
View
BMCBI
2008
96views more  BMCBI 2008»
15 years 7 months ago
Novel methodology for construction and pruning of quasi-median networks
Background: Visualising the evolutionary history of a set of sequences is a challenge for molecular phylogenetics. One approach is to use undirected graphs, such as median network...
Sarah C. Ayling, Terence A. Brown
ICCBR
2010
Springer
15 years 5 months ago
Taxonomic Semantic Indexing for Textual Case-Based Reasoning
Abstract. Case-Based Reasoning (CBR) solves problems by reusing past problemsolving experiences maintained in a casebase. The key CBR knowledge container therefore is its casebase....
Juan A. Recio-García, Nirmalie Wiratunga
SEMWEB
2004
Springer
16 years 12 days ago
Structure-Based Partitioning of Large Concept Hierarchies
Abstract. The increasing awareness of the benefits of ontologies for information processing has lead to the creation of a number of large ontologies about real world domains. The ...
Heiner Stuckenschmidt, Michel C. A. Klein
FCT
2003
Springer
16 years 8 days ago
On Boundaries of Highly Visible Spaces and Applications
The purpose of this paper is to investigate the properties of a certain class of highly visible spaces. For a given geometric space C containing obstacles specified by disjoint s...
John H. Reif, Zheng Sun
TAMC
2009
Springer
15 years 11 months ago
On the Complexity of the Multiple Stack TSP, kSTSP
Given a universal constant k, the multiple Stack Travelling Salesman Problem (kSTSP in short) consists in finding a pickup tour T1 and a delivery tour T2 of n items on two distinc...
Sophie Toulouse, Roberto Wolfler Calvo