Bài tập về nhà bài đọc các bài tạp chí AI

BÀI TẬP VỀ NHÀ.. Chọn một trong các bài báo chuyên ngành trí tuệ nhân tạo danh sách bài báo theo nhóm bài tập lớn: 2 tuần Sinh viên đọc chọn một trong các bài chuyên đề / bài báo theo đ

Trang 1

BÀI TẬP VỀ NHÀ Chọn một trong các bài báo chuyên ngành trí tuệ nhân tạo danh sách bài báo (theo nhóm bài tập lớn: 2

tuần)

Sinh viên đọc chọn một trong các bài chuyên đề / bài báo theo địa chỉ Website

- Đọc hiểu bài báo

- Viết tóm tắt bài báo và biểu diễn ví dụ minh họa cụ thể từng bước đi kèm

- Mô tả các bước mô hình/ giải thuật/ thuật toán nếu có bằng cách biểu diễn qua ví dụ

- Trình bày điểm mới trong bài báo và nêu các ứng dụng có thể áp dụng

Ghi chú: Không giới hạn số trang báo cáo

Thời hạn nộp nhóm đăng ký cho lớp trưởng / cán bộ lớp: 17/7/2013

Thời gian nộp bài bản phần mềm: 30/7/2013

Bản in gửi tại lớp: 30/7/2013

J Velez, G Hemann, A S Huang, I Posner and N Roy (2012) "Modelling Observation

Correlations for Active Exploration and Robust Object Detection ", Volume 44, pages 423-453 ICAPS 2011 Best Student Paper

Abstract | PDF | PostScript | doi:10.1613/jair.3516

L R Planken, M M de Weerdt and R P.J van der Krogt (2012) "Computing All-Pairs Shortest Paths by Leveraging Low Treewidth", Volume 43, pages 353-388 ICAPS 2011 Honorable

Mention for Best Student Paper

P Vytelingum, T D Voice, S D Ramchurn, A Rogers and N R Jennings (2011) "Theoretical and Practical Foundations of Large-Scale Agent-Based Micro-Storage in the Smart Grid", Volume 42, pages 765-813 AAMAS 2010 iRobot Best Paper Award

R Huang, Y Chen and W Zhang (2012) "SAS+ Planning as Satisfiability", Volume 43, pages 293-328 AAAI 2010 Outstanding Paper Award

Trang 2

A Krause and C Guestrin (2009) "Optimal Value of Information in Graphical Models", Volume

35, pages 557-591 Honorable Mention for the 2012 IJCAI-JAIR Best Paper Prize

Appendix 1 - Erratum | Appendix 2 - Original Version

H Palacios and H Geffner (2009) "Compiling Uncertainty Away in Conformant Planning

Problems with Bounded Width", Volume 35, pages 623-675 2012 IJCAI-JAIR Best Paper Prize

L Xu, F Hutter, H H Hoos and K Leyton-Brown (2008) "SATzilla: Portfolio-based Algorithm Selection for SAT", Volume 32, pages 565-606 2010 IJCAI-JAIR Best Paper Prize

S P Ponzetto and M Strube (2007) "Knowledge Derived From Wikipedia For Computing

Semantic Relatedness", Volume 30, pages 181-212 Honorable Mention for the 2010 IJCAI-JAIR Best Paper Prize

N Nisan and A Ronen (2007) "Computationally Feasible VCG Mechanisms", Volume 29, pages 19-47 2011 IJCAI-JAIR Best Paper Prize

M Helmert (2006) "The Fast Downward Planning System", Volume 26, pages 191-246 Honorable Mention for the 2009 IJCAI-JAIR Best Paper Prize

Appendix - Experimental results

A Fern, S Yoon and R Givan (2006) "Approximate Policy Iteration with a Policy Language Bias: Solving Relational Markov Decision Processes", Volume 25, pages 75-118 Honorable Mention for the 2011 IJCAI-JAIR Best Paper Prize

G Gottlob, G Greco and F Scarcello (2005) "Pure Nash Equilibria: Hard and Easy Games", Volume 24, pages 357-406 2008 IJCAI-JAIR Best Paper Prize

Trang 3

A Felner, R E Korf and S Hanan (2004) "Additive Pattern Database Heuristics", Volume 22, pages 279-318 Honorable Mention for the 2007 IJCAI-JAIR Best Paper Prize

