2139 search results - page 266 / 428 » Complexity of Agents and Complexity of Markets |
159
click to vote
AAAI
1998
15 years 7 months ago
1998
Unit resolution is arguably the most useful known algorithm for tractable reasoning in propositional logic. Intuitively, if one knows a, b, and a b c, then c should be an obviou...
131
click to vote
AAAI
1998
15 years 7 months ago
1998
The typical difficulty of various NP-hard problems varies with simple parameters describing their structure. This behavior is largely independent of the search algorithm, but depe...
174
click to vote
AAAI
1998
15 years 7 months ago
1998
We investigate two forms of dependence between variables and/or formulas within a propositional knowledge base: controllability (a set of variables X controls a formula , if there...
157
click to vote
AAAI
2000
15 years 7 months ago
2000
We present a new algorithm that reduces the space complexity of heuristic search. It is most effective for problem spaces that grow polynomially with problem size, but contain lar...
175
click to vote
ICMAS
1998
15 years 7 months ago
1998
After arguing about the crucial importance of trust for Agents and MAS, we provide a definition of trust both as a mental state and as a social attitude and relation. We present t...