2080 search results - page 161 / 416 » Measuring empirical computational complexity |
123
click to vote
IJCAI
1993
15 years 5 months ago
1993
In this paper a framework is developed for measuring the complexities of deductions in an ab stract and computationally perspicuous man ner. As a notion of central importance ...
134
click to vote
CORR
2010
Springer
15 years 4 months ago
2010
Springer
One possible escape from the Gibbard-Satterthwaite theorem is computational complexity. For example, it is NP-hard to compute if the STV rule can be manipulated. However, there is...
111
click to vote
EUROCAST
2007
Springer
15 years 10 months ago
2007
Springer
After the detection of the first extrasolar planet (exoplanet) more than one decade ago we currently know about more than 200 planets around other stars and there are about twenty...
129
click to vote
CIG
2005
IEEE
15 years 10 months ago
2005
IEEE
This paper follows on from our previous work focused on formulating an efficient generic measure of user’s satisfaction (‘interest’) when playing predator/prey games. Viewin...
131
click to vote
RECOMB
2010
Springer
15 years 11 months ago
2010
Springer
Background: The empirical frequencies of DNA k-mers in whole genome sequences provide an interesting perspective on genomic complexity, and the availability of large segments of g...