14699 search results - page 274 / 2940 » Complexity and Cognitive Computing |
166
click to vote
ORDER
2010
15 years 2 months ago
2010
Embedding a partially ordered set into a product of chains is a classical way to encode it. Such encodings have been used in various fields such as object oriented programming or ...
144
click to vote
TCS
2011
14 years 11 months ago
2011
New, simple, proofs of soundness (every representable function lies in a given complexity class) for Elementary Affine Logic, LFPL and Soft Affine Logic are presented. The proofs ...
143
Voted
COMMA
2008
15 years 5 months ago
2008
This paper formulates in the first part some requirements for a certain sort of computational argumentation systems, namely those which are designed for a very specific purpose: to...
112
click to vote
COMPLEX
2009
Springer
15 years 10 months ago
2009
Springer
This paper recognises that comparisons have been made between the role of the conductor of an orchestra and leaders of enterprises, but that little note has been taken of how the c...
143
click to vote
DCC
2004
IEEE
16 years 3 months ago
2004
IEEE
We consider the problem of rate-distortion optimal streaming of packetized media with sender-driven transmission over a single-QoS network using feedback and retransmissions. For ...