428 search results - page 10 / 86 » Completeness of a Fact Extractor |
ESA
1998
Springer
14 years 3 months ago
1998
Springer
We consider the problem of maximizingthe number of jobs completed by their deadlinein an online single processor system where the jobs are preemptable and have release times. So i...
ECAI
2010
Springer
13 years 12 months ago
2010
Springer
Landmarks for a planning problem are subgoals that are necessarily made true at some point in the execution of any plan. Since verifying that a fact is a landmark is PSPACE-complet...
EMNLP
2009
13 years 8 months ago
2009
Many algorithms extract terms from text together with some kind of taxonomic classification (is-a) link. However, the general approaches used today, and specifically the methods o...
LCPC
1999
Springer
14 years 3 months ago
1999
Springer
Since the C language imposes little restriction on the use of function pointers, the task of call graph construction for a C program is far more di cult than what the algorithms d...
CIKM
2009
Springer
14 years 5 months ago
2009
Springer
To increase the relevancy of local patterns discovered from noisy relations, it makes sense to formalize error-tolerance. Our starting point is to address the limitations of state...