1101 search results - page 55 / 221 » heuristics 2007 |
HPCA
2007
IEEE
14 years 10 months ago
2007
IEEE
Task-selection policies are critical to the performance of any architecture that uses speculation to extract parallel tasks from a sequential thread. This paper demonstrates that ...
GECCO
2007
Springer
14 years 3 months ago
2007
Springer
The runtime analysis of randomized search heuristics is a growing field where, in the last two decades, many rigorous results have been obtained. These results, however, apply pa...
IJCAI
2001
13 years 11 months ago
2001
This paper describes experiences with quasiautomated creation of a computational ontology for maritime information from a mixed collection of source material. Based on these exper...
ACL
1989
13 years 10 months ago
1989
Parsing with categorial grammars often leads to problems such as proliferating lexical ambiguity, spurious parses and overgeneration. This paper presents a parser for French devel...
AOR
2006
13 years 9 months ago
2006
The domination number, domn(A, n), of a heuristic A for the Asymmetric TSP is the maximum integer d = d(n) such that, for every instance I of the Asymmetric TSP on n cities, A pro...