2490 search results - page 438 / 498 » Complexity of Contextual Reasoning |
109
click to vote
BMCBI
2010
14 years 10 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 ...
CORR
2010
Springer
14 years 10 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...
CORR
2008
Springer
14 years 10 months ago
2008
Springer
Linearity tests are randomized algorithms which have oracle access to the truth table of some function f, and are supposed to distinguish between linear functions and functions whi...
JAPLL
2008
14 years 10 months ago
2008
In this paper, we study the following basic problem: After having executed a sequence of actions, find a sequence of actions that brings the agent back to the state just before th...
111
click to vote
CSI
2007
14 years 10 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 ...