


default search action
21st IJCAI 2009: Pasadena, California, USA
- Craig Boutilier:

IJCAI 2009, Proceedings of the 21st International Joint Conference on Artificial Intelligence, Pasadena, California, USA, July 11-17, 2009. 2009 - Preface.

- IJCAI-09 Conference Organization.

- IJCAI-09 Sponsorship.

- IJCAI-09 Awards and Distinguished Papers.

- IJCAI-09 Keynote and Invited Speakers.

- Events Colocated with IJCAI-09.

- IJCAI Organization.

- AAAI Organization.

- Past IJCAI Conferences.

Invited Talks
- Cristina Conati:

Intelligent Tutoring Systems: New Challenges and Directions. 2-7 - Thomas G. Dietterich:

Machine Learning in Ecosystem Informatics and Sustainability. 8-13 - Luc Steels, Michael Spranger:

How Experience of the Body Shapes Language about Space. 14-19 - Qiang Yang:

Activity Recognition: Linking Low-level Sensors to High-level Intelligence. 20-25
Agent-based and Multiagent Systems
- Alon Altman, Ariel D. Procaccia, Moshe Tennenholtz:

Nonmanipulable Selections from a Tournament. 27-32 - Dimitrios Antos, Avi Pfeffer:

Using Reasoning Patterns to Help Humans Solve Complex Games. 33-39 - Radha-Krishna Balla, Alan Fern:

UCT for Tactical Assault Planning in Real-Time Strategy Games. 40-45 - Michael Benisch, Norman M. Sadeh, Tuomas Sandholm:

Methodology for Designing Reasonably Expressive Mechanisms with Application to Ad Auctions. 46-52 - Nadja Betzler, Susanne Hemmann, Rolf Niedermeier:

A Multivariate Complexity Analysis of Determining Possible Winners Given Incomplete Votes. 53-58 - Richard B. Borie, Craig A. Tovey, Sven Koenig:

Algorithms and Complexity Results for Pursuit-Evasion Problems. 59-66 - Sylvain Bouveret, Ulle Endriss, Jérôme Lang:

Conditional Importance Networks: A Graphical Language for Representing Ordinal, Monotonic Preferences over Sets of Goods. 67-72 - Ronen I. Brafman, Carmel Domshlak, Yagil Engel, Moshe Tennenholtz:

Planning Games. 73-78 - Simina Brânzei, Kate Larson:

Coalitional Affinity Games and the Stability Gap. 79-84 - Georgios Chalkiadakis, Edith Elkind, Nicholas R. Jennings:

Simple Coalitional Games with Beliefs. 85-90 - Federico Chesani, Paola Mello, Marco Montali, Paolo Torroni:

Commitment Tracking via the Reactive Event Calculus. 91-96 - Yann Chevaleyre, Jérôme Lang, Nicolas Maudet, Guillaume Ravilly-Abadie:

Compiling the Votes of a Subelectorate. 97-102 - Vincent Conitzer, Jérôme Lang, Lirong Xia:

How Hard Is It to Control Sequential Elections via the Agenda? 103-108 - Vincent Conitzer, Matthew Rognlie, Lirong Xia:

Preference Functions that Score Rankings and Maximum Likelihood Estimation. 109-115 - Quang Duong, Yevgeniy Vorobeychik, Satinder Singh, Michael P. Wellman:

Learning Graphical Game Models. 116-121 - Ulle Endriss, Maria Silvia Pini, Francesca Rossi, Kristen Brent Venable:

Preference Aggregation over Restricted Ballot Languages: Sincerity and Strategy-Proofness. 122-127 - Piotr Faliszewski, Edith Hemaspaandra, Lane A. Hemaspaandra:

Multimode Control Attacks on Elections. 128-133 - Valeria Fionda, Gianluigi Greco:

Charting the Tractability Frontier of Mixed Multi-Unit Combinatorial Auctions. 134-139 - Sam Ganzfried, Tuomas Sandholm:

Computing Equilibria in Multiplayer Stochastic Games of Imperfect Information. 140-146 - Gianluigi Greco, Enrico Malizia, Luigi Palopoli, Francesco Scarcello:

On the Complexity of Compact Coalitional Games. 147-152 - Joseph Y. Halpern, Rafael Pass:

Iterated Regret Minimization: A New Solution Concept. 153-158 - Erik Halvorson, Vincent Conitzer, Ronald Parr:

Multi-Step Multi-Sensor Hider-Seeker Games. 159-166 - Noam Hazon, Yonatan Aumann, Sarit Kraus:

Collaborative Multi Agent Physical Search with Probabilistic Knowledge. 167-174 - Laura M. Hiatt, Terry L. Zimmerman, Stephen F. Smith, Reid G. Simmons:

Strengthening Schedules through Uncertainty Analysis Agents. 175-180 - Manish Jain, Matthew E. Taylor, Milind Tambe, Makoto Yokoo:

DCOPs Meet the Real World: Exploring Unknown Reward Matrices with Applications to Mobile Sensor Networks. 181-186 - Ece Kamar, Eric Horvitz:

Collaboration and Shared Plans in the Open World: Studies of Ridesharing. 187 - Georgia Kastidou, Kate Larson, Robin Cohen:

Exchanging Reputation Information between Communities: A Payment-Function Approach. 195-200 - Akshat Kumar, Shlomo Zilberstein:

Event-Detecting Multi-Agent MDPs: Complexity and Constant-Factor Approximations. 201-207 - Sébastien Lahaie:

A Kernel Method for Market Clearing. 208-213 - Ivan Marsá-Maestre, Miguel A. López-Carmona, Juan R. Velasco, Takayuki Ito, Mark Klein, Katsuhide Fujita:

Balancing Utility and Deal Probability for Auction-Based Negotiations in Highly Nonlinear Utility Spaces. 214-219 - Reshef Meir, Ariel D. Procaccia, Jeffrey S. Rosenschein:

Strategyproof Classification with Shared Inputs. 220-225 - Kenichi Okuno, Kazuko Takahashi:

Argumentation System with Changes of an Agent's Knowledge Base. 226-232 - Abraham Othman, Tuomas Sandholm:

How Pervasive Is the Myerson-Satterthwaite Impossibility? 233-238 - Ariel D. Procaccia:

Thou Shalt Covet Thy Neighbor's Cake. 239-244 - Zinovi Rabinovich, Enrico H. Gerding, Maria Polukarov, Nicholas R. Jennings:

