Artif. Intell.最新文献_第10页

Concurrent forward bounding for distributed constraint optimization problems 分布式约束优化问题的并发正向边界

Artif. Intell. Pub Date : 2012-12-01 DOI: 10.1016/j.artint.2012.09.002

Arnon Netzer, Alon Grubshtein, A. Meisels

引用次数: 43

Normal and strong expansion equivalence for argumentation frameworks 论证框架的正规和强展开式等价

Artif. Intell. Pub Date : 2012-12-01 DOI: 10.1016/j.artint.2012.08.004

Ringo Baumann

引用次数: 62

Planning as satisfiability: Heuristics 作为可满足性的计划:启发式

Artif. Intell. Pub Date : 2012-12-01 DOI: 10.1016/j.artint.2012.08.001

J. Rintanen

引用次数: 154

On truth-gaps, bipolar belief and the assertability of vague propositions 论真理鸿沟、两极信念与模糊命题的可断言性

Artif. Intell. Pub Date : 2012-11-01 DOI: 10.1016/j.artint.2012.07.004

J. Lawry, Yongchuan Tang

引用次数: 24

Applicability conditions for plans with loops: Computability results and algorithms 循环计划的适用条件:可计算性结果和算法

Artif. Intell. Pub Date : 2012-11-01 DOI: 10.1016/j.artint.2012.07.005

Siddharth Srivastava, N. Immerman, S. Zilberstein

引用次数: 14

GAMoN: Discovering M-of-N{¬, ∨} hypotheses for text classification by a lattice-based Genetic Algorithm GAMoN:通过基于格的遗传算法发现文本分类的M-of-N{¬，∨}假设

Artif. Intell. Pub Date : 2012-11-01 DOI: 10.1016/j.artint.2012.07.003

Veronica L. Policicchio, Adriana Pietramala, P. Rullo

引用次数: 5

A Branch and Prune Algorithm for the Computation of Generalized Aspects of Parallel Robots 并联机器人广义方面计算的分支与剪枝算法

Artif. Intell. Pub Date : 2012-10-08 DOI: 10.1007/978-3-642-33558-7_62

Stéphane Caro, Damien Chablat, A. Goldsztejn, Daisuke Ishii, C. Jermann

引用次数: 28

Ordered completion for logic programs with aggregates 具有聚合的逻辑程序的有序完成

Artif. Intell. Pub Date : 2012-07-22 DOI: 10.1016/j.artint.2015.03.007

Vernon Asuncion, Yin Chen, Yan Zhang, Yi Zhou

引用次数: 13

Optimal social choice functions: a utilitarian view 最优社会选择函数:功利主义观点

Artif. Intell. Pub Date : 2012-06-04 DOI: 10.1145/2229012.2229030

Craig Boutilier, I. Caragiannis, Simi Haber, Tyler Lu, A. Procaccia, Or Sheffet

{"title":"Optimal social choice functions: a utilitarian view","authors":"Craig Boutilier, I. Caragiannis, Simi Haber, Tyler Lu, A. Procaccia, Or Sheffet","doi":"10.1145/2229012.2229030","DOIUrl":"https://doi.org/10.1145/2229012.2229030","url":null,"abstract":"We adopt a utilitarian perspective on social choice, assuming that agents have (possibly latent) utility functions over some space of alternatives. For many reasons one might consider mechanisms, or social choice functions, that only have access to the ordinal rankings of alternatives by the individual agents rather than their utility functions. In this context, one possible objective for a social choice function is the maximization of (expected) social welfare relative to the information contained in these rankings. We study such optimal social choice functions under three different models, and underscore the important role played by scoring functions. In our worst-case model, no assumptions are made about the underlying distribution and we analyze the worst-case distortion---or degree to which the selected alternative does not maximize social welfare---of optimal social choice functions. In our average-case model, we derive optimal functions under neutral (or impartial culture) distributional models. Finally, a very general learning-theoretic model allows for the computation of optimal social choice functions (i.e., that maximize expected social welfare) under arbitrary, sampleable distributions. In the latter case, we provide both algorithms and sample complexity results for the class of scoring functions, and further validate the approach empirically.","PeriodicalId":8496,"journal":{"name":"Artif. Intell.","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2012-06-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"86806414","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 175

Importance sampling-based estimation over AND/OR search spaces for graphical models 基于重要性抽样的图形模型AND/OR搜索空间估计

Artif. Intell. Pub Date : 2012-06-01 DOI: 10.1016/j.artint.2012.03.001

Vibhav Gogate, R. Dechter

引用次数: 16