1912 search results - page 253 / 383 » On the evaluation of argumentation formalisms |
164
click to vote
PR
1998
15 years 6 months ago
1998
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...
164
click to vote
PUC
2008
15 years 5 months ago
2008
: In computing design, experience is often broken down, compartmentalized, and engineered: a process that often disenchants the original experience. In this paper, we demonstrate t...
134
click to vote
ICRA
2010
IEEE
15 years 4 months ago
2010
IEEE
— This paper presents a thorough analysis of the computational complexity of optimal reconfiguration planning problem for chain-type modular robots, i.e. finding the least number...
188
click to vote
PVLDB
2010
15 years 4 months ago
2010
Though partially automated, developing schema mappings remains a complex and potentially error-prone task. In this paper, we present TRAMP (TRAnsformation Mapping Provenance), an ...
216
click to vote
RTS
2010
15 years 4 months ago
2010
Reader preference, writer preference, and task-fair reader-writer locks are shown to cause undue blocking in multiprocessor real-time systems. Phase-fair reader writer locks, a ne...