P Beame, H Kautz and A Sabharwal (2004) "Towards Understanding and Harnessing the Potential of Clause Learning", Volume 22, pages 319-351 Honorable Mention for the 2008 IJCAI-JAIR Best Paper Prize

Abstract | PDF | PostScript | HTML | doi:10.1613/jair.1410

C Boutilier, R I Brafman, C Domshlak, H H Hoos and D Poole (2004) "CP-nets: A Tool for Representing and Reasoning withConditional Ceteris Paribus Preference Statements", Volume

21, pages 135-191 2009 IJCAI-JAIR Best Paper Prize

C Guestrin, D Koller, R Parr and S Venkataraman (2003) "Efficient Solution Algorithms for Factored MDPs", Volume 19, pages 399-468 2007 IJCAI-JAIR Best Paper Prize

A Darwiche and P Marquis (2002) "A Knowledge Compilation Map", Volume 17, pages 229-264

2006 IJCAI-JAIR Best Paper Prize

J Hoffmann and B Nebel (2001) "The FF Planning System: Fast Plan Generation Through Heuristic Search", Volume 14, pages 253-302 2005 IJCAI-JAIR Best Paper Prize

Appendix 1 - PDDL files, raw data and experimental results (gzipped | Appendix 2 - Evaluation domains and instance generators | Appendix 3 - C code for FF-v2.2 as used in AIPS-2000

competition

M L Ginsberg (2001) "GIB: Imperfect Information in a Computationally Challenging Game", Volume 14, pages 303-358 Honorable Mention for the 2006 IJCAI-JAIR Best Paper Prize

J Cheng and M J Druzdzel (2000) "AIS-BN: An Adaptive Importance Sampling Algorithm for Evidential Reasoning in Large Bayesian Networks", Volume 13, pages 155-188 Honorable Mention for the 2005 IJCAI-JAIR Best Paper Prize

Trang 4

T G Dietterich (2000) "Hierarchical Reinforcement Learning with the MAXQ Value Function Decomposition", Volume 13, pages 227-303 2003 IJCAI-JAIR Best Paper Prize

F Ygge and H Akkermans (1999) "Decentralized Markets versus Central Control: A

Comparative Study", Volume 11, pages 301-333 2004 IJCAI-JAIR Best Paper Prize

D Fox, W Burgard and S Thrun (1999) "Markov Localization for Mobile Robots in Dynamic Environments", Volume 11, pages 391-427 Honorable Mention for the 2004 IJCAI-JAIR Best Paper Prize

Appendix - Movies

M L Littman, J Goldsmith and Mundhenk M (1998) "The Computational Complexity of

Probabilistic Planning", Volume 9, pages 1-36 Honorable Mention for the 2003 IJCAI-JAIR Best Paper Prize

M Tambe (1997) "Towards Flexible Teamwork", Volume 7, pages 83-124 2012 IFAAMAS Award for Influential Papers in Autonomous Agents and Multiagent Systems

Appendix -

M P Wellman (1993) "A Market-Oriented Programming Environment and its Application to Distributed Multicommodity Flow Problems", Volume 1, pages 1-23 2012 IFAAMAS Award for Influential Papers in Autonomous Agents and Multiagent Systems

F Belardinelli and A Lomuscio (2012) "Interactions between Knowledge and Time in a First-Order Logic for Multi-Agent Systems: Completeness Results", Volume 45, pages 1-45

D A Cohen, M C Cooper, P Creed, D Marx and A Z Salamon (2012) "The Tractability of CSP Classes Defined by Forbidden Patterns", Volume 45, pages 47-78

Trang 5

H Vlaeminck, J Vennekens, M Denecker and M Bruynooghe (2012) "An approximative

inference method for solving ∃∀SO satisfiability problems", Volume 45, pages 79-124

S.A Mirroshandel and G Ghassem-Sani (2012) "Towards Unsupervised Learning of Temporal Relations between Events", Volume 45, pages 125-163

Appendix - Erratum

T Voice, M Polukarov and N R Jennings (2012) "Coalition Structure Generation over Graphs", Volume 45, pages 165-196

B Cuenca Grau and B Motik (2012) "Reasoning over Ontologies with Hidden Content: The Import-by-Query Approach", Volume 45, pages 197-255

R Hoshino and K Kawarabayashi (2012) "Generating Approximate Solutions to the TTP using a Linear Distance Relaxation", Volume 45, pages 257-286

P Gutierrez and P Meseguer (2012) "Removing Redundant Messages in N-ary BnB-ADOPT", Volume 45, pages 287-304

Appendix - Erratum

A M Rush and M J Collins (2012) "A Tutorial on Dual Decomposition and Lagrangian

Relaxation for Inference in Natural Language Processing", Volume 45, pages 305-362

R A Rossi, L K McDowell, D W Aha and J Neville (2012) "Transforming Graph Data for Statistical Relational Learning", Volume 45, pages 363-441

I Abío, R Nieuwenhuis, A Oliveras, E Rodríguez-Carbonell and V Mayer-Eichberger (2012)

"A New Look at BDDs for Pseudo-Boolean Constraints", Volume 45, pages 443-480

Trang 6

U Endriss, U Grandi and D Porello (2012) "Complexity of Judgment Aggregation", Volume 45, pages 481-514

J Garcia and F Fernandez (2012) "Safe Exploration of State and Action Spaces in

Reinforcement Learning", Volume 45, pages 515-564

R I Brafman and G Shani (2012) "Replanning in Domains with Partial Information and Sensing Actions", Volume 45, pages 565-600

G de Cooman and E Miranda (2012) "Irrelevant and independent natural extension for sets of desirable gambles", Volume 45, pages 601-640

K Radinsky, S Davidovich and S Markovitch (2012) "Learning to Predict from Textual Data", Volume 45, pages 641-684

H T Dinh, H T Dinh, L Michel and A Russell (2012) "The Time Complexity of A* with

Approximate Heuristics on Multiple-Solution Search Spaces", Volume 45, pages 685-729

M Bodirsky and M Hils (2012) "Tractable Set Constraints", Volume 45, pages 731-759

M R Costa-jussà, C A Henríquez and R E Banchs (2012) "Evaluating Indirect Strategies for Chinese-Spanish Statistical Machine Translation", Volume 45, pages 761-780

G Wang, Q Song, H Sun, X Zhang, B Xu and Y Zhou (2013) "A Feature Subset Selection Algorithm Automatic Recommendation Method", Volume 47, pages 1-34

M Aramon Bajestani and J C Beck (2013) "Scheduling a Dynamic Aircraft Repair Shop with Limited Repair Resources", Volume 47, pages 35-70

Trang 7

S Vesic (2013) "Identifying the Class of Maxi-Consistent Operators in Argumentation", Volume

47, pages 71-93

J C Boerkoel Jr and E H Durfee (2013) "Distributed Reasoning for Multiagent Simple

Temporal Problems", Volume 47, pages 95-156

Appendix - Formal proofs

R Mourad, C Sinoquet, N L Zhang, T Liu and P Leray (2013) "A Survey on Latent Tree Models and Applications", Volume 47, pages 157-203

G Tesauro, D C Gondek, J Lenchner, J Fan and J M Prager (2013) "Analysis of Watson's Strategies for Playing Jeopardy!", Volume 47, pages 205-251

M G Bellemare, Y Naddaf, J Veness and M Bowling (2013) "The Arcade Learning

Environment: An Evaluation Platform for General Agents", Volume 47, pages 253-279

Y Bachrach, E Porat and J S Rosenschein (2013) "Sharing Rewards in Cooperative

Connectivity Games", Volume 47, pages 281-311

P R Costa and L M Botelho (2013) "Learning by Observation of Agent Software Images", Volume 47, pages 313-349

W Faber, M Truszczyński and S Woltran (2013) "Strong Equivalence of Qualitative

Optimization Problems", Volume 47, pages 351-391

N Taghipour, D Fierens, J Davis and H Blockeel (2013) "Lifted Variable Elimination:

Decoupling the Operators from the Constraint Language", Volume 47, pages 393-439

Trang 8

A J Coles, A I Coles, M Fox and D Long (2012) "COLIN: Planning with Continuous Linear Numeric Change", Volume 44, pages 1-96

Appendix - Data Files

D D Maua, C P de Campos and M Zaffalon (2012) "Solving Limited Memory Influence

Diagrams", Volume 44, pages 97-140

C Bäckström and P Jonsson (2012) "Algorithms and Limits for Compact Plan Representations", Volume 44, pages 141-177

P Nakov and H T Ng (2012) "Improving Statistical Machine Translation for a Resource-Poor Language Using Related Resource-Rich Languages", Volume 44, pages 179-222

W Mao and J Gratch (2012) "Modeling Social Causality and Responsibility Judgment in Multi-Agent Interactions", Volume 44, pages 223-273

P Ghosh, A Sharma, P.P Chakrabarti and P Dasgupta (2012) "Algorithms for Generating Ordered Solutions for Explicit AND/OR Structures", Volume 44, pages 275-333

M Fox, D Long and D Magazzeni (2012) "Plan-based Policies for Efficient Multiple Battery Load Management", Volume 44, pages 335-382 ICAPS 2011 Best Paper Award

P Haslum (2012) "Narrative Planning: Compilations to Classical Planning", Volume 44, pages 383-395

Appendix - Source coder and example problems

E Albacete, J Calle, E Castro and D Cuadra (2012) "Semantic Similarity Measures Applied to

an Ontology for Human-Like Interaction", Volume 44, pages 397-421

Trang 9

J Velez, G Hemann, A S Huang, I Posner and N Roy (2012) "Modelling Observation

Correlations for Active Exploration and Robust Object Detection ", Volume 44, pages 423-453 ICAPS 2011 Best Student Paper

M C Cooper and S Zivny (2012) "Tractable Triangles and Cross-Free Convexity in Discrete Optimisation", Volume 44, pages 455-490

J Huang, A Kapoor and C Guestrin (2012) "Riffled Independence for Efficient Inference with Partial Rankings", Volume 44, pages 491-532

P D Turney (2012) "Domain and Function: A Dual-Space Model of Semantic Relations and Compositions", Volume 44, pages 533-585

Appendix - Dataset containing 2,180 seven-choice questions

J Hoffmann, I Weber and F M Kraft (2012) "SAP Speaks PDDL: Exploiting a

Software-Engineering Model for Planning in Business Process Management", Volume 44, pages 587-632

B Konev, M Ludwig, D Walther and F Wolter (2012) "The Logical Difference for the

Lightweight Description Logic EL", Volume 44, pages 633-708

C Domshlak, E Karpas and S Markovitch (2012) "Online Speedup Learning for Optimal

Planning", Volume 44, pages 709-755

P Nightingale, I P Gent, C Jefferson and I Miguel (2013) "Short and Long Supports for

Constraint Propagation", Volume 46, pages 1-45

E Huang and R E Korf (2013) "Optimal Rectangle Packing: An Absolute Placement Approach", Volume 46, pages 47-87

Trang 10

C Sauper and R Barzilay (2013) "Automatic Aggregation by Joint Modeling of Aspects and Values", Volume 46, pages 89-127

M Guo, E Markakis, K R Apt and V Conitzer (2013) "Undominated Groves Mechanisms", Volume 46, pages 129-163

V Qazvinian, D R Radev, S M Mohammad, B Dorr, D Zajic, M Whidby and T Moon (2013)

"Generating Extractive Summaries of Scientific Paradigms", Volume 46, pages 165-201

H Zhao, X Zhang and C Kit (2013) "Integrative Semantic Dependency Parsing via Efficient Large-scale Feature Selection", Volume 46, pages 203-233

Appendix - Feature templates data set

N Goernitz, M Kloft, K Rieck and U Brefeld (2013) "Toward Supervised Anomaly Detection", Volume 46, pages 235-262

S Ordyniak and S Szeider (2013) "Parameterized Complexity Results for Exact Bayesian

Network Structure Learning", Volume 46, pages 263-302

A Metodi, M Codish and P J Stuckey (2013) "Boolean Equi-propagation for Concise and Efficient SAT Encodings of Combinatorial Problems", Volume 46, pages 303-341

A Coles, A Coles, M Fox and D Long (2013) "A Hybrid LP-RPG Heuristic for Modelling Numeric Resource Flows in Planning", Volume 46, pages 343-412

Appendix - The complete set of domain and problem files used for data generation

N A Snooke and M H Lee (2013) "Qualitative Order of Magnitude Energy-Flow-Based Failure Modes and Effects Analysis", Volume 46, pages 413-447

Định dạng
Số trang	11
Dung lượng	160 KB