Generalised Fictitious Play for a Continuum of Anonymous Players. 245-250 - Iyad Rahwan, Kate Larson, Fernando A. Tohmé:

A Characterisation of Strategy-Proofness for Grounded Argumentation Semantics. 251-256 - Talal Rahwan, Tomasz P. Michalak, Nicholas R. Jennings, Michael J. Wooldridge, Peter McBurney:

Coalition Structure Generation in Multi-Agent Systems with Positive and Negative Externalities. 257-263 - Avi Rosenfeld, Sarit Kraus:

Modeling Agents through Bounded Rationality Theories. 264-271 - Amirali Salehi-Abari, Tony White:

Towards Con-Resistant Trust Models for Distributed Agent Systems. 272-277 - David Schnizlein, Michael H. Bowling, Duane Szafron:

Probabilistic State Translation in Extensive Games with Large Action Sets. 278-284 - Dafna Shahaf, Eric Horvitz:

Investigations of Continual Computation. 285-291 - Sebastian Stein, Enrico H. Gerding, Alex Rogers, Kate Larson, Nicholas R. Jennings:

Flexible Procurement of Services with Uncertain Durations using Redundancy. 292-298 - Ruben Stranders, Alessandro Farinelli, Alex Rogers, Nicholas R. Jennings:

Decentralised Coordination of Mobile Sensors Using the Max-Sum Algorithm. 299-304 - Evan Sultanik, Robert N. Lass, William C. Regli:

Dynamic Configuration of Agent Organizations. 305-311 - Pingzhong Tang, Fangzhen Lin:

Discovering Theorems in Game Theory: Two-Person Games with Unique Pure Nash Equilibrium Payoffs. 312-317 - Glenn Taylor, Michael Quist, Allen Hicken:

Acquiring Agent-Based Models of Conflict from Event Data. 318-323 - Toby Walsh:

Where Are the Really Hard Manipulation Problems? The Phase Transition in Manipulating the Veto Rule. 324-329 - Jens Witkowski:

Eliciting Honest Reputation Feedback in a Markov Setting. 330-335 - Lirong Xia, Vincent Conitzer:

Finite Local Consistency Characterizes Generalized Scoring Rules. 336-341 - Lirong Xia, Jérôme Lang:

A Dichotomy Theorem on the Existence of Efficient or Neutral Sequential Voting Correspondences. 342-347 - Lirong Xia, Michael Zuckerman, Ariel D. Procaccia, Vincent Conitzer, Jeffrey S. Rosenschein:

Complexity of Unweighted Coalitional Manipulation under Some Common Voting Rules. 348-353 - William Yeoh, Xiaoxun Sun, Sven Koenig:

Trading Off Solution Quality for Faster Computation in DCOP Search Algorithms. 354-360 - Chongjie Zhang, Victor R. Lesser, Prashant J. Shenoy:

A Multi-Agent Learning Approach to Online Distributed Resource Allocation. 361-366 - Dongmo Zhang:

Axiomatic Characterization of Task Oriented Negotiation. 367-372 - Xiaoming Zheng, Sven Koenig:

K-Swaps: Cooperative Negotiation for Solving Task-Allocation Problems. 373-379
Constraints, Satisfiability, and Search
- Spyros Angelopoulos, Alejandro López-Ortiz:

Interruptible Algorithms for Multi-Problem Solving. 380-386 - Carlos Ansótegui, Maria Luisa Bonet, Jordi Levy:

Towards Industrial-Like Random SAT Instances. 387-392 - Josep Argelich, Inês Lynce, João Marques-Silva:

On Solving Boolean Multilevel Optimization Problemse. 393-398 - Gilles Audemard, Laurent Simon:

Predicting Learnt Clauses Quality in Modern SAT Solvers. 399-404 - Pranjal Awasthi, Tuomas Sandholm:

Online Stochastic Optimization in the Large: Application to Kidney Exchange. 405-411 - Christian Bessiere, George Katsirelos, Nina Narodytska, Toby Walsh:

Circuit Complexity and Decompositions of Global Constraints. 412-418 - Christian Bessiere, George Katsirelos, Nina Narodytska, Claude-Guy Quimper, Toby Walsh:

Decompositions of All Different, Global Cardinality and Related Constraints. 419-424 - Christian Bessiere, Thierry Petit, Bruno Zanuttini:

Making Bound Consistency as Effective as Arc Consistency. 425-430 - Yngvi Björnsson, Vadim Bulitko, Nathan R. Sturtevant:

TBA*: Time-Bounded A*. 431-436 - Zahy Bnaya, Ariel Felner, Solomon Eyal Shimony:

Canadian Traveler Problem with Remote Sensing. 437-442 - Lucas Bordeaux, Youssef Hamadi, Horst Samulowitz:

Experiments with Massively Parallel Constraint Solving. 443-448 - Ethan Burns, Seth Lemons, Rong Zhou, Wheeler Ruml:

Best-First Heuristic Search for Multi-Core Machines. 449-455 - Khalil Challita:

Reasoning with Lines in the Euclidean Space. 462-467 - Raphaël Chenouard, Alexandre Goldsztejn, Christophe Jermann:

Search Strategies for an Anytime Usage of the Branch and Prune Algorithm. 468-473 - Paolo Ciancarini, Gian Piero Favini:

Monte Carlo Tree Search Techniques in the Game of Kriegspiel. 474-479 - P. Alex Dow, Richard E. Korf:

Duplicate Avoidance in Depth-First Search with Applications to Treewidth. 480-485 - Michael R. Fellows, Frances A. Rosamond, Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh, Yngve Villanger:

Local Search: Is Brute-Force Avoidable? 486-491 - Timothy Furtak, Michael Buro:

Minimum Proof Graphs and Fastest-Cut-First Search Heuristics. 492-498 - Youssef Hamadi, Saïd Jabbour, Lakhdar Sais:

Control-Based Clause Sharing in Parallel SAT Solving. 499-504 - Philip Henderson, Broderick Arneson, Ryan B. Hayward:

Solving 8x8 Hex. 505-510 - Eric Huang, Richard E. Korf:

New Improvements in Optimal Rectangle Packing. 511-516 - Ashiqur R. KhudaBukhsh

