2080 search results - page 43 / 416 » Measuring empirical computational complexity |
ACL
2009
13 years 7 months ago
2009
In this paper, we analyze the impact of different automatic annotation methods on the performance of supervised approaches to the complex question answering problem (defined in th...
ARTS
1999
Springer
14 years 2 months ago
1999
Springer
Stochastic process algebras such as PEPA provide ample support for the component-based construction of models. Tools compute the numerical solution of these models; however, the st...
ESANN
2007
13 years 11 months ago
2007
Any order parameter quantifying the degree of organisation in a physical system can be studied in connection to source extraction algorithms. Independent component analysis (ICA) b...
APAL
2010
13 years 10 months ago
2010
The computable Lipschitz reducibility was introduced by Downey, Hirschfeldt and LaForte under the name of strong weak truthtable reducibility [6]. This reducibility measures both t...
ATAL
2009
Springer
14 years 4 months ago
2009
Springer
The process of planning in complex, multi-actor environment depends strongly on the ability of the individual actors to perform intelligent decommitment upon specific changes in ...