11160 search results - page 285 / 2232 » Incompleteness in a General Setting |
138
click to vote
HICSS
2003
IEEE
15 years 11 months ago
2003
IEEE
We adopt the decision-theoretic principle of expected utility maximization as a paradigm for designing autonomous rational agents operating in multi-agent environments. We use the...
149
click to vote
ICIP
1998
IEEE
15 years 10 months ago
1998
IEEE
: While lattice vector quantization (LVQ) can solve the complexity problem of LBG based vector quantizers, and also yield very general codebooks, a single stage lattice VQ, when ap...
104
click to vote
IDA
1997
Springer
15 years 10 months ago
1997
Springer
The empirical curve bounding problem is de ned as follows. Suppose data vectors X Y are presented such that E(Y i]) = f(X i]) where f(x) is an unknown function. The problem is to a...
169
click to vote
ICLP
2010
Springer
15 years 10 months ago
2010
Springer
Answer-set programming (ASP) is a well-known formalism for declarative problem solving, enjoying a continuously increasing number of diverse applications. However, arguably one of ...
193
click to vote
ASAP
2004
IEEE
15 years 9 months ago
2004
IEEE
Binary finite fields GF(2n ) are very commonly used in cryptography, particularly in publickey algorithms such as Elliptic Curve Cryptography (ECC). On word-oriented programmable ...