, Lin Xu, Holger H. Hoos, Kevin Leyton-Brown:
SATenstein: Automatically Building Local Search SAT Solvers from Components. 517-524 - Matthew Kitching, Fahiem Bacchus:

Exploiting Decomposition on Constraint Problems with High Tree-Width. 525-531 - Matthew Kitching, Fahiem Bacchus:

Set Branching in Constraint Optimization. 532-537 - Richard E. Korf:

Multi-Way Number Partitioning. 538-543 - Lukas Kroc, Ashish Sabharwal, Carla P. Gomes, Bart Selman:

Integrating Systematic and Local Search Paradigms: A New Strategy for MaxSAT. 544-551 - Yat Chiu Law, Jimmy Ho-Man Lee, May H. C. Woo:

Variety Reasoning for Multiset Constraint Propagation. 552-558 - Jimmy Ho-Man Lee, Ka Lun Leung:

Towards Efficient Consistency Enforcement for Global Constraints in Weighted Constraint Satisfaction. 559-565 - David Lesaint, Deepak Mehta, Barry O'Sullivan, Luis Quesada, Nic Wilson:

A Soft Global Precedence Constraint. 566-571 - Jason Jingshi Li, Jinbo Huang, Jochen Renz:

A Divide-and-Conquer Approach for Solving Interval Algebra Networks. 572-577 - Michael J. Maher:

Open Contractible Global Constraints. 578-583 - Carsten Moldenhauer, Nathan R. Sturtevant:

Evaluating Strategies for Running from the Cops. 584-589 - Knot Pipatsrisawat, Adnan Darwiche:

A New d-DNNF-Based Bound Computation Algorithm for Functional E-MAJSAT. 590-595 - Luca Pulina, Armando Tacchella:

A Structural Approach to Reasoning with Quantified Boolean Formulas. 596-602 - Martí Sánchez-Fibla, David Allouche, Simon de Givry, Thomas Schiex:

Russian Doll Search with Tree Decomposition. 603-608 - Nathan R. Sturtevant, Ariel Felner, Max Barer, Jonathan Schaeffer, Neil Burch:

Memory-Based Heuristics for Explicit State Spaces. 609-614 - Xiaoxun Sun, William Yeoh, Sven Koenig:

Efficient Incremental Search for Moving Target Search. 615-620 - Richard J. Wallace, Diarmuid Grimes, Eugene C. Freuder:

Solving Dynamic Constraint Satisfaction Problems by Identifying Stable Features. 621-627 - Matthias Westphal, Stefan Wölfl:

Qualitative CSP, Finite CSP, and SAT: Comparing Methods for Qualitative Constraint-based Reasoning. 628-633 - Zhifu Zhang, Nathan R. Sturtevant, Robert C. Holte, Jonathan Schaeffer, Ariel Felner:

A* Search with Inconsistent Heuristics. 634-639 - Rong Zhou, Eric A. Hansen:

Combining Breadth-First and Depth-First Strategies in Searching for Treewidth. 640-645 - Inon Zuckerman, Ariel Felner, Sarit Kraus:

Mixing Search Strategies for Multi-Player Games. 646-652
Knowledge Representation, Reasoning, and Logic
- Rui Abreu, Peter Zoeteweij, Arjan J. C. van Gemund:

A New Bayesian Approach to Multiple Intermittent Fault Diagnosis. 653-658 - Natasha Alechina, Brian Logan, Nguyen Hoang Nga, Abdur Rakib:

A Logic for Coalitions with Bounded Resources. 659-664 - Leila Amgoud, Srdjan Vesic:

Repairing Preference-Based Argumentation Frameworks. 665-670 - Carlos Areces, Diego Figueira:

Which Semantics for Neighbourhood Semantics? 671-676 - Jean-François Baget, Michel Leclère, Marie-Laure Mugnier, Eric Salvat:

Extending Decidable Cases for Rules with Existential Variables. 677-682 - Pietro Baroni, Paul E. Dunne, Massimiliano Giacomin:

Computational Properties of Resolution-based Grounded Semantics. 683-689 - Michelle L. Blom, Adrian R. Pearce:

An Argumentation-Based Interpreter for Golog Programs. 690-695 - Piero A. Bonatti, Marco Faella, Luigi Sauro:

Defeasible Inclusions in Low-Complexity DLs: Preliminary Notes. 696-701 - Richard Booth, Thomas Andreas Meyer, Ivan José Varzinczak:

Next Steps in Propositional Horn Contraction. 702-707 - Stefano Borgo:

Euclidean and Mereological Qualitative Spaces: A Study of SCC and DCC. 708-713 - Diego Calvanese, Thomas Eiter, Magdalena Ortiz:

Regular Path Queries in Expressive Description Logics with Nominals. 714-720 - Mika Cohen, Mads Dam, Alessio Lomuscio, Hongyang Qu:

A Symmetry Reduction Technique for Model Checking Temporal-Epistemic Logic. 721-726 - Bernardo Cuenca Grau, Boris Motik, Yevgeny Kazakov:

Import-by-Query: Ontology Reasoning under Access Limitations. 727-732 - Johan de Kleer:

Diagnosing Multiple Persistent and Intermittent Faults. 733-738 - Francesco M. Donini, Simona Colucci, Tommaso Di Noia, Eugenio Di Sciascio:

A Tableaux-Based Method for Computing Least Common Subsumers for Expressive Description Logics. 739-745 - Phan Minh Dung, Phan Minh Thang:

A Unified Framework for Representation and Development of Dialectical Proof Procedures in Argumentation. 746-751 - Thomas Eiter, Michael Fink, Thomas Krennwallner:

Decomposition of Declarative Knowledge Bases with External Functions. 752-758 - Thomas Eiter, Carsten Lutz, Magdalena Ortiz, Mantas Simkus

:
Query Answering in Description Logics with Transitive Roles. 759-764 - Thomas Eiter, Mantas Simkus

:
Bidirectional Answer Set Programs with Function Symbols. 765-771 - Hélène Fargier, Pierre Marquis:

Knowledge Compilation Properties of Trees-of-BDDs, Revisited. 772-777 - Alexander Feldman, Gregory M. Provan, Arjan J. C. van Gemund:

FRACTAL: Efficient Fault Isolation Using Active Testing. 778-784 - Alexander Feldman, Gregory M. Provan, Arjan J. C. van Gemund:

