2313 search results - page 20 / 463 » On Heuristic Time Hierarchies |
100
click to vote
PARA
2004
Springer
15 years 5 months ago
2004
Springer
During the last half-decade, a number of research efforts have centered around developing software for generating automatically tuned matrix multiplication kernels. These include ...
GD
2008
Springer
15 years 27 days ago
2008
Springer
Abstract. The Sugiyama framework is the most commonly used concept for visualizing directed graphs. It draws them in a hierarchical way and operates in four phases: cycle removal, ...
JUCS
2002
14 years 11 months ago
2002
: WordNet (WN) is a lexical knowledge base, first developed for English and then adopted for several Western European languages, which was created as a machinereadable dictionary b...
IPM
2010
14 years 10 months ago
2010
Taxonomy construction is a resource-demanding, top down, and time consuming effort. It does not always cater for the prevailing context of the captured information. This paper pro...
CSCLP
2005
Springer
15 years 5 months ago
2005
Springer
CSP search algorithms are exponential in the worst-case. A trivial upper bound on the time complexity of CSP search algorithms is O∗ (dn ), where n and d are the number of variab...