2214 search results - page 383 / 443 » Complexity of Reasoning |
167
click to vote
BMCBI
2010
15 years 3 months ago
2010
Background: Generally speaking, different classifiers tend to work well for certain types of data and conversely, it is usually not known a priori which algorithm will be optimal ...
118
click to vote
CORR
2010
Springer
15 years 3 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...
156
click to vote
CSI
2007
15 years 3 months ago
2007
The Reference Model of Open Distributed Processing (RM-ODP) is a joint standardization effort by ITU-T and ISO/IEC for the specification of large open distributed systems. RM-ODP ...
128
click to vote
FAC
2007
15 years 2 months ago
2007
Abstract. We report on a case study in applying different formal methods to model and verify an architecture for administrating digital signatures. The architecture comprises seve...
160
click to vote
IJBRA
2007
15 years 2 months ago
2007
: In this paper we explore issues in the development of the my Grid ontology, which is an OWL ontology designed to support service discovery through service annotation. There are c...