4066 search results - page 186 / 814 » Almost Complete Sets |
143
click to vote
ARGMAS
2005
Springer
16 years 1 days ago
2005
Springer
In our previous work on dialogue games for agent interaction, an agent’s set of beliefs (Σ) and an agent’s “commitment store” (CS) — the set of locutions uttered by the ...
150
click to vote
CLIMA
2010
15 years 8 months ago
2010
The paper considers interdependencies between secrets in a multiparty system. Each secret is assumed to be known only to a certain fixed set of parties. These sets can be viewed as...
203
click to vote
MCU
1998
15 years 7 months ago
1998
A BSS machine is -uniform if it does not use exact tests; such machines are equivalent (modulo parameters) to Type 2 Turing machines. We define a notion of closure related to Turi...
162
click to vote
CSDA
2007
15 years 6 months ago
2007
Random k-nearest-neighbour (RKNN) imputation is an established algorithm for filling in missing values in data sets. Assume that data are missing in a random way, so that missing...
203
click to vote
AI
2011
Springer
15 years 1 months ago
2011
Springer
The concept of a stable model provided a declarative semantics for Prolog programs with negation as failure and became a starting point for the development of answer set programmi...