1651 search results - page 7 / 331 » Measuring the Complexity of Classification Problems |
CIE
2008
Springer
13 years 7 months ago
2008
Springer
We study the complexity of the model checking problem, for fixed models A, over certain fragments L of first-order logic, obtained by restricting which of the quantifiers and boole...
CC
2006
Springer
13 years 7 months ago
2006
Springer
Abstract. We study the complexity of the isomorphism and automorphism problems for finite rings. We show that both integer factorization and graph isomorphism reduce to the problem...
CIARP
2005
Springer
14 years 1 months ago
2005
Springer
Tin Kam Ho and Ester Bernardò Mansilla in 2004 proposed to use data complexity measures to determine the domain of competition of the classifiers. They applied different classifie...
ICALP
2011
Springer
12 years 11 months ago
2011
Springer
Competitive analysis is the established tool for measuring the output quality of algorithms that work in an online environment. Recently, the model of advice complexity has been in...
LADS
2007
Springer
14 years 1 months ago
2007
Springer
Abstract The variety of existing agent-based simulations is overwhelming. However – especially when comparing agent-based simulation to other simulation paradigms, a reference fr...