journal of artificial intelligence research سال:2018 - دوره:61

Fa | Ar | En


journal of artificial intelligence research
سال:2018 - دوره:61 - شماره:0

actively estimating crowd annotation consensus - صفحه:363-405 belief update within propositional fragments - صفحه:807-834 bisimulations on data graphs - صفحه:171-213 coordinating measurements for environmental monitoring in uncertain participatory sensing settings - صفحه:433-474 corpus-level fine-grained entity typing - صفحه:835-862 cycles and intractability in a large class of aggregation rules - صفحه:407-431 distributed constraint optimization problems and applications: a survey - صفحه:623-698 fact-alternating mutex groups for classical planning - صفحه:475-521 from feature to paradigm: deep learning in machine translation - صفحه:947-974 from skills to symbols: learning symbolic representations for abstract high-level planning - صفحه:215-289 fully observable non-deterministic planning as assumption-based reactive synthesis - صفحه:593-621 kaboum: knowledge-level action and bounding geometry motion planner - صفحه:323-362 learning explanatory rules from noisy data - صفحه:65-170 linear satisfiability preserving assignments - صفحه:291-321 on the behavior of convolutional nets for feature extraction - صفحه:563-592 pre-wiring and pre-training: what does a neural network need to learn truly general identity rules? - صفحه:927-946 rademacher complexity bounds for a penalized multi-class semi-supervised algorithm - صفحه:761-786 revisiting the arcade learning environment: evaluation protocols and open problems for general agents - صفحه:523-562 smote for learning from imbalanced data: progress and challenges, marking the 15-year anniversary - صفحه:863-905 survey of the state of the art in natural language generation: core tasks, applications and evaluation - صفحه:1-64 symbol grounding association in multimodal sequences with missing elements - صفحه:787-806 trust as a precursor to belief revision - صفحه:699-722 visualisation and ‘diagnostic classifiers’ reveal how recurrent and recursive neural networks process hierarchical structure - صفحه:907-926 when subgraph isomorphism is really hard, and why this matters for graph databases - صفحه:723-759