3053 search results - page 427 / 611 » Performance of Generative Programming Based Protocol Impleme... |
123
Voted
IJCNLP
2005
Springer
15 years 9 months ago
2005
Springer
Abstract. We present a new method for computing semantic relatedness of concepts. The method relies solely on the structure of a conceptual network and eliminates the need for perf...
131
Voted
CIBCB
2007
IEEE
15 years 7 months ago
2007
IEEE
-- A large and reliable DNA codeword library is the key to the success of DNA based computing. Searching for the set of reliable DNA codewords is an NP-hard problem, which can take...
121
Voted
GPCE
2007
Springer
15 years 9 months ago
2007
Springer
Multiple dispatch – the selection of a function to be invoked based on the dynamic type of two or more arguments – is a solution to several classical problems in object-orient...
118
Voted
CC
2002
Springer
15 years 3 months ago
2002
Springer
We present an efficient online subpath profiling algorithm, OSP, that reports hot subpaths executed by a program in a given run. The hot subpaths can start at arbitrary basic block...
136
Voted
GECCO
2005
Springer
15 years 9 months ago
2005
Springer
This study examines the utility of meta-grammar constant generation on a series of benchmark problems. The performance of the meta-grammar approach is compared to a grammar which ...