14699 search results - page 121 / 2940 » Complexity and Cognitive Computing |
LICS
2008
IEEE
14 years 5 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 ...
CIE
2005
Springer
14 years 4 months 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...
ECAL
2001
Springer
14 years 3 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...
CIAC
2010
Springer
14 years 8 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 ...
SAGT
2009
Springer
14 years 5 months ago
2009
Springer
Abstract. We continue the recently initiated study of the computational aspects of weak saddles, an ordinal set-valued solution concept proposed by Shapley. Brandt et al. gave a po...