Solving Strong-Fault Diagnostic Models by Model Relaxation. 785-790 - Alexander Felfernig, Gerhard Friedrich, Monika Schubert, Monika Mandl, Markus Mairitsch, Erich Teppan:

Plausible Repairs for Inconsistent Requirements. 791-796 - Paolo Ferraris, Joohyung Lee, Vladimir Lifschitz, Ravi Palla:

Symmetric Splitting in the General Theory of Stable Models. 797-803 - Mauro Javier Gómez Lucero, Carlos Iván Chesñevar, Guillermo Ricardo Simari:

On the Accrual of Arguments in Defeasible Logic Programming. 804-809 - Katsumi Inoue, Taisuke Sato, Masakazu Ishihata, Yoshitaka Kameya, Hidetomo Nabeshima:

Evaluating Abductive Hypotheses using an EM Algorithm on BDDs. 810-815 - Michael Jakl, Reinhard Pichler, Stefan Woltran:

Answer-Set Programming with Bounded Treewidth. 816-822 - Tae-Won Kim, Joohyung Lee, Ravi Palla:

Circumscriptive Event Calculus as Answer Set Programming. 823-829 - Boris Konev, Dirk Walther, Frank Wolter:

Forgetting and Uniform Interpolation in Large-Scale Description Logic Terminologies. 830-835 - Roman Kontchakov, Luca Pulina, Ulrike Sattler, Thomas Schneider, Petra Selmer, Frank Wolter, Michael Zakharyaschev:

Minimal Module Extraction from DL-Lite Ontologies Using QBF Solvers. 836-841 - Gerhard Lakemeyer, Hector J. Levesque:

A Semantical Account of Progression in the Presence of Defaults. 842-847 - Jérôme Lang, Jérôme Mengin:

The Complexity of Learning Separable ceteris paribus Preferences. 848-853 - Weiming Liu, Sanjiang Li, Jochen Renz:

Combining RCC-8 with Qualitative Direction Calculi: Algorithms and Complexity. 854-859 - Yongmei Liu, Gerhard Lakemeyer:

On First-Order Definability and Computability of Progression for Local-Effect Actions and Beyond. 860-866 - Emiliano Lorini, François Schwarzentruber:

A Logic for Reasoning about Counterfactual Emotions. 867-872 - Sanjay Modgil:

Labellings and Games for Extended Argumentation Frameworks. 873-878 - Bernhard Nebel, Jochen Renz:

A Fixed-Parameter Tractable Algorithm for Spatio-Temporal Calendar Management. 879-884 - Theodore Patkos, Dimitris Plexousakis:

Reasoning with Knowledge, Action and Time in Dynamic and Uncertain Domains. 885-890 - Guilin Qi, Jianfeng Du:

Model-based Revision Operators for Terminologies in Description Logics. 891-897 - Nicolás D. Rotstein, Martín O. Moguillansky, Guillermo Ricardo Simari:

Dialectical Abstract Argumentation: A Characterization of the Marking Criterion. 898-903 - Sebastian Sardiña, Giuseppe De Giacomo:

Composition of ConGolog Programs. 904-910 - Stephan Schiffel, Michael Thielscher:

Automated Theorem Proving for General Game Playing. 911-916 - Lutz Schröder, Dirk Pattinson, Clemens Kupke:

Nominals for Everyone. 917-922 - Inanç Seylan, Enrico Franconi, Jos de Bruijn:

Effective Query Rewriting with Ontologies over DBoxes. 923-925 - Tran Cao Son, Chiaki Sakama:

Negotiation Using Logic Programming with Consistency Restoring Rules. 930-935 - Thomas Ströder, Maurice Pagnucco:

Realising Deterministic Behavior from Multiple Non-Deterministic Behaviors. 936-941 - Eugenia Ternovska, David G. Mitchell:

Declarative Programming of Search Problems with Built-in Arithmetic. 942-947 - David Toman, Grant E. Weddell:

Applications and Extensions of PTIME Description Logics with Functional Constraints. 948-954 - Hans van Ditmarsch, Wiebe van der Hoek, Barteld P. Kooi:

Knowing More - From Global to Local Correspondence. 955-960 - Nic Wilson:

Efficient Inference for Expressive Comparative Preference Languages. 961-966 - Stefan Wölfl, Matthias Westphal:

On Combinations of Binary Qualitative Constraint Calculi. 967-973
Machine Learning
- Arvind Agarwal, Hal Daumé III:

Exponential Family Hybrid Semi-Supervised Learning. 974-979 - Takayuki Akiyama, Hirotaka Hachiya, Masashi Sugiyama:

Active Policy Iteration: Efficient Exploration through Active Learning for Value Function Approximation in Reinforcement Learning. 980-985 - Grant Anderson, Bernhard Pfahringer:

Relational Random Forests Based on Random Relational Rules. 986-991 - Javad Azimi, Xiaoli Z. Fern:

Adaptive Cluster Ensemble Selection. 992-997 - Jacob Beal:

Self-Managing Associative Memory for Dynamic Acquisition of Expertise in High-Level Domains. 998-1003 - Benedikt Bollig, Peter Habermehl, Carsten Kern, Martin Leucker:

Angluin-Style Learning of NFA. 1004-1009 - Deng Cai, Xiaofei He, Xuanhui Wang, Hujun Bao, Jiawei Han:

Locality Preserving Nonnegative Matrix Factorization. 1010-1015 - Shuo Chen, Changshui Zhang:

Selecting Informative Universum Sample for Semi-Supervised Learning. 1016-1021 - Yutian Chen, Max Welling:

Bayesian Extreme Components Analysis. 1022-1027 - Jaedeug Choi, Kee-Eung Kim:

Inverse Reinforcement Learning in Partially Observable Environments. 1028-1033 - Ian Davidson:

Knowledge Driven Dimension Reduction for Clustering. 1034-1039 - Adam Drake, Dan Ventura:

Search Techniques for Fourier-Based Learning. 1040-1045 - Quanquan Gu, Jie Zhou:

Local Learning Regularized Nonnegative Matrix Factorization. 1046-1051 - Yunsong Guo, Carla P. Gomes:

Learning Optimal Subsets with Implicit User Preferences. 1052-1057 - Yunsong Guo, Carla P. Gomes:

Ranking Structured Documents: A Large Margin Based Approach for Patent Prior Art Search. 1058-1064 - Xiaofei He, Ming Ji, Hujun Bao:

