2168 search results - page 225 / 434 » Randomized Algorithms and Complexity Theory |
117
Voted
JCSS
2007
15 years 3 months ago
2007
We consider the problem of counting the number of lattice vectors of a given length and prove several results regarding its computational complexity. We show that the problem is ā...
154
click to vote
SAGT
2010
Springer
15 years 2 months ago
2010
Springer
We study the computational complexity of ļ¬nding stable outcomes in symmetric additively-separable hedonic games. These coalition formation games are speciļ¬ed by an undirected e...
126
click to vote
FOCM
2011
14 years 7 months ago
2011
The theory of intersection homology was developed to study the singularities of a topologically stratiļ¬ed space. This paper incorporates this theory into the already developed f...
124
click to vote
AAAI
2006
15 years 5 months ago
2006
We establish a declarative theory of forgetting for disjunctive logic programs. The suitability of this theory is justified by a number of desirable properties. In particular, one...
149
click to vote
CI
2006
15 years 3 months ago
2006
This paper investigates decision-theoretic planning in sophisticated autonomous agents operating in environments of real-world complexity. An example might be a planetary rover ex...