17541 search results - page 111 / 3509 » Complexity in scalable computing |
111
click to vote
CIE
2005
Springer
16 years 7 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...
151
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...
149
click to vote
ICMCS
2005
IEEE
16 years 9 days ago
2005
IEEE
We study the problem of rate-distortion optimal packetization with uneven erasure protection (UEP) of scalable source sequence, into multiple groups of packets. The grouping of pa...
171
Voted
NIPS
2004
15 years 8 months ago
2004
Existing algorithms for discrete partially observable Markov decision processes can at best solve problems of a few thousand states due to two important sources of intractability:...
175
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 ...