Techniques for drawing graphs have proven successful in producing good layouts of undirected graphs. When nodes must be labeled however, the problem of overlapping nodes arises, p...
Xiaodi Huang, Wei Lai, A. S. M. Sajeev, Junbin Gao
This paper describes a method for optimizing the cost matrix of any approximate string matching algorithm based on the Levenshtein distance. The method, which uses genetic algorit...
AbstractāIn this paper, we address the problem of selfadaptation in internet-scale service-oriented systems. Services need to adapt by select the best neighboring services solely...
Abstract. There are a number of frameworks for modelling argumentation in logic. They incorporate a formal representation of individual arguments and techniques for comparing conļ¬...
Many applications in information retrieval, natural language processing, data mining, and related ļ¬elds require a ranking of instances with respect to a speciļ¬ed criteria as op...