Digital Library
Close Browse articles from a journal
     Journal description
       All volumes of the corresponding journal
         All issues of the corresponding volume
                                       All articles of the corresponding issues
 
                             25 results found
no title author magazine year volume issue page(s) type
1 Analysis of a probabilistic model of redundancy in unsupervised information extraction Downey, Doug
2010
199-200 11 p. 726-748
23 p.
article
2 Analyzing the degree of conflict among belief functions Liu, Weiru
2006
199-200 11 p. 909-924
16 p.
article
3 A probabilistic plan recognition algorithm based on plan tree grammars Geib, Christopher W.
2009
199-200 11 p. 1101-1132
32 p.
article
4 Backward-chaining evolutionary algorithms Poli, Riccardo
2006
199-200 11 p. 953-982
30 p.
article
5 Computer-aided proofs of Arrow's and other impossibility theorems Tang, Pingzhong
2009
199-200 11 p. 1041-1053
13 p.
article
6 Contractor programming Chabert, Gilles
2009
199-200 11 p. 1079-1100
22 p.
article
7 Decentralized MDPs with sparse interactions Melo, Francisco S.
2011
199-200 11 p. 1757-1789
33 p.
article
8 Designing competitions between teams of individuals Tang, Pingzhong
2010
199-200 11 p. 749-766
18 p.
article
9 Editorial Board 2009
199-200 11 p. IFC-
1 p.
article
10 Editorial Board 2010
199-200 11 p. IFC-
1 p.
article
11 Editorial Board 2006
199-200 11 p. CO2-
1 p.
article
12 Editorial Board 2008
199-200 11 p. IFC-
1 p.
article
13 Event calculus and temporal action logics compared Mueller, Erik T.
2006
199-200 11 p. 1017-1029
13 p.
article
14 Generating and evaluating evaluative arguments Carenini, Giuseppe
2006
199-200 11 p. 925-952
28 p.
article
15 Imprecise probability trees: Bridging two theories of imprecise probability de Cooman, Gert
2008
199-200 11 p. 1400-1427
28 p.
article
16 Learning conditional preference networks Koriche, Frédéric
2010
199-200 11 p. 685-703
19 p.
article
17 Monte-Carlo tree search and rapid action value estimation in computer Go Gelly, Sylvain
2011
199-200 11 p. 1856-1875
20 p.
article
18 Monte Carlo tree search in Kriegspiel Ciancarini, Paolo
2010
199-200 11 p. 670-684
15 p.
article
19 Partial observability and learnability Michael, Loizos
2010
199-200 11 p. 639-669
31 p.
article
20 Planning to see: A hierarchical approach to planning visual actions on a robot using POMDPs Sridharan, Mohan
2010
199-200 11 p. 704-725
22 p.
article
21 Range and Roots: Two common patterns for specifying and propagating counting and occurrence constraints Bessiere, Christian
2009
199-200 11 p. 1054-1078
25 p.
article
22 Redundancy in logic III: Non-monotonic reasoning Liberatore, Paolo
2008
199-200 11 p. 1317-1359
43 p.
article
23 Semiring induced valuation algebras: Exact and approximate local computation algorithms Kohlas, J.
2008
199-200 11 p. 1360-1399
40 p.
article
24 Solving conflicts in information merging by a flexible interpretation of atomic propositions Schockaert, Steven
2011
199-200 11 p. 1815-1855
41 p.
article
25 The complexity of soft constraint satisfaction Cohen, David A.
2006
199-200 11 p. 983-1016
34 p.
article
                             25 results found
 
 Koninklijke Bibliotheek - National Library of the Netherlands