Graph Embedding with Constraints. 1065-1070 - Daniel Hewlett, Paul R. Cohen:

Bootstrap Voting Experts. 1071-1076 - Shuiwang Ji, Jieping Ye:

Linear Dimensionality Reduction for Multi-label Classification. 1077-1082 - Yangqing Jia, Shuicheng Yan, Changshui Zhang:

Semi-Supervised Classification on Evolutionary Data. 1083-1088 - Nikhil S. Ketkar, Lawrence B. Holder, Diane J. Cook:

gRegress: Extracting Features from Graph Transactions for Regression. 1089-1094 - Angelika Kimmig, Luc De Raedt:

Local Query Mining in a Probabilistic Prolog. 1095-1100 - Alexandre Klementiev, Dan Roth, Kevin Small, Ivan Titov:

Unsupervised Rank Aggregation with Domain-Specific Expertise. 1101-1106 - George Dimitri Konidaris, Andrew G. Barto:

Efficient Skill Learning using Abstraction Selection. 1107-1112 - Honglak Lee, Rajat Raina, Alex Teichman, Andrew Y. Ng:

Exponential Family Sparse Coding with Application to Self-taught Learning. 1113-1119 - Ming Li, Xiao-Bing Xue, Zhi-Hua Zhou:

Exploiting Multi-Modal Interactions: A Unified Framework. 1120-1125 - Wu-Jun Li, Dit-Yan Yeung:

Relation Regularized Matrix Factorization. 1126-1131 - Xi Li, Kazuhiro Fukui, Nanning Zheng:

Boosting Constrained Mutual Subspace Method for Robust Image-Set Based Object Recognition. 1132-1137 - Chia-chun Lian, Jane Yung-jen Hsu:

Probabilistic Models for Concurrent Chatting Activity Recognition. 1138-1143 - Jun Liu, Jianhui Chen, Songcan Chen, Jieping Ye:

Learning the Optimal Neighborhood Kernel for Classification. 1144-1149 - Wei Liu, Buyue Qian, Jingyu Cui, Jianzhuang Liu:

Spectral Kernel Learning for Semi-Supervised Classification. 1150-1155 - Xu Miao, Rajesh P. N. Rao:

Large Margin Boltzmann Machines. 1156-1162 - Lilyana Mihalkova, Raymond J. Mooney:

Transfer Learning from Minimal Target Data by Mapping across Relational Domains. 1163-1168 - Nicholas Morsillo, Christopher J. Pal, Randal Nelson:

Semi-Supervised Learning of Visual Classifiers from Web Images and Text. 1169-1174 - Jonathan Mugan, Benjamin Kuipers:

Autonomously Learning an Action Hierarchy Using a Learned Qualitative State Representation. 1175-1180 - Feiping Nie, Dong Xu, Ivor W. Tsang

, Changshui Zhang:
Spectral Embedded Clustering. 1181-1186 - Sinno Jialin Pan, Ivor W. Tsang

, James T. Kwok, Qiang Yang:
Domain Adaptation via Transfer Component Analysis. 1187-1192 - Amrish Patel, S. Sundararajan, Shirish K. Shevade:

Semi-Supervised Classification Using Sparse Gaussian Process Regression. 1193-1198 - Guang Qiu, Bing Liu, Jiajun Bu, Chun Chen:

Expanding Domain Sentiment Lexicon through Double Propagation. 1199-1204 - Jainarayan Radhakrishnan, Santiago Ontañón, Ashwin Ram:

Goal-Driven Learning in the GILA Integrated Intelligence Architecture. 1205-1210 - Piyush Rai, Hal Daumé III, Suresh Venkatasubramanian:

Streamed Learning: One-Pass SVMs. 1211-1216 - Mahdieh Soleymani Baghshah, Saeed Bagheri Shouraki:

Semi-Supervised Metric Learning Using Pairwise Constraints. 1217-1222 - Nathan Sprague:

Predictive Projections. 1223-1229 - Liang Sun, Shuiwang Ji, Shipeng Yu, Jieping Ye:

On the Equivalence between Canonical Correlation Analysis and Orthonormalized Partial Least Squares. 1230-1235 - Xu Sun, Takuya Matsuzaki, Daisuke Okanohara, Jun'ichi Tsujii:

Latent Variable Perceptron Algorithm for Structured Classification. 1236-1242 - David Talbot:

Succinct Approximate Counting of Skewed Data. 1243-1248 - Erik Talvitie, Satinder Singh:

Maintaining Predictions over Time without a Model. 1249-1254 - Lei Tang, Jianhui Chen, Jieping Ye:

On Multiple Kernel Learning with Multiple Labels. 1255-1260 - Alireza Vahdatpour, Navid Amini, Majid Sarrafzadeh:

Toward Unsupervised Activity Discovery Using Multi-Dimensional Motif Detection in Time Series. 1261-1266 - Volkan Vural, Glenn Fung, Rómer Rosales, Jennifer G. Dy:

Multi-Class Classifiers and their Underlying Shared Structure. 1267-1272 - Chang Wang, Sridhar Mahadevan:

Manifold Alignment without Correspondence. 1273-1278 - Fei Wang, Xin Wang, Tao Li:

Generalized Cluster Aggregation. 1279-1284 - Fei Wang, Bin Zhang, Ta-Hsin Li, Wen Jun Yin, Jin Dong, Tao Li:

Preference Learning with Extreme Examples. 1285-1290 - Zheng Wang, Yangqiu Song, Changshui Zhang:

Knowledge Transfer on Hybrid Graph. 1291-1296 - Zhengzheng Xing, Jian Pei, Philip S. Yu:

Early Prediction on Time Series: A Nearest Neighbor Approach. 1297-1302 - Zenglin Xu, Rong Jin, Michael R. Lyu, Irwin King:

Discriminative Semi-Supervised Feature Selection via Manifold Regularization. 1303-1308 - Zhao Xu, Kristian Kersting, Volker Tresp:

Multi-Relational Learning with Gaussian Processes. 1309-1314 - Rong Yan, Jian Zhang:

Transfer Learning Using Task-Level Features with Application to Information Retrieval. 1315-1320 - Jie Yin, Derek Hao Hu, Qiang Yang:

Spatio-Temporal Event Detection Using Dynamic Conditional Random Fields. 1321-1326 - Zheng-Jun Zha, Tao Mei, Meng Wang, Zengfu Wang, Xian-Sheng Hua:

