19320 search results - page 123 / 3864 » On the complexity of computing determinants |
182
click to vote
AAAI
2010
15 years 8 months ago
2010
Recently, algorithms for computing game-theoretic solutions have been deployed in real-world security applications, such as the placement of checkpoints and canine units at Los An...
163
click to vote
LICS
2008
IEEE
16 years 1 months ago
2008
IEEE
Using appropriate notation systems for proofs, cutreduction can often be rendered feasible on these notations. Explicit bounds can be given. Developing a suitable notation system ...
112
click to vote
CIE
2005
Springer
16 years 10 days ago
2005
Springer
Abstract. We prove that the one-dimensional sandpile prediction problem is in AC1 . The previously best known upper bound on the ACi -scale was AC2 . We also prove that it is not i...
154
click to vote
ECAL
2001
Springer
15 years 11 months ago
2001
Springer
Abstract. In this paper we explore the similarities between a mathematical model of language evolution and several A-life simulations. We argue that the mathematical model makes so...
177
click to vote
CIAC
2010
Springer
16 years 4 months ago
2010
Springer
Abstract. Given a binary dominance relation on a set of alternatives, a common thread in the social sciences is to identify subsets of alternatives that satisfy certain notions of ...