Robust Distance Metric Learning with Auxiliary Knowledge. 1327-1332 - Chao Zhang, Hongyu Li, Qiyong Guo, Jinyuan Jia, I-Fan Shen:

Fast Active Tabu Search and its Application to Image Retrieval. 1333-1338 - Dan Zhang, Fei Wang, Luo Si, Tao Li:

M3IC: Maximum Margin Multiple Instance Clustering. 1339-1344 - Daoqiang Zhang, Wanquan Liu:

An Efficient Nonnegative Matrix Factorization Approach in Flexible Kernel Space. 1345-1350 - Yi Zhang:

Smart PCA. 1351-1356 - Yin Zhang, Zhi-Hua Zhou:

Non-Metric Label Propagation. 1357-1362 - Zheng Zhao, Liang Sun, Shipeng Yu, Huan Liu, Jieping Ye:

Multiclass Probabilistic Kernel Discriminant Analysis. 1363-1368 - Xingquan Zhu, Ruoming Jin:

Multiple Information Sources Cooperative Learning. 1369-1376
Multidisciplinary Topics and Applications
- Christopher Archibald, Alon Altman, Yoav Shoham:

Analysis of a Winning Computational Billiards Player. 1377-1382 - Liviu Badea:

Generalized Clustergrams for Overlapping Biclusters. 1383-1388 - Xinxin Bai, Gang Chen, Qiming Tian, Wen Jun Yin, Jin Dong:

Semi-Supervised Regression for Evaluating Convenience Store Location. 1389-1394 - Akshay Bhat, Tracy Hammond:

Using Entropy to Distinguish Shape Versus Text in Hand-Drawn Diagrams. 1395-1400 - David Tyler Bischel, Thomas F. Stahovich, Eric Jeffrey Peterson, Randall Davis, Aaron Adler:

Combining Speech and Sketch to Interpret Unconstrained Descriptions of Mechanical Devices. 1401-1406 - Michael Buro, Jeffrey Richard Long, Timothy Furtak, Nathan R. Sturtevant:

Improving State Evaluation, Inference, and Search in Trick-Based Card Games. 1407-1413 - Mark Dredze, Bill N. Schilit, Peter Norvig:

Suggesting Email View Filters for Triage and Search. 1414-1419 - Jon Froehlich, Joachim Neumann, Nuria Oliver:

Sensing and Predicting the Pulse of the City through Shared Bicycling. 1420-1426 - Tomoharu Iwata, Shinji Watanabe, Takeshi Yamada, Naonori Ueda:

Topic Tracking Model for Analyzing Consumer Purchase Behavior. 1427-1432 - Tessa A. Lau, Clemens Drews, Jeffrey Nichols:

Interpreting Written How-To Instructions. 1433-1438 - Hector J. Levesque:

Is It Enough to Get the Behavior Right? 1439-1444 - Ying-Xin Li, Shuiwang Ji, Sudhir Kumar, Jieping Ye, Zhi-Hua Zhou:

DrosophilaGene Expression Pattern Annotation through Multi-Instance Multi-Label Learning. 1445-1450 - Benjamin Lubin, Jeffrey O. Kephart, Rajarshi Das, David C. Parkes:

Expressive Power-Based Resource Allocation for Data Centers. 1451-1456 - Omid Madani, Hung Bui, Eric Yeh:

Efficient Online Learning and Prediction of Users' Desktop Actions. 1457-1462 - Tom Y. Ouyang, Randall Davis:

A Visual Approach to Sketched Symbol Recognition. 1463-1468 - Michal Ptaszynski, Pawel Dybala, Wenhan Shi, Rafal Rzepka, Kenji Araki:

Towards Context Aware Emotional Intelligence in Machines: Computing Contextual Appropriateness of Affective States. 1469-1474 - Christopher Raphael:

Representation and Synthesis of Melodic Expression. 1475-1480 - Oliver Schulte:

Simultaneous Discovery of Conservation Laws and Hidden Particles with Smith Matrix Decomposition. 1481-1487 - Nobuyuki Shimizu, Andrew R. Haas:

Learning to Follow Navigational Route Instructions. 1488-1493 - Qingguo Wang, Dmitry Korkin, Yi Shang:

Efficient Dominant Point Algorithms for the Multiple Longest Common Subsequence (MLCS) Problem. 1494-1500
Natural-Language Processing
- Eneko Agirre, Oier Lopez de Lacalle, Aitor Soroa:

Knowledge-Based WSD and Specific Domains: Performing Better than Generic Supervised WSD. 1501-1506 - Shane Bergsma, Dekang Lin, Randy Goebel:

Web-Scale N-gram Models for Lexical Disambiguation. 1507-1512 - Philipp Cimiano, Antje Schultz, Sergej Sizov, Philipp Sorg, Steffen Staab:

Explicit Versus Latent Concept Models for Cross-Language Information Retrieval. 1513-1518 - Helen Kwong, Neil Yorke-Smith:

Detection of Imperative and Declarative Question-Answer Pairs in Email Conversations. 1519-1524 - Loizos Michael:

Reading Between the Lines. 1525-1530 - Jason Naradowsky, Sharon Goldwater:

Improving Morphology Induction by Learning Spelling Rules. 1531-1536 - Antonio Roque, David R. Traum:

Improving a Virtual Human Using a Model of Degrees of Grounding. 1537-1542 - Giovanni Semeraro, Pasquale Lops, Pierpaolo Basile, Marco de Gemmis:

On the Tip of My Thought: Playing the Guillotine Game. 1543-1548 - Daniel Sonntag:

Introspection and Adaptable Model Integration for Dialogue-based Question Answering. 1549-1554 - Rie Tanaka, Yohei Murakami, Toru Ishida:

Context-Based Approach for Pivot Translation Services. 1555-1561 - Ivan Titov, James Henderson, Paola Merlo, Gabriele Musillo:

Online Graph Planarisation for Synchronous Parsing of Semantic and Syntactic Dependencies. 1562-1567 - Akira Utsumi:

Computational Semantics of Noun Compounds in a Semantic Space Model. 1568-1573 - Benjamin Van Durme, Ashwin Lall:

Probabilistic Counting with Randomized Storage. 1574-1579 - Kamaljeet S. Verma, Pushpak Bhattacharyya:

Context-Sensitive Semantic Smoothing using Semantically Relatable Sequences. 1580-1585 - Xiaojun Wan, Jianguo Xiao:

Graph-Based Multi-Modality Learning for Topic-Focused Multi-Document Summarization. 1586-1591 - Chang Wang, Sridhar Mahadevan:

Multiscale Analysis of Document Corpora Based on Diffusion Models. 1592-1597 - Robert West, Joelle Pineau, Doina Precup:

Wikispeedia: An Online Game for Inferring Semantic Distances between Concepts. 1598-1603 - Hendrik Zender, Geert-Jan M. Kruijff, Ivana Kruijff-Korbayová:

Situated Resolution and Generation of Spatial Referring Expressions for Robotic Assistants. 1604-1609 - Jianwen Zhang, Yangqiu Song, Gang Chen, Changshui Zhang:

On-line Evolutionary Exponential Family Mixture. 1610-1615 - Zhi Zhong, Hwee Tou Ng:

Word Sense Disambiguation for All Words without Hard Labor. 1616-1622
Planning and Scheduling
- Alexandre Albore, Héctor Palacios, Hector Geffner:

A Translation-Based Approach to Contingent Planning. 1623-1628 - Ronald Alford, Ugur Kuter, Dana S. Nau:

Translating HTNs to PDDL: A Small Amount of Domain Knowledge Can Go a Long Way. 1629-1634 - Marcelo Gabriel Armentano, Analía Amandi

:
Goal Recognition with Variable-Order Markov Models. 1635-1640 - Blai Bonet, Hector Geffner:

Solving POMDPs: RTDP-Bel vs. Point-based Algorithms. 1641-1646 - Adi Botea, André A. Ciré:

Incremental Heuristic Search for Planning with Temporally Extended Goals and Uncontrollable Events. 1647-1652 - Pablo Samuel Castro, Prakash Panangaden, Doina Precup:

Equivalence Relations in Fully and Partially Observable Markov Decision Processes. 1653-1658 - Yixin Chen, Guohui Yao:

Completeness and Optimality Preserving Reduction for Planning. 1659-1664 - Yixin Chen, You Xu, Guohui Yao:

Stratified Planning. 1665-1670 - Amanda Jane Coles, Andrew Coles, Maria Fox, Derek Long:

Temporal Planning in Domains with Linear Processes. 1671-1676 - Peng Dai, Mausam, Daniel S. Weld:

Domain-Independent, Automatic Partitioning for Probabilistic Planning. 1677-1683 - Jilles Steeve Dibangoye, Guy Shani, Brahim Chaib-draa, Abdel-Illah Mouaddib:

Topological Order Planner for POMDPs. 1684-1689 - Stefan Edelkamp, Peter Kissmann:

Optimal Symbolic Planning with Action Costs and Preferences. 1690-1695 - Alfredo Gabaldon:

Activity Recognition with Intended Actions. 1696-1701 - Christopher W. Geib:

Delaying Commitment in Plan Recognition Using Combinatory Categorial Grammars. 1702-1707 - Chad Hogg, Ugur Kuter, Héctor Muñoz-Avila:

Learning Hierarchical Task Networks for Nondeterministic Planning Domains. 1708-1714 - Derek Hao Hu, Xian-Xing Zhang, Jie Yin, Vincent Wenchen Zheng, Qiang Yang:

Abnormal Activity Recognition Based on HDP-HMM Models. 1715-1720 - Wei Huang, Zhonghua Wen, Yunfei Jiang, Hong Peng:

Structured Plans and Observation Reduction for Plans with Contexts. 1721-1727 - Erez Karpas, Carmel Domshlak:

Cost-Optimal Planning with Landmarks. 1728-1733 - Emil Keyder, Hector Geffner:

Trees of Shortest Paths vs. Steiner Trees: Understanding and Improving Delete Relaxation Heuristics. 1734-1739 - Hyunyoung Kil, Wonhong Nam, Dongwon Lee

:
Efficient Abstraction and Refinement for Behavioral Description Based Web Service Composition. 1740-1745 - Andrey Kolobov, Mausam, Daniel S. Weld:

ReTrASE: Integrating Paradigms for Approximate Probabilistic Planning. 1746-1753 - Nan Li, Subbarao Kambhampati, Sung Wook Yoon:

Learning Probabilistic Hierarchical Task Networks to Capture User Preferences. 1754-1759 - Roberto Micalizio:

A Distributed Control Loop for Autonomous Recovery in a Multi-Agent Plan. 1760-1765 - Hootan Nakhost, Martin Müller:

Monte-Carlo Exploration for Deterministic Planning. 1766-1771 - Tuan Anh Nguyen, Minh Binh Do, Subbarao Kambhampati, Biplav Srivastava:

Planning with Partial Preference Models. 1772-1777 - Miquel Ramírez, Hector Geffner:

Plan Recognition as Planning. 1778-1783 - Scott Sanner, Robby Goetschalckx, Kurt Driessens, Guy Shani:

Bayesian Real-Time Dynamic Programming. 1784-1789 - Shirin Sohrabi, Jorge A. Baier, Sheila A. McIlraith:

HTN Planning with Preferences. 1790-1797 - Fusun Yaman, Tim Oates, Mark H. Burstein:

A Context Driven Approach for Workflow Mining. 1798-1803 - Hankz Hankui Zhuo, Derek Hao Hu, Chad Hogg, Qiang Yang, Hector Muñoz-Avila:

Learning HTN Method Preconditions and Action Models from Partial Observations. 1804-1810
Robotics and Vision
- Noa Agmon, Sarit Kraus, Gal A. Kaminka, Vladimir Sadov:

Adversarial Uncertainty in Multi-Robot Patrol. 1811-1817 - Mary Ellen Foster, Manuel Giuliani, Amy Isard, Colin Matheson, Jon Oberlander, Alois C. Knoll:

Evaluating Description and Reference Strategies in a Cooperative Human-Robot Dialogue System. 1818-1823 - Alex Nash, Sven Koenig, Maxim Likhachev:

Incremental Phi*: Incremental Any-Angle Path Planning on Grids. 1824-1830 - Zeyn A. Saigol, Richard Dearden, Jeremy L. Wyatt, Bramley J. Murton:

Information-Lookahead Planning for AUV Mapping. 1831-1836 - Young-Woo Seo, Nathan D. Ratliff, Chris Urmson:

Self-Supervised Aerial Image Analysis for Extracting Parking Lot Structure. 1837-1842 - Amarjeet Singh, Andreas Krause, William J. Kaiser:

Nonmyopic Adaptive Informative Path Planning for Multiple Robots. 1843-1850 - Jürgen Sturm, Vijay Pradeep, Cyrill Stachniss, Christian Plagemann, Kurt Konolige, Wolfram Burgard:

Learning Kinematic Models for Articulated Objects. 1851-1856 - Agnes Swadzba, Sven Wachsmuth, Constanze Vorwerg, Gert Rickheit:

A Computational Model for the Alignment of Hierarchical Scene Representations in Human-Robot Interaction. 1857-1863 - David R. Thompson:

Domain-Guided Novelty Detection for Autonomous Exploration. 1864-1869 - Ko-Hsin Cindy Wang, Adi Botea:

Tractable Multi-Agent Path Planning on Grid Maps. 1870-1875 - Zheshen Wang, Baoxin Li:

Human Activity Encoding and Recognition Using Low-level Visual Features. 1876-1883
Uncertainty in AI
- Sivan Albagli, Rachel Ben-Eliyahu-Zohary, Solomon Eyal Shimony:

Markov Network Based Ontology Matching. 1884-1889 - Yannis Dimopoulos, Loizos Michael, Fani Athienitou:

Ceteris Paribus Preference Elicitation with Predictive Guarantees. 1890-1895 - Jean-Philippe Dubus, Christophe Gonzales, Patrice Perny:

Fast Recommendations using GAI Models. 1896-1901 - Jean-Philippe Dubus, Christophe Gonzales, Patrice Perny:

Multiobjective Optimization using GAI Models. 1902-1907 - Hannaneh Hajishirzi, Afsaneh Shirazi, Jaesik Choi, Eyal Amir:

Greedy Algorithms for Sequential Sensing Decisions. 1908-1915 - Saket Joshi, Kristian Kersting, Roni Khardon:

Generalized First Order Decision Diagrams for First Order Markov Decision Processes. 1916-1921 - Jacek Kisynski, David Poole:

Lifted Aggregation in Directed First-Order Probabilistic Models. 1922-1929 - Frédéric Koriche, Bruno Zanuttini:

Learning Conditional Preference Networks with Queries. 1930-1935 - Arman Melkumyan, Fabio Ramos:

A Sparse Covariance Function for Exact Gaussian Process Inference in Large Datasets. 1936-1942 - Avi Pfeffer:

CTPPL: A Continuous Time Probabilistic Programming Language. 1943-1950 - Jude W. Shavlik, Sriraam Natarajan:

Speeding Up Inference in Markov Logic Networks by Preprocessing to Reduce the Size of the Resulting Grounded Network. 1951-1956 - Ilya Shpitser, Thomas S. Richardson, James M. Robins:

Testing Edges by Truncations. 1957-1963 - Sajjad Ahmed Siddiqi, Jinbo Huang:

Variable and Value Ordering for MPE Search. 1964-1969 - Jin Tian:

Parameter Identification in a Class of Linear Structural Equation Models. 1970-1975 - Martha White, Michael H. Bowling:

Learning a Value Analysis Tool for Agent Evaluation. 1976-1981 - Changhe Yuan, Eric A. Hansen:

Efficient Computation of Jointree Bounds for Systematic MAP Search. 1982-1989 - Anbu Yue, Weiru Liu:

A Syntax-based Framework for Merging Imprecise Probabilistic Logic Programs. 1990-1995 - Yifeng Zeng, Prashant Doshi:

Speeding Up Exact Solutions of Interactive Dynamic Influence Diagrams Using Action Equivalence. 1996-2001 - Haoqi Zhang, Yiling Chen, David C. Parkes:

A General Approach to Environment Design with One Agent. 2002-2014
Web and Knowledge-based Information Systems
- Nada Abdallah, François Goasdoué, Marie-Christine Rousset:

DL-LITER in the Light of Propositional Logic for Decentralized Data Management. 2010-2015 - Yoram Bachrach, Ely Porat, Jeffrey S. Rosenschein:

Sketching Techniques for Collaborative Filtering. 2016-2021 - Fabian Bohnert, Daniel Francis Schmidt, Ingrid Zukerman:

Spatial Processes for Recommender Systems. 2022-2027 - Paul Doran, Valentina Tamma, Terry R. Payne, Ignazio Palmisano:

Dynamic Selection of Ontological Alignments: A Space Reduction Mechanism. 2028-2033 - Anil Gürsel, Sandip Sen:

Improving Search in Social Networks by Agent Based Mining. 2034-2039 - Yevgeny Kazakov:

Consequence-Driven Reasoning for Horn SHIQ Ontologies. 2040-2045 - Masahiro Kimura, Kazumi Saito, Hiroshi Motoda:

Efficient Estimation of Influence Functions for SIS Model on Social Networks. 2046-2051 - Bin Li, Qiang Yang, Xiangyang Xue:

Can Movies and Books Collaborate? Cross-Domain Collaborative Filtering for Sparsity Reduction. 2052-2057 - Feng Liu, Yuzhen Niu, Michael Gleicher:

Using Web Photos for Measuring Video Frame Interestingness. 2058-2063 - Yu-Ta Lu, Shoou-I Yu, Tsung-Chieh Chang, Jane Yung-jen Hsu:

A Content-Based Method to Enhance Tag Recommendation. 2064-2069 - Carsten Lutz, David Toman, Frank Wolter:

Conjunctive Query Answering in the Description Logic EL Using a Relational Database System. 2070-2075 - Matthew Michelson, Craig A. Knoblock:

Exploiting Background Knowledge to Build Reference Sets for Information Extraction. 2076-2082 - Simone Paolo Ponzetto, Roberto Navigli:

Large-Scale Taxonomy Mapping for Restructuring and Integrating Wikipedia. 2083-2088 - Jie Tang, Ho-fung Leung, Qiong Luo, Dewei Chen, Jibin Gong:

Towards Ontology Learning from Folksonomies. 2089-2094 - Jeff Yan, Su-Yang Yu:

Streamlining Attacks on CAPTCHAs with a Computer Game. 2095-2100 - Yabin Zheng, Zhiyuan Liu, Maosong Sun, Liyun Ru, Yang Zhang:

Incorporating User Behaviors in New Word Detection. 2101-2106

manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.


Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID














