-----0
Agarwal, D., and Chen, B.-C. 2009. Regression-based latent factor models. In KDD, 1928.
Agarwal, D., and Chen, B.-C. 2010. fLDA: Matrix factorization through latent dirichlet allocation. In WSDM.
Bakshy, E.; Hofman, J. M.; Mason, W. A.; and Watts, D. J.2011. Everyones an influencer: quantifying influence on twitter. In WSDM.
Blei, D.; Ng, A.; and Jordan, M. 2003. Latent dirichlet allocation. The Journal of Machine Learning Research 3:993 1022.
Chang, J. 2009. Relational topic models for document networks. In AISTATS.
Chua, F. C. T.; Lauw, H.W.; and Lim, E.-P. 2012. Generative models for item adoptions using social correlation. IEEE Transactions on Knowledge and Data Engineering 99.
Counts, S., and Fisher, K. 2011. Taking it all in? visual attention in microblog consumption. In ICWSM.
Daume, III, H. 2009. Markov random topic fields. In Short Papers at ACL-IJCNLP, 293296.
Gilbert, E., and Karahalios, K. 2009. Predicting tie strength with social media. In CHI.
Goncalves, B.; Perra, N.; and Vespignani, A. 2011. Validation of Dunbars number in Twitter conversations. arXiv.org.
Herlocker, J.; Konstan, J.; Borchers, A.; and Riedl, J. 1999.An algorithmic framework for performing collaborative filtering. In ACM SIGIR conference on Research and development in information retrieval, 230237. ACM.
Hodas, N., and Lerman, K. 2012. How limited visibility and divided attention constrain social contagion. In SocialCom.
Kahneman, D. 1973. Attention and effort. Prentice Hall.Kang, J.-H.; Lerman, K.; and Getoor, L. 2013. La-lda: A limited attention model for social recommendation. In International Conference on Social Computing, BehavioralCultural Modeling, and Prediction (SBP).
Karypis, G. 2000. Evaluation of item-based top-n recommendation algorithms. Technical report, DTIC Document.
Koren, Y.; Bell, R.; and Volinsky, C. 2009. Matrix factorization techniques for recommender systems. Computer 42(8):3037.
Lerman, K., and Ghosh, R. 2010. Information contagion: an empirical study of spread of news on digg and twitter social networks. In ICWSM.
Ma, H.; Yang, H.; Lyu, M. R.; and King, I. 2008. Sorec: social recommendation using probabilistic matrix factorization. In Proceedings of the 17th ACM conference on Information and knowledge management, 931940. ACM.
Nallapati, R., and Cohen, W. 2008. Link-PLSA-LDA: A new unsupervised model for topics and influence of blogs.In ICWSM.
Purushotham, S.; Liu, Y.; and Kuo, C. 2012. Collaborative topic regression with social matrix factorization for recommendation systems. arXiv preprint arXiv:1206.4684.
Ramage, D.; Hall, D.; Nallapati, R.; and Manning, C. 2009.Labeled LDA: A supervised topic model for credit attribution in multi-labeled corpora. In EMNLP.
Rensink, R.; ORegan, J.; and Clark, J. 1997. To see or not to see: The need for attention to perceive changes in scenes.Psychological Science 8(5):368.
Romero, D. M.; Meeder, B.; and Kleinberg, J. 2011. Differences in the mechanics of information diffusion across topics: Idioms, political hashtags, and complex contagion on twitter. In WWW.
Rosen-Zvi, M.; Griffiths, T.; Steyvers, M.; and Smyth, P.2004. The author-topic model for authors and documents.In UAI.
Salakhutdinov, R., and Mnih, A. 2008. Probabilistic matrix factorization. Advances in neural information processing systems 20:12571264.
Sarwar, B.; Karypis, G.; Konstan, J.; and Riedl, J. 2001.Itembased collaborative filtering recommendation algorithms. In WWW.
Sharara, H.; Rand, W.; and Getoor, L. 2011. Differential adaptive diffusion: Understanding diversity and learning whom to trust in viral marketing. In ICWSM.
Wang, C., and Blei, D. M. 2011. Collaborative topic modeling for recommending scientific articles. In KDD.
Weng, L.; Flammini, A.; Vespignani, A.; and Menczer, F.2012. Competition among memes in a world with limited attention. Scientific Reports 2.
Yang, S.-H.; Long, B.; Smola, A.; Sadagopan, N.; Zheng, Z.; and Zha, H. 2011. Like like alike: joint friendship and interest propagation in social networks. In Proceedings of the 20th international conference on World wide web, 537 546. ACM.
Yu, K.; Lafferty, J.; Zhu, S.; and Gong, Y. 2009. Largescale collaborative prediction using a nonparametric random effects model. In ICML, 11851192.
-----0
Abiteboul, S.; Hull, R.; and Vianu, V. 1995. Foundations of Databases. Addison-Wesley.
Artale, A.; Calvanese, D.; Kontchakov, R.; and Zakharyaschev, M. 2009. The DL-Lite Family and Relations.Journal of Artificial Intelligence Research 36:169.
Baader, F.; Calvanese, D.; McGuinness, D.; Nardi, D.; and Patel-Schneider, P. F., eds. 2007. The Description Logic Handbook: Theory, Implementation, and Applications. Cambridge University Press. ISBN 9780511717383.
Baader, F.; Brandt, S.; and Lutz, C. 2005. Pushing the EL Envelope. In Kaelbling, L. P., and Saffiotti, A., eds., Proceedings of the 19th International Joint Conference on Artificial Intelligence (IJCAI 2005), 364369. Edinburgh, UK: Morgan Kaufmann Publishers.
Calvanese, D.; De Giacomo, G.; Lembo, D.; Lenzerini, M.; and Rosati, R. 2007. Tractable Reasoning and Efficient Query Answering in Description Logics: The DL-Lite Family. Journal of Automated Reasoning 9(3):385429.
Chen, W., and Warren, D. S. 1993. Query evaluation under the well-founded semantics. In Proceedings of the 12th ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems, PODS 93, 168179. New York, NY, USA: ACM.
Cuenca Grau, B.; Horrocks, I.; Motik, B.; Parsia, B.; PatelSchneider, P.; and Sattler, U. 2008. OWL 2: The next step for OWL. Journal of Web Semantics 6(4):309322.
Dantsin, E.; Eiter, T.; Gottlob, G.; and Voronkov, A. 2001.Complexity and expressive power of logic programming.ACM Computing Surveys 33(3):374425.
Eiter, T.; Ortiz, M.; Simkus, M.; Tran, T.-K.; and Xiao, G.2012. Query Rewriting for Horn-SHIQ Plus Rules. In Proceedings of the 26th AAAI Conference on Artificial Intelligence, (AAAI 2012). AAAI Press.
Fitting, M. 1996. First-order logic and automated theorem proving (2nd ed.). Secaucus, NJ, USA: Springer-Verlag New York, Inc.
Glimm, B.; Horrocks, I.; Lutz, C.; and Sattler, U. 2008.Conjunctive Query Answering for the Description Logic SHIQ. Journal of Artificial Intelligence Research 31:151 198.
Guo, Y.; Pan, Z.; and Heflin, J. 2005. LUBM: A benchmark for OWL knowledge base systems. Journal of Web Semantics 3(23):158182.
Kontchakov, R.; Lutz, C.; Toman, D.; Wolter, F.; and Zakharyaschev, M. 2011. The Combined Approach to 
Ontology-Based Data Access. In Walsh, T., ed., Proceedings of the 22nd International Joint Conference on Artificial Intelligence (IJCAI 2011). AAAI Press.
Krotzsch, M.; Rudolph, S.; and Hitzler, P. 2007. Conjunctive queries for a tractable fragment of OWL 1.1. In Aberer, 
K.; Choi, K.-S.; Noy, N.; Allemang, D.; Lee, K.-I.; Nixon, L.; Golbeck, J.; Mika, P.; Maynard, D.; Mizoguchi, R.; 
Schreiber, G.; and Cudre-Mauroux, P., eds., Proceedings of the 6th International Semantic Web Conference (ISWC07), volume 4825 of LNCS, 310323. Springer.
Krotzsch, M.; Rudolph, S.; and Hitzler, P. 2008. ELP: Tractable rules for OWL 2. In Sheth, A.; Staab, S.; Dean, 
M.; Paolucci, M.; Maynard, D.; Finin, T.; and Thirunarayan, K., eds., Proceedings of the 7th International Semantic Web Conference (ISWC08), volume 5318 of LNCS, 649664.Springer.
Lutz, C.; Seylan, I.; Toman, D.; and Wolter, F. 2012. The Combined Approach to OBDA: Taming Role Hierarchies using Filters. In Fokoue, A.; Liebig, T.; Goodman, E.; 
Weaver, J.; Urbani, J.; and Mizell, D., eds., Proceedings of the Joint Workshop on Scalable and High-Performance Semantic Web Systems (SSWS+HPCSW 2012), volume 943 of CEUR Workshop Proceedings, 1631. CEUR-WS.org.
Lutz, C.; Toman, D.; and Wolter, F. 2009. Conjunctive Query Answering in the Description Logic EL Using a Relational Database System. In Boutilier, C., ed., Proceedings of the 21st International Joint Conference on Artificial Intelligence, (IJCAI 2009), 20702075. AAAI Press.
Ortiz, M.; Rudolph, S.; and Simkus, M. 2011. Query Answering in the Horn Fragments of the Description Logics 
SHOIQ and SROIQ. In Walsh, T., ed., Proceedings of the 22nd International Joint Conference on Artificial Intelligence (IJCAI 2011), 10391044. Barcelona, Spain: AAAI Press.
Perez-Urbina, H.; Motik, B.; and Horrocks, I. 2010.Tractable Query Answering and Rewriting under Description Logic Constraints. Journal of Applied Logic 8(2):186 209.
Rosati, R. 2007. On Conjunctive Query Answering in EL.In Calvanese, D.; Franconi, E.; Haarslev, V.; Lembo, D.; 
Motik, B.; Turhan, A.-Y.; and Tessaris, S., eds., Proceedings of the 20th International Workshop on Description Logics (DL-2007), CEUR Workshop Proceedings. CEUR-WS.org.
Stefanoni, G.; Motik, B.; and Horrocks, I. 2013. Introducing Nominals to the Combined Query Answering Approaches for EL. CoRR abs/1303.7430.
-----0
Cohen, W. W.; Ravikumar, P.; and Fienberg, S. E. 2003. A Comparison of String Distance Metrics for Name-Matching Tasks. In International Joint Conference on Artificial Intelligence, 7378.
Hovy, E. H.; Gerber, L.; Hermjakob, U.; Junk, M.; and Lin, C.-Y. 2000. Question answering in webclopedia. In TREC.
Ji, S.; Zhou, K.; Liao, C.; Zheng, Z.; Xue, G.-R.; Chapelle, O.; Sun, G.; and Zha, H. 2009. Global ranking by exploiting user clicks. In Proceedings of the 32nd Annual International ACM SIGIR Conference on Research and Development in Information Retrieval, 3542.
Joachims, T. 2006. Training Linear SVMs in Linear Time.In Proceedings of the ACM Conference on Knowledge Discovery and Data Mining (KDD).
Lin, C.-Y. 2008. Automatic question generation from queries. In Proceedings of Workshop on the Question Generation Shared Task and Evaluation Challenge, 929937.
Radlinski, F.; Szummer, M.; and Craswell, N. 2010. Inferring query intent from reformulations and clicks. In WWW 2010, Proceedings of the 19th Annual International World Wide Web Conference.
Surdeanu, M.; Ciaramita, M.; and Zaragoza, H. 2011.Learning to rank answers to non-factoid questions from web collections. Computational Linguistics 37(2):351383.
Suzuki, S.; Nakayama, S.; and Joho, H. 2011. Formulating effective questions for community-based question answering. In Proceeding of the 34th International ACM SIGIR Conference on Research and Development in Information Retrieval, SIGIR, 12611262.
Wen, J.-R.; Nie, J.-Y.; and Zhang, H. 2002. Query clustering using user logs. ACM Trans. Inf. Syst. 20(1):5981.
Xu, J.; Chen, C.; Xu, G.; Li, H.; and Abib, E. R. T. 2010.Improving quality of training data for learning to rank using click-through data. In WSDM10 , Proceedings of the Third International Conference on Web Search and Web Data Mining, 171180.
Zhao, S.; Wang, H.; Li, C.; Liu, T.; and Guan, Y. 2011. Automatically generating questions from queries for communitybased question answering. In Proceedings of 5th International Joint Conference on Natural Language Processing, 929937.
Zhao, S.; Wang, H.; and Liu, T. 2010. Paraphrasing with search engine query logs. In COLING 2010, 23rd International Conference on Computational Linguistics, Proceedings of the Conference, 13171325.Zhao, S.; Zhou, M.; and Liu, T. 2007. Learning question paraphrases for qa from encarta logs. In IJCAI 2007, Proceedings of the 20th International Joint Conference on Artificial Intelligence, 17951801.
Zheng, Z.; Si, X.; Chang, E.; and Zhu, X. 2011. K2q: Generating natural language questions from keywords with user refinements. In Proceedings of 5th International Joint Conference on Natural Language Processing, 947955.
-----0
Avrachenkov, K.; Litvak, N.; Nemirovsky, D.; and Osipova, N.
2007. Monte Carlo Methods in PageRank Computation: When One Iteration is Sufficient. SIAM J. Numerical Analysis.
Bahmani, B.; Kumar, R.; Mahdian, M.; and Upfal, E. 2012. PageRank on an Evolving Graph. In KDD.
Bahmani, B.; Chowdhury, A.; and Goel, A. 2010. Fast Incremental and Personalized PageRank. PVLDB.
Bryce, D., and Kambhampati, S. 2007. A Tutorial on Planning Graph Based Reachability Heuristics. AI Magazine.
Chien, S.; Dwork, C.; Kumar, R.; Simon, D. R.; and Sivakumar, D.2003. Link Evolution: Analysis and Algorithms. Internet Mathematics.
Cormen, T. H.; Leiserson, C. E.; Rivest, R. L.; and Stein, C. 2009.Introduction to Algorithms. The MIT Press.
Dagan, I.; Glickman, O.; Gliozzo, A. M.; Marmorshtein, E.; and Strapparava, C. 2006. Direct Word Sense Matching for Lexical Substitution. In ACL.
Erkan, G., and Radev, D. R. 2004. LexRank: Graph-based Lexical Centrality as Salience in Text summarization. J. Artif. Intell. Res.(JAIR).
Fellbaum, C., and Miller, G. 1998. WordNet: An Electronic Lexical Database. A Bradford Book.
Fujiwara, Y.; Nakatsuji, M.; Onizuka, M.; and Kitsuregawa, M.2012a. Fast and Exact Top-k Search for Random Walk with Restart.PVLDB.
Fujiwara, Y.; Nakatsuji, M.; Yamamuro, T.; Shiokawa, H.; and Onizuka, M. 2012b. Efficient Personalized PageRank with Accuracy Assurance. In KDD.
Fujiwara, Y.; Nakatsuji, M.; Shiokawa, H.; and Onizuka, M. 2013.Efficient Search Algorithm for SimRank. In ICDE.
Fujiwara, Y.; Irie, G.; and Kitahara, T. 2011. Fast Algorithm for Affinity Propagation. In IJCAI.
Gleich, D.; Zhukov, L.; and Berkhin, P. 2004. Fast Parallel PageRank: A Linear System Approach. Technical report, Yahoo! 
Kamvar, S.; Haveliwala, T.; and Golub, G. 2004. Adaptive Methods for the Computation of PageRank. Linear Algebra and its Applications. Special Issue on the Conference on the Numerical Solution of Markov Chains.
Khabiri, E.; Caverlee, J.; and Hsu, C.-F. 2011. Summarizing Usercontributed Comments. In International AAAI Conference on Weblogs and Social Media.
Langville, A. N., and Meyer, C. D. 2006. Updating Markov Chains with an Eye on Googles PageRank. SIAM J. Matrix Analysis Applications.
Langville, A. N., and Meyer, C. D. 2012. Googles PageRank and Beyond: The Science of Search Engine Rankings. Princeton University Press.
Lee, E.-S.; Yeung, F.; and Yu, T.-Y. 2012. Variable Categorization and Modelling: A Novel Adversarial Approach to mobile locationbased advertising. In AAAI Workshops.
Manning, C., and Schuetze, H. 1999. Foundations of Statistical Natural Language Processing. The MIT Press.
McCarthy, D. 2002. Lexical Substitution as a Task for WSD Evaluation. In ACL-02 workshop on Word sense disambiguation: recent successes and future directions.
McSherry, F. 2005. A Uniform Approach to Accelerated PageRank Computation. In WWW.
Mehlhorn, K., and Sanders, P. 2010. Algorithms and Data Structures: The Basic Toolbox. Springer.
Nakatsuji, M.; Fujiwara, Y.; Uchiyama, T.; and Toda, H. 2012. Collaborative Filtering by Analyzing Dynamic User Interests Modeled by Taxonomy. In ISWC.
Page, L.; Brin, S.; Motwani, R.; and Winograd, T. 1999. The PageRank Citation Ranking: Bringing Order to the Web. Technical report, Stanford InfoLab.
Shiokawa, H.; Fujiwara, Y.; and Onizuka, M. 2013. Fast Algorithm for Modularity-based Graph Clustering. In AAAI.
Shmueli, E.; Kagian, A.; Koren, Y.; and Lempel, R. 2012. Care to Comment?: Recommendations for Commenting on News Stories.In WWW.
Sinha, R., and Mihalcea, R. 2009. Combining Lexical Resources for Contextual Synonym Expansion. In RANLP.
Sinha, R. S., and Mihalcea, R. F. 2011. Using Centrality Algorithms on Directed Graphs for Synonym Expansion. In FLAIRS Conference.
Watkins, D. S. 2007. The Matrix Eigenvalue Problem: GR and Krylov Subspace Methods. Society for Industrial Mathematics.
Yin, X., and Lee, W. S. 2004. Using Link Analysis to Improve Layout on Mobile Devices. In WWW.
-----0
Blei, D. M.; Ng, A. Y.; and Jordan, M. I. 2001. Latent Dirichlet Allocation. In Proceedings of Advances in Neural Information Processing Systems 15 [Neural Information Processing Systems (NIPS 2001)], 601608. MIT Press.
Blondel, V. D.; Guillaume, J.-L.; Lambiotte, R.; and Lefebvre, E. 2008. Fast Unfolding of Communities in Large Networks. Journal of Statistical Mechanics: Theory and Experiment 2008:P10008.
Boldi, P.; Rosa, M.; Santini, M.; and Vigna, S. 2011. Layered Label Propagation: A MultiResolution Coordinate-Free Ordering for Compressing Social Networks. In Proceedings of the 20th international conference on World Wide Web (WWW 2011). ACM Press.
Browet, A.; Absil, P.-A.; and Dooren, P. V. 2011. Community Detection for Hierarchical Image Segmentation. In Proceedings of the 14th International Workshop on Combinatorial Image Analysis (IWCIA 2011), Lecture Notes in Computer Science, 358371. Springer.
Clauset, A.; Newman, M. E. J.; and Moore, C. 2004. Finding Community Structure in Very Large Networks. Physical Review E PHYS REV E 70:066111.
Faloutsos, M.; Faloutsos, P.; and Faloutsos, C. 1999. On Power-law Relationships of the Internet Topology. In Proceedings of the ACM SIGCOMM 1999 Conference on Applications, Technologies, Architectures, and Protocols for Computer Communication (SIGCOMM 1999), 251262.New York, NY, USA: ACM.
Fujiwara, Y.; Nakatsuji, M.; Yamamuro, T.; Shiokawa, H.; and Onizuka, M. 2012. Efficient Personalized PageRank with Accuracy Assurance. In Proceedings of 18th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD 2012), 1523. ACM.
Herlocker, J. L.; Konstan, J. A.; Borchers, A.; and Riedl, J. 1999. An Algorithmic Framework for Performing Collaborative Filtering. In Proceedings of the 22nd Annual International ACM SIGIR Conference on Research and Development in Information Retrieval (SIGIR 1999), 230237.ACM.
Hofmann, T. 2004. Latent Semantic Models for Collaborative Filtering. ACM Transactions on Information Systems (TOIS) 22(1):89115.
Kernighan, B. W., and Lin, S. 1970. An Efficient Heuristic Procedure for Partitioning Graphs. Bell System Technical journal 49(2):291307.
Kleinberg, J. M. 2002. Bursty and Hierarchical Structure in Streams. In Proceedings of the 8th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD 2002), 91101. ACM.
Latapy, M.; Magnien, C.; and Vecchio, N. D. 2008. Basic Notions for the Analysis of Large Two-mode Networks.Social Networks 30(1):3148.
Nakatsuji, M.; Fujiwara, Y.; Uchiyama, T.; and Toda, H.2012. Collaborative Filtering by Analyzing Dynamic User Interests Modeled by Taxonomy. In Proceedings of the 11th International Semantic Web Conference (ISWC 2012), Lecture Notes in Computer Science, 361377. Springer.
Newman, M. E. J., and Girvan, M. 2004. Finding and Evaluating Community Structure in Networks. Physical Review E PHYS REV E 69:026113.
Newman, M. E. J. 2003. The Structure and Function of Complex Networks. SIAM REVIEW 45(2):167256.
Newman, M. E. J. 2004. Fast Algorithm for Detecting Community Structure in Networks. Physical Review E PHYS REV E 69:066133.
Sibona, C., and Choi, J. H. 2012. Factors Affecting End User Satisfaction on Facebook. In Proceedings of the 6th International AAAI Conference on Weblogs and Social Media (ICWSM 2012). AAAI Press.
Wakita, K., and Tsurumi, T. 2007. Finding Community Structure in Mega-Scale Social Networks. In Proceedings of the 16th International Conference on World Wide Web (WWW 2007), 12751276. ACM.
Weng, J., and Lee, B.-S. 2011. Event Detection in Twitter.In Proceedings of the 5th International AAAI Conference on Weblogs and Social Media (ICWSM 2011). AAAI Press.
Yang, Y.; Pierce, T.; and Carbonell, J. G. 1998. A Study of Retrospective and On-Line Event Detection. In Proceedings of the 21st Annual International ACM SIGIR Conference on Research and Development in Information Retrieval (SIGIR 1998), 2836. ACM.
Yu, D.; Wu, T.; Shan, Y.; Wang, Y.; He, Y.; and Yang, N.2010. Making Human Connectome Faster: CPU Acceleration of Brain Network Analysis. In Proceedings of IEEE 16th International Conference on Parallel and Distributed Systems (ICPADS 2010), 593600. IEEE.
Zhou, T. C.; Ma, H.; Kyu, M. R.; and King, I. 2010. UserRec: A User Recommendation Framework in Social Tagging Systems. In Proceedings of the 24th AAAI Conference on Artificial Intelligence (AAAI 2010). AAAI Press.
-----0
Boyd, S.; Parikh, N.; Chu, E.; Peleato, B.; and Eckstein, J.2010. Distributed Optimization and Statistical Learning via the Alternating Direction Method of Multipliers. Foundations and Trends in Machine Learning 3(1):1122.
Byrd, R. H.; Lu, P.; Nocedal, J.; and Zhu, C. 1995. A limited memory algorithm for bound constrained optimization. SIAM Journal on Scientific and Statistical Computing 16(5):11901208.
Dawid, A. P., and Skene, A. M. 1979. Maximum likelihood estimation of observer error-rates using the EM algorithm.Journal of the Royal Statistical Society. Series C (Applied Statistics) 28(1):2028.
Dekel, O., and Shamir, O. 2009. Vox populi: collecting high-quality labels from a crowd. In Proceedings of the 22nd Annual Conference on Learning Theory.
Finin, T.; Murnane, W.; Karandikar, A.; Keller, N.; Martineau, J.; and Dredze, M. 2010. Annotating named entities in twitter data with crowdsourcing. In Proceedings of the NAACL HLT 2010 Workshop on Creating Speech and Language Data with Amazons Mechanical Turk, 8088.
Gabay, D., and Mercier, B. 1976. A dual algorithm for the solution of nonlinear variational problems via finite element approximation. Computers & Mathematics with Applications 2(1):1740.
Gomes, R.; Welinder, P.; Krause, A.; and Perona, P. 2011.Crowdclustering. In Advances in Neural Information Processing Systems 24, 558566.
Hocking, T. D.; Joulin, A.; Bach, F.; and Vert, J.-P. 2011.Clusterpath: an algorithm for clustering using convex fusion penalties. In Proceedings of the 28th International Conference on Machine Learning, 745752.
Kajino, H.; Tsuboi, Y.; and Kashima, H. 2012. A convex formulation for learning from crowds. In Proceedings of the 26th AAAI Conference on Artificial Intelligence, 7379.Lease, M. 2011. On Quality Control and Machine Learning in Crowdsourcing. In Proceedings of the third Human Computation Workshop, 97102.
Lin, C. H.; Mausam; and Weld, D. S. 2012. Crowdsourcing control: moving beyond multiple choice. In Proceedings of the 28th Conference on Uncertainty in Artificial Intelligence, 491500.
Pelckmans, K.; De Brabanter, J.; Suykens, J.; and De Moor, B. 2005. Convex clustering shrinkage. In Proceedings of Workshop on Statistics and Optimization of Clustering.
Raykar, V. C.; Yu, S.; Zhao, L. H.; Florin, C.; Bogoni, L.; and Moy, L. 2010. Learning from crowds. Journal of Machine Learning Research 11:12971322.
Ritter, A.; Clark, S.; and Etzioni, O. 2011. Named entity recognition in tweets: an experimental study. In Proceedings of the 2011 Conference on Empirical Methods in Natural Language Processing, 15241534.
Sheng, V. S.; Provost, F.; and Ipeirotis, P. G. 2008. Get another label? Improving data quality and data mining using multiple, noisy labelers. In Proceedings of the 14th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, 614622.
Tamuz, O.; Liu, C.; Belongie, S.; Shamir, O.; and Kalai, A. T. 2011. Adaptively learning the crowd kernel. In Proceedings of the 28th International Conference on Machine Learning, 673680.
Tian, Y., and Zhu, J. 2012. Learning from crowds in the presence of schools of thought. In Proceedings of the 18th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, 226234.
Tibshirani, R. 1996. Regression shrinkage and selection via the lasso. Journal of the Royal Statistical Society. Series B (Methodological) 58(1):267288.
Welinder, P.; Branson, S.; Belongie, S.; and Perona, P. 2010.The multidimensional wisdom of crowds. In Advances in Neural Information Processing Systems 23, 24242432.
Whitehill, J.; Ruvolo, P.; Wu, T.; Bergsma, J.; and Movellan, J. 2009. Whose vote should count more: optimal integration of labels from labelers of unknown expertise. In Advances in Neural Information Processing Systems 22, 20352043.
Yan, Y.; Rosales, R.; Fung, G.; and Dy, J. G. 2011. Active learning from crowds. In Proceedings of the 28th International Conference on Machine Learning, 11611168.
Yuan, M., and Lin, Y. 2006. Model selection and estimation in regression with grouped variables. Journal of the Royal Statistical Society: Series B (Statistical Methodology) 68(1):4967.
-----0
Dalal, N., and Triggs, B. 2005. Histograms of oriented gradients for human detection. In Proc. of IEEE Conference on Computer Vision and Pattern Recognition.
Datta, R.; Joshi, D.; Li, J.; and Wang, J. Z. 2006. Studying aesthetics in photographic images using a computational approach. In Proc. of European Conference on Computer Vision.
Dhar, S.; Ordonez, V.; and Berg, T. L. 2011. High level describable attributes for predicting aesthetics and interestingness. In Proc. of IEEE Conference on Computer Vision and Pattern Recognition.
Joachims, T. 2003. Optimizing search engines using clickthrough data. In Proc. of the ACM Conference on Knowledge Discovery and Data Mining.
Katti, H.; Bin, K. Y.; Chua, T. S.; and Kankanhalli, M. 2008.Pre-attentive discrimination of interestingness in images. In Proc. of IEEE International Conference on Multimedia and Expo.
Ke, Y.; Hoiem, D.; and Sukthankar, R. 2005. Computer vision for music identification. In Proc. of IEEE Conference on Computer Vision and Pattern Recognition.
Ke, Y.; Tang, X.; and Jing, F. 2006. The design of highlevel features for photo quality assessment. In Proc. of IEEE Conference on Computer Vision and Pattern Recognition.
Laptev, I.; Marszalek, M.; Schmid, C.; and Rozenfeld, B.2008. Learning realistic human actions from movies. In Proc. of IEEE Conference on Computer Vision and Pattern Recognition.
Lerman, K.; Plangprasopchok, A.; and Wong, C. 2007. Peronalizing image search results on flickr. In Proc. of AAAI Workshop on Intelligent Techniques for Web Personlization.
Li, L.; Su, H.; Xing, E.; and Fei-Fei, L. 2010. Object bank: A high-level image representation for scene classification semantic feature sparsification. In Advances in Neural Information Processing Systems.
Liu, F.; Niu, Y.; and Gleicher, M. 2009. Using web photos for measuring video frame interestingness. In Proc. of International Joint Conference on Artificial Intelligence.
Lowe, D. 2004. Distinctive image features from scaleinvariant keypoints. International Journal on Computer Vision 60:91110.
Murray, N.; Marchesotti, L.; and Perronnin, F. 2012. AVA: A large-scale database for aesthetic visual analysis. In Proc.of IEEE Conference on Computer Vision and Pattern Recognition.
Oliva, A., and Torralba, A. 2001. Modeling the shape of the scene: a holistic representation of the spatial envelope.International Journal of Computer Vision 42:145175.
Shechtman, E., and Irani, M. 2007. Matching local selfsimilarities across images and videos. In Proc. of IEEE Conference on Computer Vision and Pattern Recognition.
Sivic, J., and Zisserman, A. 2003. Video Google: A text retrieval approach to object matching in videos. In Proc. of IEEE International Conference on Computer Vision.
Stein, B. E., and Stanford, T. R. 2008. Multisensory integration: current issues from the perspective of the single neuron. Nature Reviews Neuroscience 9:255266.
Torresani, L.; Szummer, M.; and Fitzgibbon, A. 2010. Efficient object category recognition using classemes. In Proc.of European Conference on Computer Vision.
Xiao, J.; Hays, J.; Ehinger, K.; Oliva, A.; and Torralba, A.2010. SUN database: Large-scale scene recognition from abbey to zoo. In Proc. of IEEE Conference on Computer Vision and Pattern Recognition.
-----0
Boutilier, C.; Zemel, R. S.; and Marlin, B. 2003. Active collaborative filtering. In UAI, 98106.
Cao, B.; Liu, N. N.; and Yang, Q. 2010. Transfer learning for collective link prediction in multiple heterogenous domains.In ICML, 159166.
Chan, Y. S., and Ng, H. T. 2007. Domain adaptation with active learning for word sense disambiguation. In ACL.
Jin, R., and Si, L. 2004. A bayesian approach toward active learning for collaborative filtering. In UAI, 278285.
Koren, Y.; Bell, R.; and Volinsky, C. 2009. Matrix factorization techniques for recommender systems. Computer 42(8):3037.
Li, W.-J., and Yeung, D.-Y. 2009. Relation regularized matrix factorization. In IJCAI, 11261131.
Li, B.; Yang, Q.; and Xue, X. 2009a. Can movies and books collaborate?: cross-domain collaborative filtering for sparsity reduction. In IJCAI, 20522057.
Li, B.; Yang, Q.; and Xue, X. 2009b. Transfer learning for collaborative filtering via a rating-matrix generative model.In ICML, 617624.
Mehta, B., and Hofmann, T. 2006. Cross system personalization and collaborative filtering by learning manifold alignments. In KI. 244259.
Mello, C. E.; Aufaure, M.-A.; and Zimbrao, G. 2010. Active learning driven by rating impact analysis. In RecSys, 341 344.
Pan, S. J., and Yang, Q. 2010. A survey on transfer learning. IEEE Transactions on Knowledge and Data Engineering 22(10):13451359.
Pan, W.; Xiang, E. W.; Liu, N. N.; and Yang, Q. 2010. Transfer learning in collaborative filtering for sparsity reduction.In AAAI.
Pan, W.; Xiang, E.; and Yang, Q. 2012. Transfer learning in collaborative filtering with uncertain ratings. In TwentySixth AAAI Conference on Artificial Intelligence.
Park, Y.-J., and Tuzhilin, A. 2008. The long tail of recommender systems and how to leverage it. In RecSys, 1118.
Rai, P.; Saha, A.; Daume, III, H.; and Venkatasubramanian, S. 2010. Domain adaptation meets active learning. In NAACL HLT 2010 Workshop on Active Learning for Natural Language Processing, 2732.
Rennie, J. D. M., and Srebro, N. 2005. Fast maximum margin matrix factorization for collaborative prediction. In ICML, 713719.
Rish, I., and Tesauro, G. 2008. Active collaborative prediction with maximum margin matrix factorization. In ISAIM.
Saha, A.; Rai, P.; III, H. D.; Venkatasubramanian, S.; and DuVall, S. L. 2011. Active supervised domain adaptation.In ECML/PKDD (3), 97112.
Shi, X.; Fan, W.; and Ren, J. 2008. Actively transfer domain knowledge. In ECML/PKDD (2), 342357.
Shi, L.; Zhao, Y.; and Tang, J. 2012. Batch mode active learning for networked data. ACM Transaction on Intelligent Systems and Technology 3(2):33:133:25.
Singh, A. P., and Gordon, G. J. 2008. Relational learning via collective matrix factorization. In KDD, 650658.
Srebro, N.; Rennie, J. D. M.; and Jaakkola, T. S. 2005.Maximum-margin matrix factorization. In NIPS 17, 1329 1336.
Tang, J.; Yan, J.; Ji, L.; Zhang, M.; Guo, S.; Liu, N.; Wang, X.; and Chen, Z. 2011. Collaborative users brand preference mining across multiple domains from implicit feedbacks. In AAAI.
Zhang, Y.; Cao, B.; and Yeung, D.-Y. 2010. Multi-domain collaborative filtering. In UAI, 725732.
-----0
Cohen, I., F. G. Cozman, et al. 2004. Semisupervised Learning of Classifiers: Theory, Algorithms, and Their Application to Human Computer Interaction. IEEE Transactions on Pattern Analysis and Machine Intelligence 26(12): 1553 1567.
Cozman, F. G., I. Cohen, et al. 2003. Semi-Supervised Learning of Mixture Models. In Proceedings of ICML, 99 106.
Humpherys, S. L., K. C. Moffitt, et al. 2011. Identification of fraudulent financial statements using linguistic credibility analysis. Decision Support Systems 50(3): 585594.
Li, F. 2010. The Information Content of Forward-Looking Statements in Corporate FilingsA Naive Bayesian Machine Learning Approach. Journal of Accounting Research 48(5): 10491102.
Li, Y.-F. and Z.-H. Zhou 2011. Towards Making Unlabeled Data Never Hurt. In Proceedings of ICML, 10811088.
Liu, B. 2012. Sentiment Analysis and Opinion Mining, Morgan & Claypool Publishers.
McCallum, A. K. and K. Nigam 1998. Employing EM and Pool-Based Active Learning for Text Classification. In Proceedings of ICML, 359367.
Andrew Y. Ng, Michael I. Jordan 2002. On discriminative vs. generative classifiers: A comparison of logistic regression and naive bayes. In Proceedings of NIPS, 841848 
Nigam, K., A. McCallum, et al. 1998. Learning to Classify Text from Labeled and Unlabeled Documents. In Proceedings of AAAI, 792799.
Nigam, K., A. K. McCallum, et al. 2000. Text Classification from Labeled and Unlabeled Documents using EM.Machine Learning 39(2-3): 103134.
Oh, C. and O. Sheng 2011. Investigating Predictive Power of Stock Micro Blog Sentiment in. Forecasting Future Stock Price Directional Movement. In Proceedings of International Conference on Information Systems (ICIS 2011).
Pang, B. and L. Lee 2008. Opinion Mining and Sentiment Analysis. Foundations and Trends in Information Retrieval 2(1-2): 1135.
Toutanova, K., F. Chen, et al. 2001. Text Classification in a Hierarchical Mixture Model for Small Training Sets. In Proceedings of CIKM, 105113.
Zhang, R. and A. I. Rudnicky 2006. A New Data Selection Principle for Semi-Supervised Incremental Learning. In Proceedings of ICPR, 780-783.
-----0
Azari Soufiani, H.; Parkes, D. C.; and Xia, L. 2012. Random utility theory for social choice: Theory and algorithms. In Proc. of 26th NIPS.
Brandt, F.; Fischer, F.; Harrenstein, P.; and Mair, M. 2008. A computational analysis of the Tournament Equilibrium Set.In Proc. of 23rd AAAI, 3843.
Conitzer, V., and Sandholm, T. 2005. Common voting rules as maximum likelihood estimators. In Proc. of 21st UAI, 145152.
Conitzer, V.; Davenport, A.; and Kalagnanam, H. 2006. Improved bounds for computing Kemeny rankings. In Proc. of 21st AAAI, 620626.
Conitzer, V.; Rognlie, M.; and Xia, L. 2009. Preference functions that score rankings and maximum likelihood estimation. In Proc. of 21st IJCAI, 109115.
Conitzer, V.; Sandholm, T.; and Lang, J. 2007. When are elections with few candidates hard to manipulate? Journal of the ACM 54(3):133.
Conitzer, V. 2006. Computing Slater rankings using similarities among candidates. In Proc. of 21st AAAI, 613619.
Cooper, S.; Khatib, F.; Treuille, A.; Barbero, J.; Lee, J.; Beenen, M.; Leaver-Fay, A.; Baker, D.; and Popovic, Z. 2010a.Predicting protein structures with a multiplayer online game.Nature 466:756760.
Cooper, S.; Treuille, A.; Barbero, J.; Leaver-Fay, A.; Tuite, K.; Khatib, F.; Snyder, A. C.; Beenen, M.; Salesin, D.; Baker, D.; and Popovic, Z. 2010b. The challenge of designing scientific discovery games. In Proceedings of the Fifth International Conference on the Foundations of Digital Games, FDG 10, 4047. New York, NY, USA: ACM.
Dai, P.; Mausam; and Weld, D. S. 2010. Decision-theoretic control of crowd-sourced workflows. In Proc. of 24th AAAI, 11681174.
Dwork, C.; Kumar, R.; Naor, M.; and Sivakumar, D. 2001.Rank aggregation methods for the web. In Proc. of 10th WWW, 613622.
Faliszewski, P., and Procaccia, A. D. 2010. AIs war on manipulation: Are we winning? AI Magazine 31(4):5364.
Forsythe, R.; Rietz, T.; Myerson, R.; and Weber, R. 1996.An experimental study of voting rules and polls in threecandidate elections. International Journal of Game Theory 25(3):355383.
Goel, A., and Lee, D. 2012. Triadic consensus  a randomized algorithm for voting in a crowd. In Proc. of 8th WINE, 434447.
Hemaspaandra, E.; Hemaspaandra, L. A.; and Rothe, J.1997. Exact analysis of Dodgson elections: Lewis Carrolls 1876 voting system is complete for parallel access to NP.Journal of the ACM 44(6):806825.
Horton, J. J. 2010. The dot-guessing game: A fruit fly for human computation research. Available at SSRN: http://ssrn.com/abstract=1600372 or http://dx.doi.org/10.2139/ssrn.1600372.
Kamar, E.; Hacker, S.; and Horvitz, E. 2012. Combining human and machine intelligence in large-scale crowdsourcing.In Proc. of 11th AAMAS.
Little, G.; Chilton, L. B.; Goldman, M.; and Miller, R. C.2010a. Exploring iterative and parallel human computation processes. In Proc. of 2nd HCOMP.
Little, G.; Chilton, L. B.; Goldman, M.; and Miller, R. C.2010b. Turkit: Human computation algorithms on Mechanical Turk. In Proc. of 23rd UIST, 5766.
McFadden, D. 1974. Conditional Logit Analysis of Qualitative Choice Behavior. In Zarembka, P., ed., Frontiers in econometrics. New York: Academic Press. 105142.
Mosteller, F. 1951. Remarks on the method of paired comparisons: I. the least squares solution assuming equal standard deviations and equal correlations. Psychometrika 16(1):39.
Palfrey, T. R. 2009. Laboratory experiments in political economy. Annual Review of Political Science 12:379388.
Pfeiffer, T.; Gao, X. A.; Mao, A.; Chen, Y.; and Rand, D. G.2012. Adaptive polling and information aggregation. In Proc. of 26th AAAI.
Procaccia, A. D., and Rosenschein, J. S. 2007. Junta distributions and the average-case complexity of manipulating elections. Journal of Artificial Intelligence Research 28:157181.
Procaccia, A. D.; Reddi, S. J.; and Shah, N. 2012. A maximum likelihood approach for selecting sets of alternatives.In Proc. of 28th UAI, 695704.
Shahaf, D., and Horvitz, E. 2010. Generalized task markets for human and machine computation. In Proc. of 24th AAAI, 986993.
Thurstone, L. L. 1927. A law of comparative judgement.Psychological Review 34:273286.
von Ahn, L., and Dabbish, L. 2008. Designing games with a purpose. Communications of the ACM 51(8):5867.
Young, H. P. 1988. Condorcets theory of voting. The American Political Science Review 82(4):12311244.
-----0
Adams, S. J. 1963. Toward an understanding of inequity.Journal of Abnormal and Social Psychology 67:422436.
Akerlof, G., and Yellen, J. 1988. Fairness and unemployment. The American Economic Review 78(2):4449.
Amir, O.; Rand, D. G.; and Gal, Y. K. 2012. Economic games on the internet: The effect of $1 stakes. PLoS ONE 7(2):e31461.
Ariely, D.; Gneezy, U.; Loewenstein, G.; and Mazar, N.2009. Large stakes and big mistakes. Review of Economic Studies 76(2):451469.
Ariely, D.; Loewenstein, G.; and Prelec, D. 2003. Coherent arbitrariness: Stable demand curves without stable preferences. The Quarterly Journal of Economics 118(1):73106.
Benkler, Y. 2002. Coases Penguin, or, Linux and the Nature of the Firm. Yale Law Journal 112(3):367445.
Bowles, S. 2008. Policies Designed for Self-Interested Citizens May Undermine The Moral Sentiments: Evidence from Economic Experiments Science. 320(5883):1605 1609.
Camerer, C. F., and Hogarth, R. M. 1999. The effects of financial incentives in experiments: A review and capitallabor-production framework. Journal of Risk and Uncertainty 19(1-3):742.
Chapman, G. B., and Johnson, E. J. 1994. The limits of anchoring. Journal of Behavioral Decision Making 7(4):223 242.
Dai, P.; Mausam; and Weld, D. S. 2010. Decision-theoretic control of crowd-sourced workflows. In Proceedings of the 24th AAAI Conference on Artificial Intelligence, AAAI 10, 11681174.
Dai, P.; Mausam; and Weld, D. S. 2011. Artificial intelligence for artificial artificial intelligence. In Proceedings of the 25th AAAI Conference on Artificial Intelligence, AAAI 11, 11531159.
Deci, E.; Koestner, R.; and Ryan, R. 1999. A metaanalytic review of experiments examining the effects of extrinsic rewards on intrinsic motivation. Psychological Bulletin 125(6):692700.
Fehr, E.; Goette, L.; and Zehnder, C. 2009. A behavioral account of the labor market: The role of fairness concerns.Annu. Rev. Econ. 1(1):355384.
Frey, B. S., and Jege, R. 2001. Motivation crowding theory: A survey of empirical evidence. Journal of Economic Surveys 15(5):589611.
Gneezy, U., and Rustichini, A. 2000. Pay enough or dont pay at all. The Quarterly Journal of Economics 115(3):791 810.
Harris, C. 2011. Youre Hired! An Examination of Crowdsourcing Incentive Models in Human Resource Tasks. In Proceedings of the Workshop on Crowdsourcing for Search and Data Mining (CSDM) at the Fourth ACM International Conference on Web Search and Data Mining (WSDM), 15 18.
Horton, J. J., and Chilton, L. B. 2010. The labor economics of paid crowdsourcing. In Proceedings of the 11th ACM conference on Electronic commerce, EC 10, 209218. New York, NY, USA: ACM.
Jenkins Jr, G.; Mitra, A.; Gupta, N.; and Shaw, J. 1998. Are financial incentives related to performance? a meta-analytic review of empirical research. Journal of Applied Psychology 83(5):777.
Kahneman, D., and Tversky, A. 1984. Choices, values and frames. American Psychologist 39(4):341350.
Kamar, E.; Hacker, S.; and Horvitz, E. 2012. Combining human and machine intelligence in large-scale crowdsourcing. In Proceedings of the 11th International Conference on Autonomous Agents and Multiagent Systems Volume 1, AAMAS 12, 467474. Richland, SC: International Foundation for Autonomous Agents and Multiagent Systems.
Lazear, E. P. 2000. Performance pay and productivity. The American Economic Review 90(5):13461361.
Lin, C.; Mausam; and Weld, D. 2012a. Crowdsourcing control: Moving beyond multiple choice. In Proceedings of the 28th Conference on Uncertainty in Artificial Intelligence, UAI 12, 491500.
Lin, C.; Mausam; andWeld, D. 2012b. Dynamically switching between synergistic workflows for crowdsourcing. In Proceedings of the 26th AAAI Conference on Artificial Intelligence, AAAI 12.
Mason, W., and Watts, D. J. 2009. Financial incentives and the performance of crowds. In Proceedings of the ACM SIGKDD Workshop on Human Computation, HCOMP 09, 7785. New York, NY, USA: ACM.
Miller, N.; Resnick, P.; and Zeckhauser, R. 2005. Eliciting informative feedback: The Peer-Prediction Method. Management Science 51:13591373.
Prelec, D. 2004. A bayesian truth serum for subjective data.Science 306:462466.
Pritchard, R. D., and Curts, M. I. 1973. The influence of goal setting and financial incentives on task performance. Organizational Behavior and Human Performance 10(2):175  183.
Rogstadius, J.; Kostakos, V.; Kittur, A.; Smus, B.; Laredo, J.; and Vukovic, M. 2011. An assessment of intrinsic and extrinsic motivation on task performance in crowdsourcing markets. In Proceedings of the International AAAI Conference on Weblogs and Social Media.
Shaw, A. D.; Horton, J. J.; and Chen, D. L. 2011. Designing incentives for inexpert human raters. In Proceedings of the ACM 2011 conference on Computer supported cooperative work, CSCW 11, 275284. New York, NY, USA: ACM.
Tversky, A., and Kahneman, D. 1974. Judgment under uncertainty: Heuristics and biases. Science 185(4157):1124 1131.
-----0
BBC. 2012. Facebook surpasses one billion users as it tempts new markets.
Bhawalkar, K.; Kleinberg, J. M.; Lewi, K.; Roughgarden, T.; and Sharma, A. 2012. Preventing Unraveling in Social Networks: The Anchored k-Core Problem. In ICALP (2), 440451.
Chwe, M. 1999. Structure and Strategy in Collective Action 1. American Journal of Sociology 105(1):128156.
Chwe, M. 2000. Communication and Coordination in Social Networks. The Review of Economic Studies 67(1):116.
Dahlhaus, E.; Johnson, D. S.; Papadimitriou, C. H.; Seymour, P. D.; and Yannakakis, M. 1994. The Complexity of Multiterminal Cuts. SIAM J. Comput. 23(4):864894.
Dezso?, Z., and Barabasi, A. 2002. Halting Viruses in Scalefree Networks. Physical Review E 65(5):055103.
Downey, R. G., and Fellows, M. R. 1999. Parameterized Complexity. New York: Springer-Verlag.
Dvorak, Z.; Kral, D.; and Thomas, R. 2010. Deciding FirstOrder Properties for Sparse Graphs. In FOCS, 133142.Facebook. 2005. Google Makes Change to Orkut as Facebook Wins in India (http://blogs.wsj.com/digits/2010/08/24/google-makeschange-to-orkut-as-facebook-wins-in-india/).
Flum, J., and Grohe, M. 2006. Parameterized Complexity Theory. Texts in Theoretical Computer Science. An EATCS Series. Berlin: Springer-Verlag.
Mikolajczyk, R. T., and Kretzschmar, M. 2008. Collecting social contact data in the context of disease transmission: Prospective and retrospective study designs. Social Networks 30(2):127  135.
Milgram, S. 1967. The Small World Problem. Psychology Today 2:6067.
Nesetril, J., and de Mendez, P. O. 2006. Linear time low tree-width partitions and algorithmic consequences. In STOC, 391400.
Niedermeier, R. 2006. Invitation to fixed-parameter algorithms, volume 31 of Oxford Lecture Series in Mathematics and its Applications. Oxford: Oxford University Press.
Pastor-Satorras, R., and Vespignani, A. 2001. Epidemic Spreading in Scale-free Networks. Physical review letters 86(14):32003203.
Saaskilahti, P. 2007. Monopoly Pricing of Social Goods.Technical Report. University Librray of Munich.
Schelling, T. 2006. Micromotives and Macrobehavior. 
WW Norton. Seese, D. 1996. Linear Time Computable Problems and First-Order Descriptions. Mathematical Structures in Computer Science 6(6):505526.
Seidman, S. 1983. Network Structure andMinimumDegree.Social networks 5(3):269287.
Wilson, D. 1989. Levels of Selection: An Alternative to Individualism in Biology and the Human Sciences. Social Networks 11(3):257292.
-----0
Agrawal, R.; Gollapudi, S.; Halverson, A.; and Ieong, S.
2009. Diversifying search results. In Proceedings of the Second ACM International Conference on Web Search and Data Mining, 514. ACM.
Agrawal, S.; Ding, Y.; Saberi, A.; and Ye, Y. 2010. Correlation robust stochastic optimization. In Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms, 10871096. Society for Industrial and Applied Mathematics.
Auer, P.; Cesa-Bianchi, N.; and Fischer, P. 2002. Finitetime analysis of the multiarmed bandit problem. Machine learning 47(2):235256.
Calinescu, G.; Chekuri, C.; Pal, M.; and Vondrak, J.2011. Maximizing a monotone submodular function subject to a matroid constraint. SIAM Journal on Computing 40(6):17401766.
Chen, H., and Karger, D. 2006. Less is more: probabilistic models for retrieving fewer relevant documents. In Proceedings of the 29th annual international ACM SIGIR conference on Research and development in information retrieval, 429 436. ACM.
Goldberg, K.; Roeder, T.; Gupta, D.; and Perkins, C. 2001.Eigentaste: A constant time collaborative filtering algorithm.Information Retrieval 4(2):133151.
Li, L.; Chu, W.; Langford, J.; and Schapire, R. E. 2010.A contextual-bandit approach to personalized news article recommendation. In Proceedings of the 19th international conference on World wide web, 661670. ACM.
Mahajan, D. K.; Rastogi, R.; Tiwari, C.; and Mitra, A. 2012.Logucb: an explore-exploit algorithm for comments recommendation. In Proceedings of the 21st ACM international conference on Information and knowledge management, 6 15. ACM.
Nemhauser, G.; Wolsey, L.; and Fisher, M. 1978. An analysis of approximations for maximizing submodular set functionsi. Mathematical Programming 14(1):265294.
Panigrahi, D.; Das Sarma, A.; Aggarwal, G.; and Tomkins, A. 2012. Online selection of diverse results. In Proceedings of the fifth ACM international conference on Web search and data mining, 263272. ACM.
Radlinski, F.; Kleinberg, R.; and Joachims, T. 2008. Learning diverse rankings with multi-armed bandits. In Proceedings of the 25th international conference on Machine learning, 784791. ACM.
Raman, K.; Shivaswamy, P.; and Joachims, T. 2012. Online learning to diversify from implicit feedback. In Proceedings of the 18th ACM SIGKDD international conference on Knowledge discovery and data mining, KDD 12, 705713.New York, NY, USA: ACM.
Robertson, S. E. 1977. The probability ranking principle in ir. Journal of documentation 33(4):294304.Slivkins, A.; Radlinski, F.; and Gollapudi, S. 2010. Learning optimally diverse rankings over large document collections.arXiv preprint arXiv:1005.5197.
Streeter, M.; Golovin, D.; and Krause, A. 2009. Online learning of assignments. In Neural Information Processing Systems (NIPS).
Yue, Y., and Guestrin, C. 2011. Linear submodular bandits and their application to diversified retrieval. In Neural Information Processing Systems (NIPS).
-----0
Bar-Hillel, A.; Hertz, T.; Shental, N.; and D.Weinshall.2005. Learning a mahanalobis metric from equivalence constraints. JMLR 6:937965.
Blaschko, M., and Lampert, C. 2007. Correlational spectral clustering. Computer Vision and Pattern Recognition (CVPR).
Bredin, H., and Chollet, G. 2007. Audio-visual speech synchrony measure for talking-face identity verification. International Conference on Acoustics, Speech, and Signal Processing (ICASSP).
Bronstein, M.; Bronstein, A.; Michel, F.; and Paragios, N.2010. Data fusion through cross-modality metric learning using similarity-sensitive hashing. 35943601.
Chen, D.; Tian, X.; Shen, Y.; and Ouhyoung, M. 2003. On visual similarity based 3d model retrieval. Computer Graphics Forum 22(3):223232.
Chung, F. 1997. Spectral graph theory. American Mathematical Society.
Davis, J.; Kulis, B.; Jain, P.; Sra, S.; and Dhillon, I. 2007.Information-theoretic metric learning. ICML.
Escalante, H.; Hernadez, C.; Sucar, L.; and Montes, M.2008. Late fusion of heterogeneous methods for multimedia image retrieval. Proceeding of the 1st ACM international conference on Multimedia information retrieval.
Greenspan, H.; Goldberger, J.; and Mayer, A. 2004. Probabilistic space-time video modeling via piecewise gmm.IEEE Transactions on Pattern Analysis and Machine Intelligence 26(3):384396.
Hoi, S.; Liu, W.; and Chang, S. 2008. Semi-supervised distance metric learning for collaborative image retrieval. In Computer Vision and Pattern Recognition (CVPR), 17.
Hotelling, H. 1936. Relations between two sets of variates.Biometrika 28(3-4):321377.
Jeon, J.; Lavrenko, V.; and Manmatha, R. 2003. Automatic image annotation and retrieval using cross-media relevance models. Proceedings of the 26th annual international ACM SIGIR conference.
Ji, M.; Sun, Y.; Danilevsky, M.; Han, J.; and Gao, J. 2010.Graph regularized transductive classification on heterogeneous information networks. Machine Learning and Knowledge Discovery in Databases.
Kidron, E.; Schechner, Y.; and Elad, M. 2005. Pixels that sound. Computer Vision and Pattern Recognition (CVPR).
K.Weinberger; Blitzer, J.; and Saul, L. 2006. Distance metric learning for large margin nearest neighbor classification.NIPS.
Li, D.; Dimitrova, N.; Li, M.; and Sethi, I. K. 2003. Multimedia content processing through cross-modal association.
Proceedings of the ACM International Conference on Multimedia 604611.
Park, K.; Shen, C.; Hao, Z.; and Kim, J. 2011. Efficiently learning a distance metric for large margin nearest neighbor classification. In Twenty-Fifth AAAI Conference on Artificial Intelligence.
Rasiwasia, N.; Pereira, J. C.; Coviello, E.; Doyle, G.; Lanckriet, G.; Levy, R.; and Vasconcelos, N. 2010. A new approach to cross-modal multimedia retrieval. ACM international conference on Multimedia.
Wu, W.; Xu, J.; and Li, H. 2010. Learning similarity function between objects in heterogeneous spaces. Microsoft Research Technical Report.
Xing, E.; Ng, A.; Jordan, M.; and Russell, S. 2002. Distance metric learning, with application to clustering with side-information. NIPS 15:505512.Zhang, Y., and Yeung, D. 2011. Multi-task learning in heterogeneous feature spaces. In Twenty-Fifth AAAI Conference on Artificial Intelligence.
Zhou, D.; Bousquet, O.; Lal, T.; Weston, J.; and Scholkopf, B. 2003. Learning with local and global consistency. Advances in Neural Information Processing Systems (NIPS).
Zhu, Y.; Chen, Y.; Lu, Z.; Pan, S.; Xue, G.; Yu, Y.; and Yang, Q. 2011. Heterogeneous transfer learning for image classification. In Twenty-Fifth AAAI Conference on Artificial Intelligence.
-----0
Ahn, L. V.; Liu, R.; and Blum, M. 2006. Peekaboom: A game for locating objects in images. In In ACM CHI, 55 64. ACM Press.
Archak, N. 2010. Money, glory and cheap talk: analyzing strategic behavior of contestants in simultaneous crowdsourcing contests on topcoder. com. In Proceedings of the 19th international conference on World wide web, 2130.ACM.
Austen-Smith, D., and Banks, J. 1996. Information aggregation, rationality, and the condorcet jury theorem. American Political Science Review 3445.
Bachrach, Y.; Graepel, T.; Kasneci, G.; Kosinski, M.; and Van Gael, J. 2012a. Crowd IQ aggregating opinions to boost performance. In AAMAS.
Bachrach, Y.; Graepel, T.; Minka, T.; and Guiver, J. 2012b.How to grade a test without knowing the answersa bayesian graphical model for adaptive crowdsourcing and aptitude testing. ICML.
Chawla, S.; Hartline, J.; and Sivan, B. 2012. Optimal crowdsourcing contests. In Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms, 856 868. SIAM.
Dekel, O.; Fischer, F.; and Procaccia, A. 2008. Incentive compatible regression learning. In SODA.
Demartini, G., D. D. C.-M. P. 2012. Zencrowd: leveraging probabilistic reasoning and crowdsourcing techniques for large-scale entity linking. In WWW, 469478.
Everaere, P.; Konieczny, S.; and Marquis, P. 2007. The strategy-proofness landscape of merging. Journal of Artificial Intelligence Research.
Gao, X.; Bachrach, Y.; Key, P.; and Graepel, T. 2012. Quality expectation-variance tradeoffs in crowdsourcing contests. In Twenty-Sixth AAAI Conference on Artificial Intelligence.
Hambleton, R.; Swaminathan, H.; and Rogers, H. 1991.Fundamentals of item response theory, volume 2. Sage Publications, Inc.
Howe, J. 2006. The rise of crowdsourcing. Wired magazine 14(6):14.
Kendall, M. 1938. A new measure of rank correlation.Biometrika 30(1/2):8193.
Koller, D., and Friedman, N. 2009. Probabilistic Graphical Models: Principles and Techniques.
Kosinski, M.; Bachrach, Y.; Kasneci, G.; Van-Gael, J.; and Graepel, T. 2012. Crowd iq: Measuring the intelligence of crowdsourcing platforms. ACM Web Sciences.
List, C., and Goodin, R. 2001. Epistemic democracy: generalizing the condorcet jury theorem. Journal of Political Philosophy 9(3):277306.
List, C., and Puppe, C. 2009. Judgment aggregation: A survey. Handbook of Rational and Social Choice.
Lubinski, D. 2004. Introduction to the special section on cognitive abilities: 100 years after spearmans (1904)general intelligence,objectively determined and measured.JPSP.
Lyle, J. 2008. Collective problem solving: Are the many smarter than the few? 
McLennan, A. 1998. Consequences of the condorcet jury theorem for beneficial information aggregation by rational agents. American Political Science Review 413418.
Minka, T., and Winn, J. 2008. Gates. NIPS 21.Minka, T.; Winn, J.; Guiver, J.; and Knowles, D. 2010. Infer.NET 2.4.
Minka, T. 2001. A family of algorithms for approximate Bayesian inference. Ph.D. Dissertation.
Pearl, J. 1988. Probabilistic reasoning in intelligent systems : networks of plausible inference.
Pennock, D., and Sami, R. 2007. Computational aspects of prediction markets.
Raykar, V.; Yu, S.; Zhao, L.; Valadez, G.; Florin, C.; Bogoni, L.; and Moy, L. 2010. Learning from crowds. JMLR.
Schmidt, F., and Hunter, J. 2004. General mental ability in the world of work: occupational attainment and job performance. Journal of Personality and Social Psychology 86(1):162.
Sen, P. 1968. Estimates of the regression coefficient based on kendalls tau. Journal of the American Statistical Association 63(324):13791389.
Sen, A. 1986. Social choice theory. Handbook of mathematical economics 3:10731181.von Ahn, L. 2006. Games with a purpose. Computer 39(6):9294.
Welinder, P.; Branson, S.; Belongie, S.; and Perona, P. 2010.The multidimensional wisdom of crowds. In NIPS, volume 6, 8.
Whitehill, J.; Ruvolo, P.; Wu, T.; Bergsma, J.; and Movellan, J. 2009. Whose vote should count more: Optimal integration of labels from labelers of unknown expertise. NIPS 22:20352043.
Woolley, A.; Chabris, C.; Pentland, A.; Hashmi, N.; and Malone, T. 2010. Evidence for a collective intelligence factor in the performance of human groups. Science 330(6004):686.
Yan, Y.; Rosales, R.; Fung, G.; and Dy, J. 2011. Active learning from crowds. In ICML.
-----0
Adamic, L. A.; Lukose, R. M.; Puniyani, A. R.; and Huberman, B. A. 2001. Search in power-law networks. Phys. Rev.E 64:046135.
Altshuler, Y.; Elovici, Y.; Cremers, A. B.; Aharony, N.; and Pentland, A. 2012. Security and Privacy in Social Networks.Springer.
Barabasi, A.-L., and Reka. 1999. Emergence of scaling in random networks. Science 286(5439):509512.
Blondel, V.; Guillaume, J.; Lambiotte, R.; and Lefebvre, E. 2008. Fast unfolding of communities in large networks.Journal of Statistical Mechanics: Theory and Experiment 2008(10):P10008.
Bonneau, J.; Anderson, J.; and Danezis, G. 2009. Prying data out of a social network. In Social Network Analysis and Mining, 2009. ASONAM09. International Conference on Advances in, 249254. IEEE.
Chang, C.; Kayed, M.; Girgis, M.; Shaalan, K.; et al.2006. A survey of web information extraction systems.IEEE transactions on knowledge and data engineering 18(10):1411.
Chau, D. H.; Pandit, S.; Wang, S.; and Faloutsos, C. 2007.Parallel crawling for online social networks. In Proceedings of the 16th international conference on World Wide Web, 12831284. ACM.
Croft, W.; Metzler, D.; and Strohman, T. 2010. Search engines: Information retrieval in practice. Addison-Wesley.
Edelkamp, S.; Jabbar, S.; and Lluch-Lafuente, A. 2005.Cost-algebraic heuristic search. In AAAI, 13621367.
Fire, M.; Tenenboim, L.; Lesser, O.; Puzis, R.; Rokach, L.; and Elovici, Y. 2011. Link prediction in social networks using computationally efficient topological features. In SocialCom/PASSAT, 7380.
Fire, M.; Katz, G.; Elovici, Y.; Shapira, B.; and Rokach, L.2012. Predicting student exams scores by analyzing social network data. In AMT, 584595.
Jarvelin, K., and Kekalainen, J. 2002. Cumulated gain-based evaluation of ir techniques. ACM Trans. on Information Systems 20(4):422?446.
Korolova, A.; Motwani, R.; Nabar, S. U.; and Xu, Y. 2008.Link privacy in social networks. In Proceedings of the 17th ACM conference on Information and knowledge management, 289298. ACM.
Liben-Nowell, D., and Kleinberg, J. 2007. The linkprediction problem for social networks. Journal of the American society for information science and technology 58(7):10191031.
Mislove, A.; Marcon, M.; Gummadi, K. P.; Druschel, P.; and Bhattacharjee, B. 2007. Measurement and analysis of online social networks. In Proceedings of the 7th ACM SIGCOMM conference on Internet measurement, 2942. ACM.
Pawlas, P.; Domanski, A.; and Domanska, J. 2012. Universal web pages content parser. In Computer Networks, volume 291 of Communications in Computer and Information Science. Springer Berlin Heidelberg. 130138.
Stern, R.; Kalech, M.; and Felner, A. 2012. Finding patterns in an unknown graph. AI Commun. 25(3):229256.
Stern, R.; Puzis, R.; and Felner, A. 2011. Potential search: A bounded-cost search algorithm. In ICAPS.
Tang, J.; Yao, L.; Zhang, D.; and Zhang, J. 2010. A combination approach to web user profiling. ACM Trans. Knowl.Discov. Data 5(1):2:12:44.
Watts, D. J., and Strogatz, S. 1998. Collective dynamics of small-world networks. Nature 393(6684):440442.
-----0
Agichtein, E., and Gravano, L. 2000. Snowball: extracting relations from large plain-text collections. In Proceedings of the fifth ACM conference on Digital libraries, DL 00, 8594.
Auer, P. 2003. Using confidence bounds for exploitationexploration trade-offs. J. Mach. Learn. Res. 3:397422.
Blum, A. L., and Langley, P. 1997. Selection of relevant features and examples in machine learning. Artif. Intell. 97(1-2):245271.
Bollacker, K.; Evans, C.; Paritosh, P.; Sturge, T.; and Taylor, J.2008. Freebase: a collaboratively created graph database for structuring human knowledge. In SIGMOD 08, 12471250.
Califf, M. E., and Mooney, R. J. 2003. Bottom-up relational learning of pattern matching rules for information extraction. J. Mach.Learn. Res. 4:177210.
Carlson, A.; Betteridge, J.; Kisiel, B.; Settles, B.; Jr., E. R. H.; and Mitchell, T. M. 2010. Toward an architecture for never-ending language learning. In AAAI.
Cimiano, P., and Staab, S. 2004. Learning by googling. SIGKDD Explor. Newsl. 6(2):2433.
Cimiano, P., and Volker, J. 2005. Towards large-scale, opendomain and ontology-based named entity classification. In RANLP, 166172.
Cimiano, P.; Ladwig, G.; and Staab, S. 2005. Gimme the context: context-driven automatic semantic annotation with c-pankow. In WWW05, 332341. New York, NY, USA: ACM.
Ciravegna, F. 2001. Adaptive information extraction from text by rule induction and generalisation. In IJCAI01, 12511256. San Francisco, CA, USA: Morgan Kaufmann Publishers Inc.
Clemen, R. T. 1989. Combining forecasts: A review and annotated bibliography. International Journal of Forecasting 5(4):559583.
Dietterich, T. G. 1998. Machine-learning research: Four current directions. The AI Magazine 18(4):97136.
Downey, D.; Etzioni, O.; and Soderland, S. 2010. Analysis of a probabilistic model of redundancy in unsupervised information extraction. Artif. Intell. 174(11):726748.
Etzioni, O.; Cafarella, M.; Downey, D.; Kok, S.; Popescu, A.-M.; Shaked, T.; Soderland, S.; Weld, D. S.; and Yates, A. 2004. Webscale information extraction in knowitall: (preliminary results). In WWW 04, 100110. New York, NY, USA: ACM.
Etzioni, O.; Banko, M.; Soderland, S.; and Weld, D. S. 2008. Open information extraction from the web. Commun. ACM 51(12):68 74.
Etzioni, O.; Fader, A.; Christensen, J.; Soderland, S.; and Mausam.2011. Open information extraction: The second generation. In Walsh, T., ed., IJCAI, 310. IJCAI/AAAI.
Fader, A.; Soderland, S.; and Etzioni, O. 2011. Identifying relations for open information extraction. In Proceedings of the Conference on Empirical Methods in Natural Language Processing, 
EMNLP 11, 15351545. Stroudsburg, PA, USA: Association for Computational Linguistics.
Fang, Y., and Chang, K. C.-C. 2011. Searching patterns for relation extraction over the web: rediscovering the pattern-relation duality.In WSDM 11, 825834. New York, NY, USA: ACM.
Freedman, M.; Loper, E.; Boschee, E.; and Weischedel, R. 2010.Empirical studies in learning to read. In Proceedings of the NAACL HLT 2010, FAM-LbR 10, 6169.
Gittins, J. C., and Jones, D. M. 1974. A Dynamic Allocation Index for the Sequential Design of Experiments. In Gani, J., ed., Progress in Statistics. Amsterdam, NL: North-Holland. 241266.
Hoffmann, R.; Zhang, C.; and Weld, D. S. 2010. Learning 5000 relational extractors. In ACL 10, 286295. Stroudsburg, PA, USA: Association for Computational Linguistics.
Kollar, T.; Samadi, M.; and Veloso, M. 2012. Enabling robots to find and fetch objects by querying the web. In AAMAS 12, 1217 1218.
Magnini, B.; Negri, M.; Prevete, R.; and Tanev, H. 2002. Is it the right answer? exploiting web redundancy for answer validation. In ACL-40, 425432.
Mausam; Schmitz, M.; Soderland, S.; Bart, R.; and Etzioni, O.2012. Open language learning for information extraction. In EMNLP-CoNLL, 523534. ACL.
McDowell, L. K., and Cafarella, M. 2006. Ontology-driven information extraction with ontosyphon. In ISWC06, 428444. Berlin, Heidelberg: Springer-Verlag.
Mintz, M.; Bills, S.; Snow, R.; and Jurafsky, D. 2009. Distant supervision for relation extraction without labeled data. In ACL 09, 10031011.
Mladenic, D.; Brank, J.; Grobelnik, M.; and Milic-Frayling, N.2004. Feature selection using linear classifier weights: interaction with classification models. In Proceedings of the 27th annual international ACM SIGIR conference on Research and development in information retrieval, SIGIR 04, 234241. New York, NY, USA: ACM.
Nakov, P., and Hearst, M. 2005. Search engine statistics beyond the n-gram: application to noun compound bracketing. In CONLL 05, 1724. Stroudsburg, PA, USA: Association for Computational Linguistics.
Pantel, P., and Pennacchiotti, M. 2006. Espresso: leveraging generic patterns for automatically harvesting semantic relations. In ACL-44, 113120.
Poon, H.; Christensen, J.; Domingos, P.; Etzioni, O.; Hoffmann, R.; Kiddon, C.; Lin, T.; Ling, X.; Mausam; Ritter, A.; Schoenmackers, S.; Soderland, S.; Weld, D.; Wu, F.; and Zhang, C. 2010.Machine reading at the university of washington. In Proceedings of the NAACL HLT 2010, FAM-LbR 10, 8795.
Samadi, M.; Kollar, T.; and Veloso, M. M. 2012. Using the web to interactively learn to find objects. In Hoffmann, J., and Selman, B., eds., AAAI. AAAI Press.
Sekine, S. 2006. On-demand information extraction. In COLINGACL 06, 731738.
Shinyama, Y., and Sekine, S. 2006. Preemptive information extraction using unrestricted relation discovery. In HLT-NAACL 06, 304311.
Soderl, S.; Etzioni, O.; Shaked, T.; and Weld, D. S. July 2004. The use of web-based statistics to validate information extraction. In AAAI Workshop on Adaptive Text Extraction and Mining.
Sutton, R. S. 1990. Integrated architectures for learning, planning, and reacting based on approximating dynamic programming. In ICML, 216224. Morgan Kaufmann.
Turney, P. 2001. Mining the web for synonyms: Pmi-ir versus lsa on toefl.
Uyar, A. 2009. Investigation of the accuracy of search engine hit counts. J. Inf. Sci. 35:469480.
Zhang, Z. 2004. Weakly-supervised relation classification for information extraction. In Proceedings of the thirteenth ACM international conference on Information and knowledge management, CIKM 04, 581588. New York, NY, USA: ACM.
-----0
Auer, S.; Bizer, C.; Lehmann, J.; Kobilarov, G.; Cyganiak, R.; and Ives, Z. 2007. DBpedia: a nucleus for a web of open data. In Proc. ISWC 2007 + ASWC 2007, Lecture Notes in Computer Science 4825. Springer.
Barsalou, L. W. 1983. Ad hoc categories. Memory & Cognition 11(3):211227.
Bizer, C.; Heath, T.; and Berners-Lee, T. 2009. Linked data the story so far. Int. J. Semantic Web Inf. Syst. 5(3):122.
Bohm, C.; de Melo, G.; Naumann, F.; and Weikum, G. 2012.LINDA: Distributed web-of-data-scale entity matching. In Proceedings of the 21st ACM Conference on Information and Knowledge Management (CIKM 2012). New York, NY, USA: ACM.
Chawla, S.; Krauthgamer, R.; Kumar, R.; Rabani, Y.; and Sivakumar, D. 2005. On the hardness of approximating multicut and sparsest-cut. In Proc. 20th IEEE Conference on Computational Complexity (CCC), 144153.
Cudre-Mauroux, P.; Haghani, P.; Jost, M.; Aberer, K.; and De Meer, H. 2009. idMesh: graph-based disambiguation of Linked Data. In Proceedings of the 18th international conference on World wide web, WWW 09, 591600. New York, NY, USA: ACM.de Melo, G., and Weikum, G. 2008. Language as a foundation of the Semantic Web. In Proc. ISWC 2008, volume 401 of CEUR WS. Karlsruhe, Germany: CEUR.de Melo, G., and Weikum, G. 2010a. MENTA: Inducing multilingual taxonomies from Wikipedia. In Proc. CIKM 
2010, 10991108. New York, NY, USA: ACM.de Melo, G., and Weikum, G. 2010b. Untangling the crosslingual link structure of Wikipedia. In Proc. ACL 2010.
Ding, L.; Shinavier, J.; Finin, T.; and McGuinness, D. L.2010a. owl:sameAs and Linked Data: An empirical study.In Proc. 2nd Web Science Conference.
Ding, L.; Shinavier, J.; Shangguan, Z.; and McGuinness, D. L. 2010b. SameAs networks and beyond: analyzing deployment status and implications of owl:sameAs in Linked Data. In Proc. ISWC 2010, 145160. Berlin, Heidelberg: Springer-Verlag.
Edmonds, J., and Karp, R. M. 1972. Theoretical improvements in algorithmic efficiency for network flow problems.J. ACM 19(2):248264.
Euzenat, J., and Shvaiko, P. 2007. Ontology matching.Springer-Verlag.
Euzenat, J.; Ferrara, A.; van Hage, W. R.; Hollink, L.; Meilicke, C.; Nikolov, A.; Ritze, D.; Scharffe, F.; Shvaiko, P.; 
Stuckenschmidt, H.; Svab-Zamazal, O.; and dos Santos, C. T. 2011. Final results of the Ontology Alignment Evaluation Initiative 2011. In OM, volume 814 of CEUR Workshop Proceedings. CEUR-WS.org.
Garg, N.; Vazirani, V. V.; and Yannakakis, M. 1996. Approximate max-flow min-(multi)cut theorems and their applications. SIAM Journal on Computing (SICOMP) 25:698707.
Goodman, N. 1972. Seven strictures on similarity. Problems and projects 437447.
Halpin, H.; Hayes, P. J.; McCusker, J. P.; McGuinness, D. L.; and Thompson, H. S. 2010. When owl: sameAs isnt the same: An analysis of identity in Linked Data. In International Semantic Web Conference (1), 305320.
Halpin, H.; Hayes, P. J.; and Thompson, H. S. 2011. When owl:sameAs isnt the same redux: A preliminary theory of identity and inference on the Semantic Web. In LDH, 25 30.
Hogan, A.; Zimmermann, A.; Umbrich, J.; Polleres, A.; and Decker, S. 2012. Scalable and distributed methods for entity matching, consolidation and disambiguation over linked data corpora. Web Semant. 10:76110.
Manola, F., and Miller, E., eds. 2004. RDF Primer. W3C Recommendation. World Wide Web Consortium.
Munkres, J. 1957. Algorithms for the assignment and transportation problems. J. SIAM 5:3238.
Shepp, B. E., and Swartz, K. B. 1976. Selective attention and the processing of integral and non-integral dimensions: A developmental study. Journal of Experimental Child Psychology 22(1):7385.
Suzuki, H.; Ohnishi, H.; and Shigemasu, K. 1992. Goaldirected processes in similarity judgement. In Proc. 14th Annual Conference of the Cognitive Science Society, 343 348.
Tversky, A., and Gati, I. 1978. Cognition and Categorization. New York: Wiley. chapter Studies of similarity, 7998.
Tversky, A. 1977. Features of similarity. Psychological Review 84:327352.
-----0
Anderson, J. R.; Bothell, D.; Byrne, M. D.; Douglass, S.; Lebiere, C.; and Qin, Y. 2004. An integrated theory of the mind. Psychological Review 111(4).
Blythe, J.; Botello, A.; Sutton, J.; Mazzocco, D.; Lin, J.; Spraragen, M.; and Zyda, M. 2011. Testing cyber security with simulated humans. In Proceedings of IAAI. AAAI Press.
Boddy, M.; Gohde, J.; Haigh, T.; and Harp, S. 2005. Course of action generation for cyber security using classical planning. In Proceedings of ICAPS. AAAI Press.
Bresina, J.; Dearden, R.; Meuleau, N.; Smith, D.; and Washington, R. 2002. Planning under continuous time and resource uncertainty: A challenge for AI. In Proceedings of the Eighteenth Conference on Uncertainty in Artificial Intelligence. Morgan Kaufmann Publishers Inc.
Domingos, P., and Lowd, D. 2009. Markov logic: An interface layer for artificial intelligence. Synthesis Lectures on Artificial Intelligence and Machine Learning 3(1):1155.
Doorenbos, R. B.; Etzioni, O.; and Weld, D. S. 1997.A scalable comparison-shopping agent for the world-wide web. Proceedings of the first international conference on autonomous agents.
Forgy, C. L. 1982. Rete: a fast algorithm for the many pattern/many object pattern match problem. Artificial intelligence 19(1):1737.
Fu, W.-T., and Anderson, J. R. 2006. From recurrent choice to skill learning: A reinforcement-learning model. Journal of Experimental Psychology: General 135(2).
Gibson, J. J. 1977. The theory of affordances. In Shaw, R., and Bransford, J., eds., Perceiving, Acting, and Knowing: Toward an Ecological Psychology. Lawrence Erlbaum.
Gold, K.; Weber, Z. J.; Priest, B.; Ziegler, J.; Sittig, K.; and Streilein, B. 2013. Modeling how thinking about the past and future impacts network traffic with the gosmr architecture. In Proceedings of AAMAS. International Foundation for Autonomous Agents and Multiagent Systems.
Grosz, B. 2012. What question would Turing pose today? AI Magazine 33(4).
Jappinen, H. 1981. Sense-controlled flexible robot behavior. International Journal of Computer and Information Sciences 10(2).
Jones, R. M.; Laird, J. E.; Nielsen, P. E.; Coulter, K. J.; Kenny, P.; and Koss, F. V. 1999. Automated intelligent pilots for combat flight simulation. AI Magazine 20(1).
Kahneman, D. 2011. Thinking Fast and Slow. Farrar, Straus, and Giroux.
Pereira, F. C., and Shieber, S. M. 1987. Prolog and Natural Language Analysis. Brookline,MA: Microtome Publishing.
Peterson, J. L. 1981. Petri Net Theory and the Modeling of Systems. Upper Saddle River, NJ: Prentice Hall.
Reber, A. S. 1985. The Penguin dictionary of psychology.London: Penguin Books.
Rosenblatt, J. 1997. DAMN: a distributed architecture for navigation. Journal of Experimental and Theoretical Artificial Intelligence 9(2-3).
Rossey, L. M.; Cunningham, R. K.; Fried, D. J.; Rabek, J. C.; Lippmann, R. P.; Haines, J. W.; and Zissman, M. A. 2002.LARIAT: Lincoln adaptable real-time information assurance testbed. In Aerospace Conference Proceedings. IEEE.
Russell, S., and Norvig, P. 2003. Artificial Intelligence: A Modern Approach. Upper Saddle River, New Jersey: Prentice Hall, 2nd edition.
Russell, S., and Norvig, P. 2011. Artificial Intelligence: A Modern Approach. Upper Saddle River, New Jersey: Prentice Hall, 3rd edition.
Shadbolt, N.; Hall, W.; and Berners-Lee, T. 2006. The semantic web revisited. IEEE Intelligent Systems 21(3).
Sutton, R., and Barto, A. 1998. Reinforcement Learning: an Introduction. Cambridge, MA: MIT Press.
Turing, A. 1950. Computing machinery and intelligence.Mind 49.
Tuyls, K., and Weiss, G. 2012. Multiagent learning: Basics, challenges, prospects. AI Magazine 33(3).
-----0
Altmann, E. M., and Trafton, J. G. 2002. Memory for goals: An activation-based model. Cognitive Science 26(1):3983.
Anderson, J. R., and Douglass, S. 2001. Tower of hanoi: Evidence for the cost of goal retrieval. Journal of Experimental Psychology: Learning, Memory, and Cognition 27(6):1331 1346.
Anderson, J. R. 1990. The Adaptive Character of Thought.Psychology Press.
Anderson, J. R. 2007. How Can the Human Mind Occur in the Physical Universe? New York, NY: Oxford University Press.
Cassimatis, N. L.; Bignoli, P. G.; Bugajska, M. D.; Dugas, S.; Kurup, U.; Murugesan, A.; and Bello, P. 2010. An architecture for adaptive algorithmic hybrids. Systems, Man, and Cybernetics, Part B: Cybernetics, IEEE Transactions on 40(3):903914.
Derbinsky, N., and Laird, J. E. 2012. Competence-preserving retention of learned knowledge in Soars working and procedural memories. In Proceedings of the 11th International Conference on Cognitive Modeling (ICCM).
Elio, R. 2006. On modeling intentions for prospective memory performance. In Proceedings of the 28th Annual Conference of the Cognitive Science Society (CogSci), 12691274.
Ellis, J. 1996. Prospective memory or the realization of delayed intentions: A conceptual framework for research. In Brandimonte, M.; Einstein, G. O.; and McDaniel, M. A., eds., Prospective Memory: Theory and Applications. Mahwah, New Jersey: Lawrence Erlbaum.
Forgy, C. L. 1979. On the Efficient Implementation of Production Systems. Ph.D. Dissertation, Carnegie Mellon University, Pittsburgh, PA.
Gobet, F., and Lane, P. 2010. The CHREST architecture of cognition the role of perception in general intelligence.In Proceedings of the 3rd Conference on Artificial General Intelligence (AGI).
Harris, J. E. 1984. Remembering to do things: A forgotten topic. In Harris, J. E., and Morris, P. E., eds., Everyday Memory, Actions and Absent-mindedness. Academic Press.7192.
Laird, J. E. 2012. The Soar Cognitive Architecture. Cambridge, MA: MIT Press.
Lebiere, C., and Lee, F. J. 2002. Intention superiority effect: A context-switching account. Cognitive Systems Research 3(1):5765.
Li, J.; Derbinsky, N.; and Laird, J. E. 2012. Functional interactions between memory and recognition judgments.In Proceedings of the 26th AAAI Conference on Artificial Intelligence (AAAI), 228234.
McDaniel, M. A., and Einstein, G. O. 2000. Strategic and automatic processes in prospective memory retrieval: A multiprocess framework. Applied Cognitive Psychology 14(7):S127S144.
Minton, S. 1995. Quantitative results concerning the utility of explanation-based learning. In Ram, A., and Leake, D. B., eds., Goal-Driven Learning. MIT Press.
Schooler, L. J., and Hertwig, R. 2005. How forgetting aids heuristic inference. Psychological Review 112(3):610628.
Sellen, A. J.; Louie, G.; Harris, J. E.; and Wilkins, A. J.1997. What brings intentions to mind? An in situ study of prospective memory. Memory 5:483507.
Simina, M. D., and Kolodner, J. L. 1995. Opportunistic reasoning: A design perspective. In Proceedings of the 17th Annual Conference of the Cognitive Science Society (CogSci), 7883.
Snaider, J.; McCall, R.; and Franklin, S. 2011. The LIDA framework as a general tool for AGI. In Proceedings of the 4th Conference on Artificial General Intelligence (AGI).
Sun, R. 2006. The CLARION cognitive architecture: Extending cognitive modeling to social simulation. In Sun, R., ed., Cognition and Multi-Agent Interaction: From Cognitive Modeling to Social Simulation. Cambridge University Press.
-----0
Allwood, J.; Traum, D.; and Jokinen, K. 2000. Cooperation, dialogue and ethics. International Journal of HumanComputer Studies 53(6):871914.
Blum, A. L., and Furst, M. L. 1995. Fast planning through planning graph analysis. ARTIFICIAL INTELLIGENCE 90(1):16361642.
Briggs, G., and Scheutz, M. 2011. Facilitating mental modeling in collaborative human-robot interaction through adverbial cues. In Proceedings of the SIGDIAL 2011 Conference, 239247. Portland, Oregon: Association for Computational Linguistics.
Grice, P. 1975. Logic and conversation. In Cole, P., and Morgan, J., eds., Syntax and Semnatics, 3: Speech Acts.
Gupta, S.; Walker, M. A.; and Romano, D. M. 2007. How rude are you?: Evaluating politeness and affect in interaction. In Affective Computing and Intelligent Interaction.Springer. 203217.
Hassell, L.; Beecham, S.; and Christensen, M. 1996. Indirect speech acts and their use in three channels of communication. In In Proceedings of the First International Workshop on Communication Modeling The Language/Action Perspective.
Kelley, R.; Tavakkoli, A.; King, C.; Nicolescu, M.; Nicolescu, M.; and Bebis, G. 2008. Understanding human intentions via hidden markov models in autonomous mobile robots. In Proceedings of the 3rd ACM/IEEE international conference on Human robot interaction, HRI 08, 367374.
Kelley, R.; Wigand, L.; Hamilton, B.; Browne, K.; Nicolescu, M.; and Nicolescu, M. 2012. Deep networks for predicting human intent with respect to objects. In Proceedings of the seventh annual ACM/IEEE international conference on Human-Robot Interaction, HRI 12, 171172. New York, NY, USA: ACM.
Locher, M., and Watts, R. 2005. Politeness theory and relational work. Journal of Politeness Research. Language, Behaviour, Culture 1(1):933.
Nass, C.; Steuer, J.; and Tauber, E. 1994. Computers are social actors. In Proceedings of the SIGCHI conference on Human factors in computing systems: celebrating interdependence, 7278. ACM.
Perrault, C. R., and Allen, J. F. 1980. A plan-based analysis of indirect speech acts. Comput. Linguist. 6(3-4):167182.
Scheutz, M.; Schermerhorn, P.; Kramer, J.; and Anderson, D. 2007. First steps toward natural human-like HRI. Autonomous Robots 22(4):411423.
Searle, J. 1975. Indirect speech acts. In Cole, P., and Morgan, J., eds., Syntax and Semnatics, 3: Speech Acts.
Wilske, S., and Kruijff, G.-J. M. 2006. Service robots dealing with indirect speech acts. In IROS06, 46984703.
-----0
Amir, E. and McIlraith, S. 2005. Partition-Based Logical  Reasoning for First-Order and Propositional Theories, Artificial  Intelligence, 162(1-2), pages 49-98.
Clauset, A., Shalizi, C. R. and Newman, M. 2009 Power-law Distributions in Empirical Data, SIAM Review, 51, pp. 661-703.
Cohen, P. Schrag, R., Jones, E., Pease, et al. 1998. The DARPA  High-Performance Knowledge Bases Project. AI Magazine,  19(4), Winter, pp. 25-49.
Etzioni, O.,  Cafarella, M.,  Downey, D., Popescu, A., Shaked, T., Soderland, S., Weld, D., and Yates, A. 2005. Unsupervised  Named-Entity Extraction from the Web: An Experimental Study. Artificial Intelligence, 165(1): pp.  91-134.
Forbus, K. D.,  Riesbeck, C., Birnbaum, L., Livingston, K., Sharma, A. Ureel II, L. 2007. Integrating Natural Language, Knowledge Representation and Reasoning, and Analogical  Processing to Learn by Reading. Proceedings of AAAI, pp. 1542154
Gomes, C., Fernandez, C., Selman, B.  and Bessiere, C. 2004.  Statistical Regimes Across Constrainedness Regions,  Proceedings of CP, pp. 32-46.
Jeong, H., Mason, S. P., Barabasi, A. L. and Oltavi, Z. N. 2001. Lethality and Centrality in Protein Networks, Nature,  Vol. 411,  pp.  41-42.
Kilby, P., Slaney, J., Thiebaux, S. and Walsh, T. 2005.  Backbones and Backdoors in Satisfiability, Proceedings of AAAI,  pp.  1368-1373.
Kleinberg, J. 2000. Navigation in a small world. Nature, 406,  page 845.
Martin, C. E. and Riesbeck, C. K. 1986. Uniform Parsing and  Inferencing for Learning. Proceedings of AAAI, pp. 257-261.
Mitchell, D., Selman, B. and Levesque, H. 1992. Hard and easy  distributions of SAT problems, Proceedings of AAAI, pp. 459465.
Mitchell, M. 2006.  Complex systems: Network thinking,  Artificial Intelligence, 170(1-2), pp. 1194-1212.
Selman, B. and Kautz, H. 1996. Knowledge Compilation and  Theory Approximation, Journal of ACM, pages 193-224.
Sutcliffe, S. 2009. The TPTP Problem Library and Associated  Infrastructure: The FOF and CNF Parts, v3.5.0, Journal of  Automated Reasoning, 43(4), pp. 337-362.
Walsh, T. 1999. Search in a small world. Proceedings of IJCAI,  pp. 1172-1177.
Walsh, T. 2003. Constraint Patterns, Proceedings of CP, pp. 5364.              
-----0
Belduccinni, M. Baral, C. and Lierler, Y. 2008. Knowledge  Representation and Question Answering. In Vladimir Lifschitz  and Frank van Harmelen and Bruce Porter, ed In Handbook of  Knowledge Representation.          
Brill, E., Dumais, S. and Banko, M. 2002. An analysis of the  AskMSR question-answering system. Proceedings of ACL, pages  257-264.
Clark, P., Thompson, J. and Porter, B. 2000 Knowledge Patterns.  Proceedings of KR, page 591-600.   
Collins, A. 1978. Human Plausible Reasoning. BBN Report No.  3810.
Dzeroski, S., de Raedt, L. and Driessens, K. 2001 Relational  Reinforcement Learning. Machine Learning, 43, pp. 7-52  
Faloutsos, C.,  McCurley, K. S. and Tomkins, A. 2004 Fast  Discovery of Connection Subgraphs. Proceedings of KDD, pages  118-127.  
Ferrucci, F. and Nyberg, E.  et al 2009 Towards the Open  Advancement of Question Answering Systems. IBM Research  Report. RC24789 (W0904-093), IBM Research,  New York.
Forbus, K. D. and de Kleer, J. 1993 Building Problem Solvers.   MIT Press  
Forbus, K. D., Riesbeck, C., Birnbaum, L., Livingston, K.,  Sharma A., and Ureel, L. (2007). Integrating Natural Language,  Knowledge Representation and Reasoning, and Analogical  Processing to Learn by Reading. Proceedings of AAAI, pages  1542-1547  
Khardon, R. 1999 Learning Function-Free Horn Expressions.  Machine Learning, 37, pp. 241-275.   
Kaelbling, L. P., Littman, M. and Moore, A. 1996. Reinforcement  Learning: A Survey. Journal of AI Research, 4, pp. 237-285.  
Matuszek, C., Witbrock, M., Kahlert, R., Cabral, J., Schneider,  D., Shaw, P., and Lenat, D. 2005. Searching for common sense:  Populating Cyc from the web.  Proceedings of AAAI, pages 14301435.  
Matuszek, C., Cabral, J., Witbrock, M. and De Olivieira, J. 2006.  An Introduction to the Syntax and Content of Cyc. AAAI Spring  Symposium, pages 44-49.  
Miikkulainen, R. 1990. Script Recognition with Hierarchical  Feature Maps. Connection Science, pages 83-101  Molla, D. 2006 Learning of Graph-based Question Answering  Rules. Proceedings of HLT/NAACL Workshop on Graph  Algorithms for Natural Language Processing. pages 37-44.
Molla, D. and Vicedo, J. L. 2007. Question Answering in  Restricted Domains: An Overview. Computational Linguistics, 33  (1), pp. 41-61  
Moore, D. and I. Essa. 2002. Recognizing Multitasked Activities  from Video Using Stochastic Context-Free Grammar,  Proceedings of AAAI, pages 770-776.  
Navigli, R. 2008. A Structural Approach to the Automatic  Adjudication of Word-Sense Disagreements. Natural Language  Engineering. Vol. 14, 4, pp. 547-573  
Prager, J., Chu-Carroll, J. and Czuba, K. 2004. Question  Answering Using Constraint Satisfaction: QA-by-Dossier-withConstraints. Proceedings of ACL, pages 60-65.  
Ramakrishnan, S., Milnor, W. H., Perry, M. and Sheth, A. 2005.  Discovering Informative Connection Subgraphs in Mutirelational Graphs. ACM SIGKDD Explorations Newsletter, 7(2),  pp. 56-63.
Richards, B. and Mooney, R. 1992. Learning Relations by  Pathfinding. Proceedings of AAAI, pages 50-55.  
Taylor, M., Matuszek, C., Smith, P. and Witbrock, M. 2007.  Guiding Inference with Policy Search Reinforcement Learning.  Proceedings of FLAIRS, pages 146-151.          
-----0
Andrighetto, G., and Villatoro, D. 2011. Beyond the carrot and stick approach to enforcement: An agent-based model.
European Perspectives on Cognitive Science.Arnold, M. 1960. Emotion and personality. vol. i. psychological aspects.
Bates, J. 1992. The nature of characters in interactive worlds and the oz project. School of Computer Science, Carnegie Mellon University, Pittsburgh, PA Technical Report CMUCS-92-200.
Becker-Asano, C., and Wachsmuth, I. 2010. Affective computing with primary and secondary emotions in a virtual human. Autonomous Agents and Multi-Agent Systems 20(1):3249.
Becker-Asano, C. 2008. WASABI: Affect Simulation for Agents with Believable Interactivity. Ph.D. Dissertation, PhD Thesis, Faculty of Technology, University of Bielefeld.IOS Press (DISKI 319).
Broersen, J.; Dastani, M.; Hulstijn, J.; and van der Torre, L.2002. Goal generation in the boid architecture. Cognitive Science Quarterly 2(3-4):428447.
Bulitko, V.; Solomon, S.; Gratch, J.; and van Lent, M. 2008.Modeling culturally and emotionally affected behavior. In Artificial Intelligence and Interactive Digital Entertainment Conference.
Castelfranchi, C.; Dignum, F.; Jonker, C.; and Treur, J.2000. Deliberative normative agents: Principles and architecture. Intelligent Agents VI. Agent Theories, Architectures, and Languages 364378.
Dias, J., and Paiva, A. 2005. Feeling and reasoning: A computational model for emotional characters. Progress in artificial intelligence 127140.
Dignum, F. 1999. Autonomous agents with norms. Artificial Intelligence and Law 7(1):6979.
Elliott, C. 1992. The affective reasoner: A process model of emotions in a multi-agent system. Ph D Thesis Northwestern University (1992).
Ferreira, N.; Mascarenhas, S.; Paiva, A.; Dignum, F.; Mc Breen, J.; Degens, N.; and Hofstede, G. 2012. Generating norm-related emotions in virtual agents. In Intelligent Virtual Agents, 97104. Springer.
Gebhard, P. 2005. Alma, a layered model of affect. In Proceedings of International Joint Conference on Autonomous Agents and Multiagent Systems AAMAS05. Utrecht, Netherlands: ACM Press.
Gratch, J.; Mao, W.; and Marsella, S. 2006. Modeling social emotions and social attributions. Cambridge University Press.
Gratch, J. 2000. Emile: Marshalling passions in training and education. In Proceedings of the fourth international conference on Autonomous agents, 325332. ACM.
Lopez, F.; Luck, M.; and dInverno, M. 2006. A normative framework for agent-based systems. Computational & Mathematical Organization Theory 12(2):227250.
Marsella, S.; Johnson, W.; and LaBore, C. 2000. Interactive pedagogical drama. In Proceedings of the fourth international conference on Autonomous agents, 301308. ACM.
Meneguzzi, F., and Luck, M. 2009. Norm-based behaviour modification in bdi agents. In Proceedings of The 8th International Conference on Autonomous Agents and Multiagent Systems-Volume 1, 177184. International Foundation for Autonomous Agents and Multiagent Systems.
Mukherjee, P.; Sen, S.; and Airiau, S. 2007. Emergence of norms with biased interactions in heterogeneous agent societies. In Proceedings of the 2007 IEEE/WIC/ACM International Conferences on Web Intelligence and Intelligent Agent Technology-Workshops, 512515. IEEE Computer Society.
Oren, N.; Panagiotidi, S.; Vazquez-Salceda, J.; Modgil, S.; Luck, M.; and Miles, S. 2009. Towards a formalisation of electronic contracting environments. Coordination, Organizations, Institutions and Norms in Agent Systems IV 156 171.
Ortony, A.; Clore, G. L.; and Collins, A. 1988. The Cognitive Structure of Emotions. Cambridge University Press.
Rank, S. 2004. Affective Acting: An Appraisal-based Architecture for Agents as Actors. Ph.D. Dissertation, Institut fur Medizinische Kybernetik und Artificial Intelligence, Universitat Wien, Vienna, Austria.
Reilly, W. S. N. 1996. Believable Social and Emotional Agents. Ph.D. Dissertation, Citeseer.
Scherer, K. 1984. On the nature and function of emotion: A component process approach.
Si, M.; Marsella, S.; and Pynadath, D. V. 2006. Thespian: Modeling socially normative behavior in a decisiontheoretic framework. In IVA, 369382.
Si, M.; Marsella, S.; and Pynadath, D. 2010. Modeling appraisal in theory of mind reasoning. Autonomous Agents and Multi-Agent Systems 20(1):1431.
Sloman, A., et al. 2001. Beyond shallow models of emotion.Cognitive Processing: International Quarterly of Cognitive Science 2(1):177198.
Solomon, S.; Van Lent, M.; Core, M.; Carpenter, P.; and Rosenberg, M. 2008. A language for modeling cultural norms, biases and stereotypes for human behavior models.Technical report, DTIC Document.
Staller, A., and Petta, P. 1998. Towards a tractable appraisalbased architecture for situated cognizers. C. Numaoka, D.
Canamero, & P. Petta, Grounding emotions in adaptive systems. SAB 98.
Villatoro, D.; Andrighetto, G.; Sabater-Mir, J.; and Conte, R. 2011. Dynamic Sanctioning for Robust and Cost-Efficient Norm Compliance.
Villatoro, D.; Sabater-Mir, J.; and Sen, S. 2011. Social instruments for robust convention emergence. In Proceedings of the Twenty-Second international joint conference on Artificial Intelligence-Volume Volume One, 420425. AAAI Press.
-----0
Allen, J.; Swift, M.; and de Beaumont, W. 2008. Deep Semantic Analysis of Text. In Symposium on Semantics in Systems for Text Processing (STEP), volume 2008, 343354. Morristown, NJ, USA: Association for Computational Linguistics.
Brown, T., and Koplowitz, J. 1979. The Weighted Nearest Neighbor Rule for Class Dependent Sample Sizes. IEEE Transactions on Information Theory I(5):617619.
Dalal, N., and Triggs, B. 2005. Histograms of oriented gradients for human detection. Computer Vision and Pattern Recognition.
Farhadi, A.; Endres, I.; Hoiem, D.; and Forsyth, D. 2009.Describing Objects by Their Attributes. 2009 IEEE Conference on Computer Vision and Pattern Recognition 1778 1785.
Fei-Fei, L.; Fergus, R.; and Perona, P. 2006. One-shot learning of object categories. IEEE transactions on pattern analysis and machine intelligence 28(4):594611.
Harnad, S. 1990. The Symbol Grounding Problem. Physica D: Nonlinear Phenomena.
Hu, M.-K. 1962. Visual pattern recognition by moment invariants. Information Theory, IRE Transactions on 8(2):179 187.
Jaswal, V. K., and Hansen, M. B. 2006. Learning Words: Children Disregard Some Pragmatic Information That Conflicts with Mutual Exclusivity. Developmental science 9(2):15865.
Khotanzad, A., and Hong, Y. 1990. Invariant Image Recognition by Zernike Moments. IEEE Transactions on Pattern Analysis and Machine Intelligence 12(5):489497.
Landau, B.; Smith, L.; and Jones, S. 1998. Object Shape, Object Function, and Object Name. Journal of Memory and Language 38(1):127.
Lowe, D. G. 1999. Object recognition from local scaleinvariant features. Proceedings of the Seventh IEEE International Conference on Computer Vision 2([8):11501157 vol.2.
Mahalanobis, P. 1936. On The Generalized Distance in Statistics. Proceedings of the National Institute of Sciences of India 4955.
Matuszek, C.; FitzGerald, N.; Zettlemoyer, L.; Bo, L.; and Fox, D. 2012. A Joint Model of Language and Perception for Grounded Attribute Learning. In Proceedings of the International Conference on Machine Learning (ICML).
Pangburn, B.; Mathews, R.; and Iyengar, S. 2003. EBLA: A Perceptually Grounded Model of Language Acquisition. In Proceedings of the HLT-NAACL 2003 Workshop on Learning Word Meaning from Non-Linguistic Data, 4653.
Roy, D., and Pentland, A. 2002. Learning words from sights and sounds: A computational model. Cognitive science 26(1):113146.
Yu, C., and Ballard, D. 2004. On the Integration of Grounding Language and Learning Objects. In Proceedings of the National Conference on Artificial Intelligence, number 
Quine, 488494. Menlo Park, CA; Cambridge, MA; London; AAAI Press; MIT Press; 1999.
-----0
Chalkiadakis, G., and Boutillier, C. 2003. Coordination in multiagent reinforcement learning: A bayesian approach. In Proc. of AAMAS03.
Chen, X.; Deng, X.; and Teng, S.-H. 2009. Settling the complexity of computing two-player nash equilibria. Journal of the ACM 56(3).
Daskalakis, C.; Goldberg, P.; and Papadimitriou, C. 2009.The complexity of computing a nash equilibrium. SIAM Journal on Computing 39(3):195259.
Filar, J., and Vrieze, K. 1996. Competitive Markov Decision Processes. Springer.
Hethcote, H. W. 2000. The mathematics of infectious diseases. SIAM review 42:599653.
Hu, J., and Wellman, M. P. 2003. Nash q-learning for general-sum stochastic games. Journal of MachineLearning Research 4:10391069.
Lemke, C., and Howsion, J. T. 1964. Equilibrium points of bimatrix games. J. Soc. Ind. Appl. Math. 12(2):413423.
Lipton, R.; Markakis, E.; and Mehta, A. 2004. Playing large games using simple strategies. In Proceedings of the 4th ACM conference on Electronic Commerce, 3641.
Mangasarian, O., and Stone, H. 1964. Two-person non-zero sum games and quadratic programming. Journal of Mathematical Analysis and applications 9:348355.
Nodelijk, G. 2002. Porcine reproductive and respiratory syndrome (prrs) with special reference to clinical aspects and diagnosis: A review. Veterinary Quarterly 24:95100.
Plambeck, E. L., and Zenios, S. A. 2000. Performance-based incentives in a dynamic principal-agent model. Manufacturing and Service Operations Management 2(3):240263.
Sabbadin, R.; Peyrard, N.; and Forsell, N. 2012. A framework and a mean-field algorithm for the local control of spatial processes. International Journal of Approximate Reasoning 53(1):6686.
Tharakunnel, K., and Bhattacharyya, S. 2007. Leaderfollower semi-markov decision problems: theoretical framework and approximate solution. In IEEE international conference on Approximate Dynamic Programming and Reinforcement Learning (ADPRL), 111118.
Tharakunnel, K., and Bhattacharyya, S. 2009. Single-leadermultiple-follower games with boundedly rational agents.Journal of Economic Dynamics and Control 33:15931603.
-----0
Albadi, M. H., and El-Saadany, E. F. 2008. A summary of demand response in electricity markets. Electric Power Systems Research 78(11):1989  1996.
Asmus, P. 2010. Microgrids, virtual power plants and our distributed energy future. The Electricity Journal 23(10):72  82.
Bushnell, J.; Hobbs, B. F.; and Wolak, F. A. 2009. When it comes to demand response, is ferc its own worst enemy? The Electricity Journal 22(8):918.
Davito, B.; Tai, H.; and Uhlaner, R. 2010. The smart grid and the promise of demand-side management. McKinsey.
Fang, X.; Misra, S.; Xue, G.; and Yang, D. 2011. Smart grid the new and improved power grid: A survey. Communications Surveys Tutorials, IEEE PP(99):1 37.
Gneiting, T., and Raftery, A. E. 2007. Strictly proper scoring rules, prediction, and estimation. Journal of the American Statistical Association 102(477):359378.
Ibars, C.; Navarro, M.; and Giupponi, L. 2010. Distributed demand management in smart grid with a congestion game.In SmartGridComm 2010, 495 500.
Kota, R.; Chalkiadakis, G.; Robu, V.; Rogers, A.; and Jennings, N. R. 2012. Cooperatives for demand side management. In Proceedings of the 20th European Conference on Artificial Intelligence (ECAI-2012), 969974.
Li, C.; Rajan, U.; Chawla, S.; and Sycara, K. 2003. Mechanisms for coalition formation and cost sharing in an electronic marketplace. In ICEC 03, 6877. New York, NY, USA: ACM.
MIT authors. 2011. Engaging electricity demand. In MIT Interdisciplinary Study on the future of the electric grid. MIT.
Mohsenian-Rad, H., and Leon-Garcia, A. 2010. Optimal residential load control with price prediction in real-time electricity pricing environments. Smart Grid, IEEE Transactions on 1(2):120 133.
Mohsenian-Rad, H.; Wong, V.; Jatskevich, J.; Schober, R.; and Leon-Garcia, A. 2010. Autonomous demand-side management based on game-theoretic energy consumption scheduling for the future smart grid. Smart Grid, IEEE Transactions on 1(3):320 331.
Ramchurn, S.; Vytelingum, P.; Rogers, A.; and Jennings, N. R. 2012. Putting the smarts into the smart grid: A grand challenge for artificial intelligence. Communications of the ACM.
Robu, V.; Kota, R.; Chalkiadakis, G.; Rogers, A.; and Jennings, N. R. 2012. Cooperative virtual power plant formation using scoring rules. In Proceedings of the 26th Conference on Artificial Intelligence (AAAI-12), 370376.
Sastry, C. R.; Srivastava, V.; Pratt, R.; and Li, S. 2010. Use of residential smart appliances for peak-load shifting and spinning reserves cost/benefit analysis. U.S. Department of Energy.
van Dam, S. S.; Bakker, C. A.; and van Hal, J. D. M.2010. Home energy monitors: impact over the mediumterm. Building Research & Information 38(5):458469.
Yamamoto, J., and Sycara, K. 2001. A stable and efficient buyer coalition formation scheme for e-marketplaces. In Proceedings of the 5th International Conference on Autonomous Agents (AGENTS 01), 576583. New York, NY, USA: ACM.
-----0
Artmeier, A.; Haselmayr, J.; Leucker, M.; and Sachenbacher, M. 2010. The shortest path problem revisited: Optimal routing for electric vehicles. In KI, 309316.
Breslau, L.; Diakonikolas, I.; Duffield, N. G.; Gu, Y.; Hajiaghayi, M. T.; Johnson, D. S.; Karloff, H. J.; Resende, M. G. C.; and Sen, S. 2011. Disjoint-path facility location: Theory and practice. In ALENEX, 6074. SIAM.
Eisner, J.; Funke, S.; and Storandt, S. 2011. Optimal route planning for electric vehicles in large networks. In AAAI.
Feige, U. 1998. A threshold of ln n for approximating set cover. J. ACM 45(4):634652.
Hassin, R., and Segev, D. 2005. The set cover with pairs problem. In Sarukkai, S., and Sen, S., eds., FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science, volume 3821 of Lecture Notes in Computer Science. Springer Berlin / Heidelberg. 164176.
Kann, V. 1992. On the approximability of np-complete optimization problems. In PhD thesis.
Kortsarz, G. 2001. On the hardness of approximating spanners. Algorithmica 30:432450. 10.1007/s00453-001-0021y.
Li, D.; Du, H.; Wan, P.-J.; Gao, X.; Zhang, Z.; and Wu, W. 2009. Construction of strongly connected dominating sets in asymmetric multihop wireless networks. Theoretical Computer Science 410(810):661  669.
Storandt, S., and Funke, S. 2012. Cruising with a batterypowered vehicle and not getting stranded. In AAAI.
-----0
Dash, R.; Jennings, N.; and Parkes, D. 2003. Computational-mechanism design: A call to arms. Intelligent Systems, IEEE 18(6):4047.
de Weerdt, M.; Ketter, W.; and Collins, J. 2011. Pricing mechanism for real-time balancing in regional electricity markets. In Workshop on Trading Agent Design and Analysis at the Twenty-second Intl Joint Conf. on Artificial Intelligence. EPRI. 2012. Electric Power Research Institute Understanding electric utility customers Summary report.
Ermon, S.; Xue, Y.; Gomes, C.; and Selman, B. 2012.Learning policies for battery usage optimization in electric vehicles. Machine Learning and Knowledge Discovery in Databases 195210.
European Commission. 2011. Communication: Energy Roadmap 2050.
European Commission. 2013. Horizon 2020 Programme.Fleten, S.-E., and Pettersen, E. 2005. Constructing bidding curves for a price-taking retailer in the Norwegian electricity market. IEEE Transactions on Power Systems 20(2):701  708.
Gottwalt, S.; Ketter, W.; Block, C.; Collins, J.; and Weinhardt, C. 2011. Demand side management a simulation of household behavior under variable prices. Energy Policy 39:81638174.
Jordan, P. R.; Kiekintveld, C.; and Wellman, M. P. 2007.Empirical game-theoretic analysis of the TAC supply chain game. In Seventh International Conference on Autonomous Agents and Multi-Agent Systems, 11881195.
Joskow, P. L. 2008. Lessons learned from electricity market liberalization. The Energy Journal 29(2):942.
Ketter, W., and Symeonidis, A. 2012. Competitive benchmarking: Lessons learned from the Trading Agent Competition. AI Magazine 33(1).
Ketter, W.; Collins, J.; Gini, M.; Gupta, A.; and Schrater, P.2012a. Real-time tactical and strategic sales management for intelligent agents guided by economic regimes. Information Systems Research 23:12631283.
Ketter, W.; Collins, J.; Reddy, P.; and de Weerdt, M. 2012b.The 2012 Power Trading Agent Competition. Technical Report ERS-2012-010-LIS, RSM Erasmus University, Rotterdam, The Netherlands.
Peters, M.; Ketter, W.; Saar-Tsechansky, M.; and Collins, J.2013. A reinforcement-learning approach to autonomous decision-making in smart electricity markets. Machine Learning Journal Special Issue on ECML-PKDD 2012.Forthcoming.
Ramchurn, S.; Vytelingum, P.; Rogers, A.; and Jennings, N. 2012. Putting the smarts into the smart grid: A grand challenge for artificial intelligence. Communications of the ACM 55(4):8607.
Reddy, P., and Veloso, M. 2011. Learned Behaviors of Multiple Autonomous Agents in Smart Grid Markets. In Proceedings of the Twenty-Fifth AAAI Conference on Artificial Intelligence (AAAI-11).
Reddy, P., and Veloso, M. 2012. Factored Models for Multiscale Decision Making in Smart Grid Customers. In Proceedings of the Twenty-Sixth AAAI Conference on Artificial Intelligence (AAAI-12).
Strbac, G. 2008. Demand side management: Benefits and challenges. Energy Policy 36(12):44194426.
Sun, J., and Tesfatsion, L. 2007. Dynamic testing of wholesale power market designs: An open-source agent-based framework. Computational Economics 30(3):291327.
Tesfatsion, L. 2002. Agent-based computational economics: Growing economies from the bottom up. Artificial Life 8(1):5582.
Voice, T. D.; Vytelingum, P.; Ramchurn, S. D.; Rogers, A.; and Jennings, N. 2011. Decentralised control of microstorage in the smart grid. In AAAI Conference on Artificial Intelligence, 14211427.
Vytelingum, P.; Ramchurn, S.; Voice, T.; Rogers, A.; and Jennings, N. 2010. Trading agents for the smart electricity grid. In Proceedings of the 9th International Conference on Autonomous Agents and Multiagent Systems: volume 1-Volume 1, 897904. International Foundation for Autonomous Agents and Multiagent Systems.
Wellman, M. P.; Greenwald, A.; and Stone, P. 2007. Autonomous Bidding Agents. MIT Press.
-----0
Abdel-Karim, N.; Small, M.; and Ilic, M. 2009. Short term wind speed prediction by finite and infinite impulse response filters: A state space model representation using discrete markov process. In IEEE PowerTech, 1 8.
Ackermann, T.; Andersson, G.; and Soder, L. 2001. Distributed generation: a definition. Electric Power Systems Research 57(3):195  204.
Bartlett, P., and Tewari, A. 2009. REGAL: A regularization based algorithm for reinforcement learning in weakly communicating MDPs. In Proceedings of the Twenty-Fifth Conference on Uncertainty in Artificial Intelligence, 3542.AUAI Press.
Ben-Tal, A.; El Ghaoui, L.; and Nemirovski, A. 2009. Robust optimization. Princeton Univ Press.
Bhuvaneswari, R.; Edrington, C. S.; Cartes, D. A.; and Subramanian, S. 2009. Online economic environmental optimization of a microgrid using an improved fast evolutionary programming technique. In North American Power Symposium (NAPS), 2009, 1 6.
Bitar, E.; Rajagopal, R.; Khargonekar, P.; Poolla, K.; and Varaiya, P. 2011. Bringing wind energy to market. Submitted to IEEE Transactions on Power Systems.
Contreras, J.; Espinola, R.; Nogales, F.; and Conejo, A.2003. ARIMA models to predict next-day electricity prices.
IEEE Transactions on Power Systems 18(3):10141020.Even-Dar, E.; Kakade, S. M.; and Mansour, Y. 2009. Online Markov Decision Processes. Math. Oper. Res. 34(3):726 736.
Iancu, D. 2010. Adaptive robust optimization with applications in inventory and revenue management. Ph.D. Dissertation, Massachusetts Institute of Technology.
Jaksch, T.; Ortner, R.; and Auer, P. 2010. Near-optimal regret bounds for reinforcement learning. The Journal of Machine Learning Research 11:15631600.
Katiraei, F.; Iravani, R.; Hatziargyriou, N.; and Dimeas, A.2008. Microgrids management. IEEE Power and Energy Magazine 6(3):54 65.
Kowli, A., and Meyn, S. 2011. Supporting wind generation deployment with demand response. In IEEE Power and Energy Society General Meeting, 1 8.
Li, N.; Chen, L.; and Low, S. 2011. Optimal demand response based on utility maximization in power networks. In IEEE Power and Energy Society General Meeting, 1 8.
Madani, O. 2002. On policy iteration as a newtons method and polynomial policy iteration algorithms. In Proceedings of the National Conference on Artificial Intelligence, 273 278.
Mannor, S.; Mebel, O.; and Xu, H. 2012. Lightning does not strike twice: Robust MDPs with coupled uncertainty. ICML.
Monteiro, C.; Bessa, R.; Miranda, V.; Botterud, A.; Wang, J.; and Conzelmann, G. 2009. Wind power forecasting: State-of-the-art 2009. Technical report, Argonne National Laboratory, Decision and Information Sciences Division.
Morari, M., and Lee, J. 1999. Model predictive control: Past, present and future. Comput. Chem. Eng. 23(4):667 682.
Nilim, A., and Ghaoui, L. 2005. Robust control of markov decision processes with uncertain transition matrices. Operations Research 780798.
Ortner, R. 2010. Online regret bounds for markov decision processes with deterministic transitions. Theoretical Computer Science 411(29):26842695.
Regan, K., and Boutilier, C. 2011. Robust online optimization of reward-uncertain MDPs. In Proceedings of IJCAI-11, volume 141.
Richardson, I.; Thomson, M.; Infield, D.; and Clifford, C.2010. Domestic electricity use: A high-resolution energy demand model. Energy and Buildings 42(10):18781887.
Sharma, N.; Sharma, P.; Irwin, D.; and Shenoy, P. 2011. Predicting solar generation from weather forecasts using machine learning. In IEEE International Conference on Smart Grid Communications (SmartGridComm), 528 533.
Urgaonkar, R.; Urgaonkar, B.; Neely, M.; and Sivasubramaniam, A. 2011. Optimal power cost management using stored energy in data centers. In Proceedings of the ACM SIGMETRICS, 221232. ACM.
Wiser, R., and Barbose, G. 2008. Renewables portfolio standards in the united states; a status report with data through 2007. Technical Report LBNL-154E, Lawrence Berkeley National Laboratory.Yu, J., and Mannor, S. 2009. Online learning in markov decision processes with arbitrarily changing rewards and transitions. In GameNets 09, 314322. IEEE.
Zhu, T.; Mishra, A.; Irwin, D.; Sharma, N.; Shenoy, P.; and Towsley, D. 2011. The case for efficient renewable energy management for smart homes. Proceedings of the Third Workshop on Embedded Sensing Systems for Energyefficiency in Buildings (BuildSys).
-----0
Armstrong-Crews, N., and Veloso, M. 2007. Oracular Partially Observable Markov Decision Processes: A Very Special Case. In Proceedings of the IEEE International Conference on Robotics and Automation.
Auer, P.; Cesa-Bianchi, N.; Freund, Y.; and Schapire, R. E.1995. Gambling in a rigged casino: The adversarial multiarmed bandit problem. Proceedings of IEEE 36th Annual Foundations of Computer Science 68(68):322331.
Barbose, G.; Goldman, C.; and Neenan, B. 2005. Electricity in real timea survey of utility experience with real time pricing. Energy 30.
Block, C.; Collins, J.; and Ketter, W. 2010. A Multi-Agent Energy Trading Competition. Technical report, Erasmus University Rotterdam.
Busoniu, L.; Babuska, R.; and De Schutter, B. 2008. A Comprehensive Survey of Multiagent Reinforcement Learning. IEEE Transactions on Systems Man and Cybernetics 38(2):156172.
Camerer, C. F., and Ho, T. H. 1999. Experience-Weighted Attraction Learning in Normal Form Games. Econometrica 67(4):827874.
Camerer, C. F. 2008. Behavioral Game Theory and the Neural Basis of Strategic Choice. In Neuroeconomics: Formal Models Of Decision-Making And Cognitive Neuroscience.Academic Press. 193206.
Crawford, E., and Veloso, M. 2008. Negotiation in SemiCooperative Agreement Problems. In IEEE/WIC/ACM International Conference on Web Intelligence and Intelligent Agent Technology.
Emery-Montemerlo, R.; Gordon, G.; Schneider, J.; and Thrun, S. 2004. Approximate Solutions for Partially Observable Stochastic Games with Common Payoffs. In International Conference on Autonomous Agents, 136143.
Faruqui, A., and Palmer, J. 2012. Dynamic Pricing and Its Discontents. Technical report, The Brattle Group.
Foster, D. P., and Vohra, R. 1999. Regret in the On-Line Decision Problem. Games and Economic Behavior 29(12):735.
Fudenberg, D., and Levine, D. K. 1999. Conditional Universal Consistency. Games and Economic Behavior 29(12):104130.
Gellings, C.; Samotyj, M.; and Howe, B. 2004. The future power delivery system. IEEE Power & Energy 2(5):4048.
Gomes, C. 2009. Computational Sustainability: Computational Methods for a Sustainable Environment. The Bridge, National Academy of Engineering 39.
Hammerstrom, D. 2008. Pacific Northwest GridWise Testbed Demonstration Projects; Part I. Olympic Peninsula Project. Technical report, PNNL-17167, Pacific Northwest National Laboratory.
Hart, S., and Mas-Colell, A. 2000. A simple adaptive procedure leading to correlated equilibrium. Econometrica 68:11271150.
IESO of Ontario. 2011. http://www.ieso.ca.Ketter, W.; Collins, J.; and Reddy, P. 2012. Power TAC: A Competitive Simulation of the Smart Grid for Autonomous Trading Agents. In submission.
Kok, K. 2010. Multi-Agent Coordination in the Electricity Grid, from Concept towards Market Introduction.(Aamas):16811688.
Littlestone, N., and Warmuth, M. K. 1994. The weighted majority algorithm. Information and Computation 108(2):212261.
Melo, F. S., and Veloso, M. 2009. Learning of Coordination: Exploiting Sparse Interactions in Multiagent Systems.Autonomous Agents and MultiAgent Systems 773780.
Ramchurn, S. D.; Vytelingum, P.; Rogers, A.; and Jennings, N. 2011. Agent-Based Control for Decentralised Demand Side Management in the Smart Grid. In Autonomous Agents and Multiagent Systems AAMAS 11.
Reddy, P., and Veloso, M. 2011. Learned Behaviors of Multiple Autonomous Agents in Smart Grid Markets. In Proceedings of the Twenty-Fifth AAAI Conference on Artificial Intelligence (AAAI-11).
Reddy, P., and Veloso, M. 2012. Factored Models for Multiscale Decision-Making in Smart Grid Customers. In Proceedings of the Twenty-Sixth AAAI Conference on Artificial Intelligence (AAAI-12).
Roth, M. 2003. Execution-time communication decisions for coordination of multi-agent teams. Ph.D. Dissertation.
San Diego Gas & Electric. 2012. http://www.sdge.com.
Sandholm, T., and Lesser, V. R. 1995. Coalition Formation among Bounded Rational Agents. International Joint Conference on Artificial Intelligence 14(1):662669.
Singh, S.; Jaakkola, T.; and Jordan, M. I. 1994. Reinforcement Learning with Soft State Aggregation. In Advances in Neural Information Processing Systems (NIPS).
Strbac, G. 2008. Demand side management: benefits and challenges. Energy Policy 36 (12), 44194426.
Strehl, A. L., and Littman, M. L. 2008. An Analysis of Model-Based Interval Estimation for Markov Decision Processes. Journal of Computer and System Sciences 74(8):13091331.
Sutton, R. S.; Precup, D.; and Singh, S. 1999. Between MDPs and semi-MDPs: A framework for temporal abstraction in reinforcement learning. Artificial Intelligence 112(12):181211.
Vytelingum, P.; Voice, T. D.; Ramchurn, S. D.; Rogers, A.; and Jennings, N. R. 2010. Agent-based Micro-Storage Management for the Smart Grid. (Aamas):1014.
-----0
Boyd, S., and Vandenberghe, L. 2004. Convex optimization. Cambridge university press.
Chu, C., and Jong, T. 2008. A novel direct air-conditioning load control method. Power Systems, IEEE Transactions on 23(3):13561363.
Conejo, A.; Morales, J.; and Baringo, L. 2010. Real-time demand response model. Smart Grid, IEEE Transactions on 1(3):236242.
Dietrich, K.; Latorre, J.; Olmos, L.; and Ramos, A. 2012. Demand response in an isolated system with high wind integration. Power Systems, IEEE Transactions on 27(1):2029.
Jellings, C. W., and Chamberlin, J. H. 1993. Demand Side Management: Concepts and Methods. PennWell Books, Tulsa, OK.
Kim, T., and Poor, H. 2011. Scheduling power consumption with price uncertainty. Smart Grid, IEEE Transactions on 2(3):519527.
Kirschen, D. 2003. Demand-side view of electricity markets.Power Systems, IEEE Transactions on 18(2):520527.
Medina, J.; Muller, N.; and Roytelman, I. 2010a. Demand response and distribution grid operations: Opportunities and challenges. Smart Grid, IEEE Transactions on 1(2):193198.
Medina, J.; Muller, N.; and Roytelman, I. 2010b. Demand response and distribution grid operations: Opportunities and challenges. Smart Grid, IEEE Transactions on 1(2):193 198.
Mohsenian-Rad, A., and Leon-Garcia, A. 2010. Optimal residential load control with price prediction in real-time electricity pricing environments. Smart Grid, IEEE Transactions on 1(2):120133.
Mohsenian-Rad, A.; Wong, V.; Jatskevich, J.; Schober, R.; and Leon-Garcia, A. 2010. Autonomous demand-side management based on game-theoretic energy consumption scheduling for the future smart grid. Smart Grid, IEEE Transactions on 1(3):320 331.
Parvania, M., and Fotuhi-Firuzabad, M. 2010. Demand response scheduling by stochastic scuc. Smart Grid, IEEE Transactions on 1(1):8998.
Pedrasa, M.; Spooner, T.; and MacGill, I. 2010. Coordinated scheduling of residential distributed energy resources to optimize smart home energy services. Smart Grid, IEEE Transactions on 1(2):134143.
Philpott, A., and Pettersen, E. 2006. Optimizing demand-side bids in day-ahead electricity markets. Power Systems, IEEE Transactions on 21(2):488498.
Rahimi, F., and Ipakchi, A. 2010. Demand response as a market resource under the smart grid paradigm. IEEE Transactions on Smart Grid 1(1):8288.
Ramchurn, S.; Vytelingum, P.; Rogers, A.; and Jennings, N. 2011.Agent-based control for decentralised demand side management in the smart grid.
Ramchurn, S.; Vytelingum, P.; Rogers, A.; and Jennings, N. 2012.Putting the smarts into the smart grid: A grand challenge for artificial intelligence. Communications of the ACM 55(4):8697.
Roozbehani, M.; Ohannessian, M.; Materassi, D.; and Dahleh, M.2012. Load-shifting under perfect and partial information: Models, robust policies, and economic value.
Tanaka, K.; Uchida, K.; Ogimi, K.; Goya, T.; Yona, A.; Senjy, T.; Funabashi, T.; and Kim, C. 2011. Optimal operation by controllable loads based on smart grid topology considering insolation forecasted error. Smart Grid, IEEE Transactions on 2(3):438444.
Voice, T.; Vytelingum, P.; Ramchurn, S.; Rogers, A.; and Jennings, N. 2011. Decentralised control of micro-storage in the smart grid. In AAAI Conference on Artificial Intelligence.
Wood, A., and Wollenberg, B. 1996. Power generation operation and control, john wiley & sons. New York.
-----0
Alvarado, E.; Dansberg, D. V.; and Pickford, S. G. 1998.Modelling large forest fires as extreme events. Northwest Science 72(6675).2013. Tasmanian fires raze 80 properties, thousand stranded. The Australian, http://www.theaustralian.com.au/news/nation/fires-raze-80-properties-thousandsstranded/story-e6frg6nf-1226547982605. 2013. Summary of previous fire seasons. Wildfire Management Branch, Ministry of Forests and Range, Province of British Columbia.
Boutilier, C. 2013. Computational decision support: Regretbased models for optimization and preference elicitation. In 
Crowley, H., and Zentall, T. R., eds., Comparative Decision Making: Analysis and Support Across Disciplines and Applications. Oxford University Press.2011. Canada report 2011. Canadian Interagency Forest Fire Centre Inc.
Coffrin, C., and Hentenryck, P. V. 2012. Last mile restoration for multiple interdependent infrastructures. In Proceedings of the Twenty-Sixth AAAI Conference on Artificial Intelligence.
Cortez, P., and Morais, A. 2007. A data mining approach to predict forest fires using meteorological data. In New Trends in Artificial Intelligence, 13th EPIA 2007 Portuguese Conference on Artificial Intelligence.
Henshaw, C. 2013. Insurance council increases Tasmania fire cost estimate. Wall Street Journal, January 7, 2013, http://online.wsj.com/article/BT-CO-20130107712221.html.
Jiang, Y.; Zhuang, Q.; and Mandallaz, D. 2012. Modeling large fire frequency and burned area in canadian terrestrial ecosystems with poisson models. Environmental Modeling and Assessment 17(5):483493.
Jones, B. M.; Kolden, C. A.; Jandt, R.; Abatzoglou, J. T.; Urban, F.; and Arp, C. D. 2009. Fire behavior, weather and burn severity of the 2007 Anaktuvuk River tundra fire, North Slope, Alaska. Arctic, Antarctic and Alpine Research 41(3):309316.
Larson, K., and Sandholm, T. 2001. Costly valuation computation in auctions. In TARK01: Proceedings of the Eighth Conference on Theoretical Aspects of Rationality and Knowledge, 169182.
Larson, K., and Sandholm, T. 2005. Mechanism design and deliberative agents. In Proceedings of the Fourth International Conference on Autonomous Agents and Multiagent Systems (AAMAS 2005), 650656.
Mack, M. C.; Bret-Harte, M. S.; Hollingsworth, T. N.; Jandt, R. R.; Schuur, E. A. G.; Shaver, G. R.; and Verbyla, D. L.2011. Carbon loss from an unprecendented arctic tundra wildfire. Nature 475:489492.
Thompson, D. R. M., and Leyton-Brown, K. 2007. Valuation uncertainty and imprefect introspection in second-price auctions. In Proceedings of the Twenty-Second National Conference on Artificial Intelligence, 148153.
Thompson, D. R. M., and Leyton-Brown, K. 2011.Dominant-strategy auction design for agents with uncertain, private values. In Proceedings of the Twenty-Fifth AAAI Conference on Artificial Intelligence.
Westerling, A. L.; Hildago, H. G.; Cayan, D. R.; and Swetmam, T. W. 2006. Warming and earlier spring increase western U.S. forest wildfire activity. Science 18.
Witala, M. R. 1999. Assessing the risk of cummulative burned acreage using the poisson probability model. Technical report, USDA Forest Service Gen. Tech. Report PSWGTR-173.
-----0
AOU. 1998. Check-list of North American Birds.
Banerjee, S.; Carlin, B.; and Gelfand, A. 2004. Hierarchical modeling and analysis for spatial data, volume 101. Chapman & Hall/CRC.
Bond, J. 1980. Birds of the Western Indies. Houghton Mifflin Co, Boston.
Breiman, L.; Friedman, J.; Stone, C.; and Olshen, R. 1984.Classification and regression trees. Chapman & Hall/CRC.Breiman, L. 1996. Bagging predictors. Machine learning 24(2):123140.
Brown, C. R., and Brown, M. B. 1999. Barn swallow (hirundo rustica). In Poole, A., ed., The Birds of North America Online. Ithaca, NY: Cornell Laboratory of Ornithology. At http://bna.birds.cornell.edu/bna/species/452.
Crainiceanu, C.; Ruppert, D.; Carroll, R.; Joshi, A.; and Goodner, B. 2007. Spatially adaptive Bayesian penalized splines with heteroscedastic errors. Journal of Computational and Graphical Statistics 16(2):265288.
Cressie, N., and Johannesson, G. 2008. Fixed rank kriging for very large spatial data sets. J. R. Statist. Soc. B 70:209 226.Cressie, N. 1986. Kriging nonstationary data. Journal of the American Statistical Association 81(395):625634.
Cressie, N. 1993. Statistics for Spatial Data. New York: John Wiley, 2nd edition.
Diefenbach, D.; Marshall, M.; Mattice, J.; Brauning, D.; and Johnson, D. 2007. Incorporating availability for detection in estimates of bird abundance. The Auk 124(1):96106.
Fink, D.; Hochachka, W.; Zuckerberg, B.; Winkler, D.; Shaby, B.; Munson, M.; Hooker, G.; Riedewald, M.; Sheldon, D.; and Kelling, S. 2010. Spatiotemporal exploratory models for broad-scale survey data. Ecological Applications 20(8):21312147.
Fortin, M., and Dale, M. 2005. Spatial analysis: a guide for ecologists. Cambridge University Press.
Gelfand, A. 2012. Hierarchical modeling for spatial data problems. Spatial Statistics 1:3039.
Grosbois, V.; Gimenez, O.; Gaillard, J.; Pradel, R.; Barbraud, C.; Clobert, J.; Mller, A.; and Weimerskirch, H.2008. Assessing the impact of climate variation on survival in vertebrate populations. Biological Reviews 83(3):357 399.
Hastie, T. J.; Tibshirani, R.; and Friedman, J. 2009. The elements of statistical learning: data mining, inference, and prediction. Springer.
Huang, H.-C.; Cressie, N.; and Gabrosek, J. 2002.Resolution-consistent spatial prediction of global processes from satellite data. Journal of Computational and Graphical Statistics 11(1):6388.
Jun, M., and Stein, M. L. 2008. Nonstationary covariance models for global data. Annals of Applied Statistics 2:1271 1289.
Kammann, E., and Wand, M. 2003. Geoadditive models.Journal of the Royal Statistical Society: Series C (Applied Statistics) 52(1):118.
Kuncheva, L., and Whitaker, C. 2003. Measures of diversity in classifier ensembles and their relationship with the ensemble accuracy. Machine Learning 51(2):181207.
Levin, S. A. 1992. The problem of pattern and scale in Ecology. Ecology 73(6):19431967. The Robert H. MacArthur Award Lecture.
Paciorek, C., and Schervish, M. 2004. Nonstationary covariance functions for Gaussian process regression. Advances in Neural Information Processing Systems 16:273280.
Pintore, A., and Holmes, C. C. 2004. Spatially adaptive non-stationary covariance functions via spatially adaptive spectra. Technical report, Department of Statistics, Oxford University. At: http://www.stats.ox.ac.uk/?cholmes/ Reports/spectral tempering.pdf.
Pintore, A.; Speckman, P.; and Holmes, C. C. 2006. Spatially adaptive smoothing splines. Biometrika 93(1):113 125.
Rasmussen, C., and Williams, C. 2006. Gaussian processes for machine learning. MIT press Cambridge, MA.
Ridgely, R., and Guy, T. 1989. The Birds of South America.University of Texas Press.
Rue, H., and Held, L. 2005. Gaussian Markov Random Fields: Theory and Applications, volume 104 of Monographs on Statistics and Applied Probability. London: Chapman & Hall.
Samet, H. 2006. Foundations of multidimensional and metric data structures. Morgan Kaufmann.Stein, M. L. 2005. Space-time covariance functions. Journal of the American Statistical Association 100:310321.
Tzeng, S.; Huang, H.-C.; and Cressie, N. 2005. A fast, optimal spatial-prediction method for massive datasets. Journal of the American Statistical Association 100(472):1343 1357.
Ueda, N., and Nakano, R. 1996. Generalization error of ensemble estimators. In IEEE International Conference on Neural Networks.
Wood, S. 2006. Generalized additive models: an introduction with R, volume 66. Chapman & Hall/CRC.
-----0
Agrawal, R., and Srikant, R. 1995. Mining sequential patterns. In Data Engineering, 1995. Proceedings of the Eleventh International Conference on, 314. IEEE.
Chan, W.; So, A.; and Lai, L. 2000. Harmonics load signature recognition by wavelets transforms. In Electric Utility Deregulation and Restructuring and Power Technologies, 2000. Proceedings. DRPT 2000. International Conference on, 666671. IEEE.
Chiu, B.; Keogh, E.; and Lonardi, S. 2003. Probabilistic Discovery of Time Series Motifs. In the Ninth ACM International Conference on Knowledge Discovery and Data Mining, 493498.
Gorur, D., and Rasmussen, C. 2010. Dirichlet Process Gaussian Mixture Models: Choice of the Base Distribution. Journal of Computer Science and Technology 25(4):653664.
Hart, G. 1992. Nonintrusive appliance load monitoring.Proceedings of the IEEE 80(2):18701891.
Kim, H.; Marwah, M.; Arlitt, M.; Lyon, G.; and Han, J.2010. Unsupervised disaggregation of low frequency power measurements. In 11th International Conference on Data Mining, 747758.
Kolter, J., and Jaakkola, T. 2012. Approximate inference in additive factorial hmms with application to energy disaggregation. In Journal of Machine Learning Research Proceedings Track (JMLR), volume 22, 14721482.
Kolter, J., and Johnson, M. 2011. Redd: A public data set for energy disaggregation research. In Workshop on Data Mining Applications in Sustainability (SIGKDD), San Diego, CA.
Kolter, J.; Batra, S.; and Ng, A. 2010. Energy disaggregation via discriminative sparse coding. In Proc. Neural Information Processing Systems.
Lam, H.; Fung, G.; and Lee, W. 2007. A novel method to construct taxonomy electrical appliances based on load signatures. Consumer Electronics, IEEE Transactions on 53(2):653660.
Laxman, S.; Tankasali, V.; and White, R. 2008. Stream Prediction using a Generative Model based on Frequent Episodes in Event Sequences. In the 14th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, 453461.
Nakano, Y., and Murata, H. 2007. Non-intrusive electric appliances load monitoring system using harmonic pattern recognition-trial application to commercial building. In Int.
Conf. Electrical Engineering, Hong Kong, China.Norford, L., and Leeb, S. 1996. Non-intrusive electrical load monitoring in commercial buildings based on steadystate and transient load-detection algorithms. Energy and Buildings 24(1):5164.
Parson, O.; Ghosh, S.; Weal, M.; and Rogers, A. 2012. Nonintrusive load monitoring using prior models of general appliance types. In Proceedings of the 26th AAAI Conference on Artificial Intelligence.
Patel, S.; Robertson, T.; Kientz, J.; Reynolds, M.; and Abowd, G. 2007. At the flick of a switch: Detecting and classifying unique electrical events on the residential power line. In Proceedings of the 9th international conference on Ubiquitous computing, 271288. Springer-Verlag.
Patnaik, D.; Marwah, M.; Sharma, R.; and Ramakrishnan, N. 2009. Sustainable Operation and Management of Data Center Chillers using Temporal Data Mining. In the 15th ACM International Conference on Knowledge Discovery and Data Mining, 13051314.
Shaw, S. 2000. System Identification Techniques and Modeling for Nonintrusive Load Diagnositics. Ph.D. Dissertation, Massachusetts Institute of Technology, Boston, MA.
Srinivasan, D.; Ng, W.; and Liew, A. 2006. Neural-networkbased signature recognition for harmonic source identification. Power Delivery, IEEE Transactions on 21(1):398405.
Yankov, D.; Keogh, E.; Medina, J.; Chiu, B.; and Zordan, V.2007. Detecting Time Series Motifs under Uniform Scaling. In the 13th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, 844853.
-----0
Agiomyrgiannakis, Y., and Stylianou, Y. 2009. Wrapped Gaussian Mixture Models for Modeling and High-Rate Quantization of Phase Data of Speech. IEEE Transactions on Audio, Speech, and Language Processing 17(4):775786.
Bahlmann, C. 2006. Directional features in online handwriting recognition. Pattern Recognition 39(1):115125.
Breitenberger, E. 1963. Analogues of the normal distribution on the circle and the sphere. Biometrika 50(1):8188.
Buler, J., and Diehl, R. 2009. Quantifying Bird Density During Migratory Stopover Using Weather Surveillance Radar. IEEE Transactions on Geoscience and Remote Sensing 47(8):27412751.
Buler, J. J.; Randall, L. a.; Fleskes, J. P.; Barrow, W. C.; Bogart, T.; and Kluver, D. 2012. Mapping wintering waterfowl distributions using weather surveillance radar. PloS one 7(7):e41571.
Dokter, A. M.; Liechti, F.; Stark, H.; Delobbe, L.; Tabary, P.; and Holleman, I. 2011. Bird migration flight altitudes studied by a network of operational weather radars. Journal of the Royal Society, Interface / the Royal Society 8(54):30 43.
Doviak, R., and Zrnic, D. 1993. Doppler Radar and Weather Observations. Academic Press.
Gao, J., and Droegemeier, K. 2004. A variational technique for dealiasing Doppler radial velocity data. Journal of Applied Meteorology (1990):934940.
Gauthreaux, S.; Belser, C.; and Blaricom, D. V. 2003. Using a network of WSR-88D weather surveillance radars to define patterns of bird migration at large spatial scales. In 
Berthold, P.; Gwinner, E.; and Sonnenschein, E., eds., Avian migration. Springer-Verlag. 335346.
Kunz, T. H.; Gauthreaux, S. A.; Hristov, N. I.; Horn, J. W.; Jones, G.; Kalko, E. K. V.; Larkin, R. P.; McCracken, G. F.; Swartz, S. M.; Srygley, R. B.; Dudley, R.; Westbrook, J. K.; and Wikelski, M. 2008. Aeroecology: probing and modeling the aerosphere. Integrative and comparative biology 48(1):111.
Minka, T. P. 2001. A family of algorithms for approximate Bayesian inference. Ph.D. Dissertation, Massachusetts Institute of Technology.
Murphy, K. P. 2002. Dynamic bayesian networks: representation, inference and learning. Ph.D. Dissertation, University of California, Berkeley.
Smola, A.; Vishwanathan, S.; and Eskin, E. 2003. Laplace propagation. Neural Information Processing Systems (Section 5).
Tabary, P.; Scialom, G.; and Germann, U. 2001. Real-Time Retrieval of the Wind from Aliased Velocities Measured by Doppler Radars. Journal of Atmospheric and Oceanic Technology 18(6):875882.
-----0
Bellman, R. 1957. Dynamic Programming. New Jersey: Princeton University Press.
Brafman, R. I., and Tennenholtz, M. 2003. R-max: A General Polynomial Time Algorithm for Near-Optimal Reinforcement Learning. The Journal of Machine Learning Research 3:213231.
Chernoff, H. 1952. A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the Sum of Observations.
The Annals of Mathematical Statistics 23(4):493507.DiTomaso, J., and Bell, C. E. 1996. Proceedings of The Saltcedar Management Workshop. Rancho Mirage, CA: www.invasivespeciesinfo.gov/docs/news/workshopJun96/index.html.
Fiechter, C.-N. 1994. Efficient Reinforcement Learning.In Proceedings of the Seventh Annual ACM Conference on Computational Learning Theory, 8897. ACM Press.
Good, I. J. 1953. The Population Frequencies of Species and the Estimation of Population Parameters. Biometrika 40(3):237264.
Jaksch, T.; Ortner, R.; and Auer, P. 2010. Near-optimal Regret Bounds for Reinforcement Learning. Journal of Machine Learning Research 11:15631600.
Kakade, S. M. 2003. On the Sample Complexity of Reinforcement Learning. Doctoral dissertation, University College London.
Kearns, M., and Saul, L. 1998. Large Deviation Methods for Approximate Probabilistic Inference, with Rates of Convergence. In Proceedings of the Fourteenth Conference on Uncertainty in Artificial Intelligence (UAI-98), 311319.
Kearns, M., and Singh, S. 1998. Near-optimal Reinforcement Learning in Polynomial Time. Machine Learning 49:260268.
McAllester, D., and Ortiz, L. 2003. Concentration Inequalities for the Missing Mass and for Histogram Rule Error.Journal of Machine Learning Research 4:895911.
Puterman, M. 1994. Markov Decision Processes: Discrete Stochastic Dynamic Programming. Wiley Series in Probability and Mathematical Statistics. Wiley.
Smith, T., and Simmons, R. 2006. Focused Real-Time Dynamic Programming for MDPs: Squeezing More Out of a Heuristic. In AAAI 2006, 12271232.
Stenquist, S. 1996. Saltcedar Management and Riparian Restoration Workshop. Las Vegas, NV: www.invasivespeciesinfo.gov/docs/news/workshopSep96/index.html.
Strehl, A. L., and Littman, M. L. 2004. An Empirical Evaluation of Interval Estimation for Markov Decision Processes.
In 16th IEEE International Conference on Tools with Artificial Intelligence (ICTAI 2004), 128135.
Strehl, A., and Littman, M. 2008. An Analysis of ModelBased Interval Estimation for Markov Decision Processes.Journal of Computer and System Sciences 74(8):13091331.
Syed, U.; Bowling, M.; and Schapire, R. 2008. Apprenticeship Learning Using Linear Programming. In International Conference on Machine Learning.
Weissman, T.; Ordentlich, E.; Seroussi, G.; Verdu, S.; and Weinberger, M. J. 2003. Inequalities for the L1 Deviation of the Empirical Distribution. Technical report, HP Labs.
Wingate, D., and Seppi, K. 2006. Prioritization Methods for Accelerating MDP Solvers. Journal of Machine Learning Research 6:851881.
-----0
Aggelogiannaki, E., and Sarimveis, H. 2008. Nonlinear model predictive control for distributed parameter systems using data driven artificial neural network models. Computers & Chemical Engineering.
Ermon, S.; Xue, Y.; Gomes, C.; and Selman, B. 2012.Learning Policies for Battery Usage Optimization in Electric Vehicles. In Machine Learning and Knowledge Discovery in Databases. Springer Berlin Heidelberg.
Falaki, H.; Govindan, R.; and Estrin, D. 2009. Smart screen management on mobile phones. Energy.
Kleinman, D., and Baron, S. 1970. An optimal control model of human response part I: Theory and validation. Automatica.
Lin, C.-C.; Peng, H.; and Grizzle, J. 2003. Power management strategy for a parallel hybrid electric truck. IEEE Transactions on Control Systems Technology.
Moura, S. J.; Fathy, H. K.; Callaway, D. S.; and Stein, J. L.2011. A stochastic optimal control approach for power management in plug-in hybrid electric vehicles. In IEEE Transactions on Control Systems Technology.
Oldewurtel, F., and Parisio, A. 2010. Energy efficient building climate control using stochastic model predictive control and weather predictions. American Control Conference.
Pentland, A., and Liu, A. 1999. Modeling and prediction of human behavior. Neural Computation.
Prokop, G. 2001. Modeling human vehicle driving by model predictive online optimization. Vehicle System Dynamics.
Ravi, N.; Scott, J.; Han, L.; and Iftode, L. 2008. Contextaware battery management for mobile phones. In Pervasive Computing and Communications.
Styler, A.; Podnar, G.; Dille, P.; Duescher, M.; Bartley, C.; and Nourbakhsh, I. 2011. Active management of a heterogeneous energy store for electric vehicles. In Integrated and Sustainable Transportation Systems.
Voort, M. v. d.; Dougherty, M. S.; and Maarseveen, M. v.2001. A prototype fuel-efficiency support tool. Transportation Research.
-----0
Bates, W., and Jones, A. 2007. Least-Cost Corridor Analysis for Evaluation of Lynx Habitat Connectivity in the Middle Rockies.Technical Report December.
Conrad, J.; Gomes, C. P.; van Hoeve, W.-J.; Sabharwal, A.; and Suter, J. 2007. Connections in networks: Hardness of feasibility versus optimality. In CPAIOR, 1628.
Conrad, J.; Gomes, C. P.; van Hoeve, W.-J.; Sabharwal, A.; and Suter, J. 2012. Wildlife corridors as a connected subgraph problem.
J. of Environmental Economics and Management 63(1):1  18.Copeland, J. P.; McKelvey, K. S.; Aubry, K. B.; Landa, A.; Persson, J.; et al. 2010. The bioclimatic envelope of the wolverine (gulo gulo): do climatic constraints limit its geographic distribution? Canadian Journal of Zoology 88(3):233246.
Coulon, A.; Cosson, J.; Angibault, J.; Cargnelutti, B.; Galan, M.; et al. 2004. Landscape connectivity influences gene flow in a roe deer population inhabiting a fragmented landscape: an individual based approach. Molecular ecology 13(9):28412850.
Dilkina, B., and Gomes, C. P. 2010. Solving connected subgraph problems in wildlife conservation. In CPAIOR, 102116.
Dilkina, B.; Lai, K. J.; and Gomes, C. P. 2011. Upgrading shortest paths in networks. In CPAIOR, 7691.
Gomes, C. 2009. Computational sustainability: Computational methods for a sustainable environment, economy, and society. The Bridge, National Academy of Engineering 39(4).
Joseph, L. N.; Maloney, R. F.; and Possingham, H. P. 2009. Optimal allocation of resources among threatened species: a project prioritization protocol. Conservation biology 23(2):32838.
Kareiva, P. 2006. Introduction: evaluating and quantifying the conservation dividends of connectivity.
Lai, K. J.; Gomes, C. P.; Schwartz, M. K.; McKelvey, K. S.; Calkin, D. E.; and Montgomery, C. A. 2011. The steiner multigraph problem: Wildlife corridor design for multiple species. In AAAI.
Le Bras, R.; Dilkina, B.; Xue, Y.; Gomes, C. P.; McKelvey, K. S.; Montgomery, C.; and Schwartz, M. K. 2013. Robust network design for multispecies conservation. In AAAI.
McKelvey, K. S.; Copeland, J. P.; Schwartz, M. K.; Littell, J. S.; Aubry, K. B.; et al. 2011. Climate change predicted to shift wolverine distributions, connectivity, and dispersal corridors. Ecological Applications 21(8):28822897.
McRae, B. H.; Dickson, B. G.; Keitt, T. H.; and Shah, V. B. 2008.Using circuit theory to model connectivity in ecology, evolution, and conservation. Ecology 89(10):271224.
Naidoo, R.; Balmford, A.; Ferraro, P.; Polasky, S.; Ricketts, T.; and Rouget, M. 2006. Integrating economic costs into conservation planning. Trends in Ecology & Evolution 21(12):681687.
Rudnick, D. A.; Beier, P.; Cushman, S.; Dieffenbach, F.; Epps, C. W.; et al. 2012. The role of landscape connectivity in planning and implementing conservation and re storation priorities. Issues in Ecology 16.
Schwartz, M. K.; Copeland, J. P.; Anderson, N. J.; Squires, J. R.; Inman, R. M.; et al. 2009. Wolverine gene flow across a narrow climatic niche. Ecology 90(11):32223232.
Singleton, P. H.; Gaines, W. L.; and Lehmkuhl, J. F. 2002.Landscape permeability for large carnivores in washington: a geographic information system weighted-distance and least-cost corridor assessment. Res. Pap. PNW-RP-549: U.S. Dept. of Agric., Forest Service, Pacific Northwest Research Station.
Taylor, P. D.; Fahrig, L.; Henein, K.; and Merriam, G. 1993. Connectivity is a vital element of landscape structure. Oikos 73:4348.
-----0
Bar-Shalom, Y., and Li, X. 1995. Multitarget-multisensor tracking: principles and techniques. YBS Publishing, Storrs, CT: University of Connecticut.
Bar-Shalom, Y., and Tse, E. 1975. Tracking in a cluttered environment with probabilistic data association. Automatica 11(5):451460.
Blackman, S. 2004. Multiple hypothesis tracking for multiple target tracking. Aerospace and Electronic Systems Magazine, IEEE 19(1):518.
Caldeira, K.; Wickett, M.; et al. 2003. Anthropogenic carbon and ocean ph. Nature 425(6956):365365.
Cham, T., and Rehg, J. 1999. A multiple hypothesis approach to figure tracking. In Computer Vision and Pattern Recognition, 1999. IEEE Computer Society Conference on., volume 2. IEEE.
Chelton, D.; Gaube, P.; Schlax, M.; Early, J.; and Samelson, R.2011. The influence of nonlinear mesoscale eddies on nearsurface oceanic chlorophyll. Science 334(6054):328332.
Chelton, D.; Schlax, M.; and Samelson, R. 2011. Global observations of nonlinear mesoscale eddies. Progress in Oceanography.
Cox, I., and Hingorani, S. 1996. An efficient implementation of reids multiple hypothesis tracking algorithm and its evaluation for the purpose of visual tracking. Pattern Analysis and Machine Intelligence, IEEE Transactions on 18(2):138150.
Dong, C.; Nencioli, F.; Liu, Y.; and McWilliams, J. 2011. An automated approach to detect oceanic eddies from satellite remotely sensed sea surface temperature data. Geoscience and Remote Sensing Letters, IEEE (99):15.
Faghmous, J. H.; Styles, L.; Mithal, V.; Boriah, S.; Liess, S.; Vikebo, F.; Mesquita, M. d. S.; and Kumar, V. 2012. Eddyscan: A physically consistent ocean eddy monitoring application. In Intelligent Data Understanding (CIDU), 2012 Conference on, 96 103.
Fernandes, A. 2008. Identification of oceanic eddies in satellite images. Advances in Visual Computing 6574.
Fu, L.; Chelton, D.; Le Traon, P.; and Morrow, R. 2010. Eddy dynamics from satellite altimetry. Oceanography 23(4):1425.
Han, M.; Xu, W.; Tao, H.; and Gong, Y. 2004. An algorithm for multiple object trajectory tracking. In Computer Vision and Pattern Recognition, 2004. CVPR 2004. Proceedings of the 2004 IEEE Computer Society Conference on, volume 1, I864. IEEE.
Hoegh-Guldberg, O., and Bruno, J. 2010. The impact of climate change on the worlds marine ecosystems. Science 328(5985):15231528.
Kurien, T. 1990. Issues in the design of practical multitarget tracking algorithms. Multitarget-Multisensor Tracking: Advanced Applications 1:4383.
Montemerlo, M.; Thrun, S.; Koller, D.; Wegbreit, B.; et al. 2003.Fastslam 2.0: An improved particle filtering algorithm for simultaneous localization and mapping that provably converges. In International Joint Conference on Artificial Intelligence, volume 18, 11511156. LAWRENCE ERLBAUM ASSOCIATES LTD.
Nieto, J.; Guivant, J.; Nebot, E.; and Thrun, S. 2003. Real time data association for fastslam. In Robotics and Automation, 2003. Proceedings. ICRA03. IEEE International Conference on, volume 1, 412418. IEEE.
Oh, S.; Russell, S.; and Sastry, S. 2009. Markov chain monte carlo data association for multi-target tracking. Automatic Control, IEEE Transactions on 54(3):481497.
Pegau, W.; Boss, E.; and Mart?nez, A. 2002. Ocean color observations of eddies during the summer in the gulf of california.Geophysical Research Letters 29(9):1295.
Poore, A. 1995. Multidimensional assignment and multitarget tracking. Partitioning Data Sets. DIMACS Series in Discrete Mathematics and Theoretical Computer Science 19:169196.
Reid, D. 1979. An algorithm for tracking multiple targets. Automatic Control, IEEE Transactions on 24(6):843854.
Smal, I.; Draegestein, K.; Galjart, N.; Niessen, W.; and Meijering, E. 2008. Particle filtering for multiple object tracking in dynamic fluorescence microscopy images: Application to microtubule growth analysis. Medical Imaging, IEEE Transactions on 27(6):789804.
-----0
Andren, H. 1994. Effects of habitat fragmentation on birds and mammals in landscapes with different proportions of suitable habitat: a review. Oikos 71(3):355366.
Beier, P.; Majka, D. R.; and Newell, S. L. 2009. Uncertainty analysis of least-cost modeling for designing wildlife linkages.Ecological Applications 19(8):20672077.
Borradaile, G.; Klein, P.; and Mathieu, C. 2009. An o (n log n) approximation scheme for steiner tree in planar graphs. ACM Transactions on Algorithms (TALG) 5(3):31.
Brown, K.; Prosser, P.; Beck, J.; and Wu, C. 2005. Exploring the use of constraint programming for enforcing connectivity during graph generation. In 5th workshop on modelling and solving problems with constraints (at IJCAI05).
Cancela, H.; Robledo, F.; and Rubino, G. 2003. Network design with node connectivity constraints. In IFIP/ACM Latin America conference on Towards a Latin American agenda for network research (LANC), 1320.
Conrad, J.; Gomes, C. P.; van Hoeve, W.-J.; Sabharwal, A.; and Suter, J. 2007. Connections in networks: Hardness of feasibility versus optimality. In CPAIOR: International Conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, 1628.
Conrad, J.; Gomes, C. P.; van Hoeve, W.-J.; Sabharwal, A.; and Suter, J. 2012. Wildlife corridors as a connected subgraph problem. J. of Environmental Economics and Management 63(1):1  18.
Dilkina, B., and Gomes, C. P. 2010. Solving connected subgraph problems in wildlife conservation. In CPAIOR: International Conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, 102116.
Dilkina, B.; Gomes, C. P.; Lai, K.; Le Bras, R.; McKelvey, K. S.; Sabharwal, A.; Schwartz, M. K.; Suter, J.; and Xue, Y. 2013. Large conservation landscapesynthetic and real-world datasets. In AAAI.
Garey, M. R., and Johnson, D. S. 1979. Computers and Intractability: A Guide to the Theory of NP-Completeness. New York, NY, USA: W. H. Freeman & Co.
Goemans, M.; Goldberg, A.; Plotkin, S.; Shmoys, D.; Tardos, E.; and Williamson, D. 1994. Improved approximation algorithms for network design problems. In SODA: ACM-SIAM Symposium on Discrete algorithms, 223232.
Gomes, C. P.; van Hoeve, W.-J.; and Sabharwal, A. 2008. Connections in networks: A hybrid approach. In CPAIOR: International Conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, 303307.
Gomes, C. 2009. Computational sustainability: Computational methods for a sustainable environment, economy, and society.The Bridge, National Academy of Engineering 39(4).
Hanski, I., and Ovaskainen, O. 2000. The metapopulation capacity of a fragmented landscape. Nature 404(6779):755758.
Hutter, F.; Hoos, H. H.; Leyton-Brown, K.; and Stutzle, T.2009. ParamILS: an automatic algorithm configuration framework. Journal of Artificial Intelligence Research 36:267306.
ILOG, SA. 2011. CPLEX 12.3 Reference Manual.Iverson, L. R., and Prasad, A. M. 1998. Predicting abundance of 80 tree species following climate change in the eastern united states. Ecological Monographs 68(4):465485.
Kerivin, H., and Mahjoub, A. R. 2005. Design of Survivable Networks: A survey. Networks 46(1):121.
Lai, K. J.; Gomes, C. P.; Schwartz, M. K.; McKelvey, K. S.; Calkin, D. E.; and Montgomery, C. A. 2011. The steiner multigraph problem: Wildlife corridor design for multiple species. In AAAI.
McKelvey, K. S.; Copeland, J. P.; Schwartz, M. K.; Littell, J. S.; Aubry, K. B.; et al. 2011. Climate change predicted to shift wolverine distributions, connectivity, and dispersal corridors. Ecological Applications 21(8):28822897.
McRae, B. H., and Beier, P. 2007. Circuit theory predicts gene flow in plant and animal populations. Proceedings of the National Academy of Sciences 104(50):1988519890.
Noss, R. F., and Harris, L. D. 1986. Nodes, networks, and mums: Preserving diversity at all scales. Environmental Management 10:299309.
Noss, R. F. 1983. A regional landscape approach to maintain diversity. BioScience 33(11):700706.
Phillips, S. J.; Williams, P.; Midgley, G.; and Archer, A. 2008.Optimizing dispersal corridors for the cape proteaceae using network flow. Ecological Applications 18(5):12001211.
Pisinger, D., and Ropke, S. 2010. Large neighborhood search. In Handbook of metaheuristics. Springer. 399419.
Prosser, P., and Unsworth, C. 2006. A connectivity constraint using bridges. Frontiers in Artificial Intelligence and Applications 141:707.
Shaw, P. 1998. Using constraint programming and local search methods to solve vehicle routing problems. In CP, 417431.
Singleton, P. H.; Gaines, W. L.; and Lehmkuhl, J. F. 2002. Landscape permeability for large carnivores in washington: a geographic information system weighted-distance and least-cost corridor assessment. Res. Pap. PNW-RP-549: USDA, Forest Service, Pacific Northwest Research Station.
Squires, J. R.; Copeland, J. P.; Ulizio, T. J.; Schwartz, M. K.; and Ruggiero, L. F. 2007. Sources and patterns of wolverine mortality in western montana. The Journal of Wildlife Management 71(7):22132220.
Squires, J. R.; DeCesare, N. J.; Olson, L. E.; Kolbe, J. A.; Hebblewhite, M.; and Parks, S. A. 2013. Combining resource selection and movement behavior to predict corridors for canada lynx at their southern range periphery. Biological Conservation 157:187195.
Verhoeven, M.; Severens, M.; and Aarts, E. 1996. Local search for steiner trees in graphs. Modern Heuristics Search Methods 117129.
Walker, R., and Craighead, L. 1997. Analyzing wildlife movement corridors in montana using gis. In ESRI Users Conference, 119. ESRI.
Williamson, D.; Goemans, M.; Mihail, M.; and Vazirani, V. 1995.A primal-dual approximation algorithm for generalized steiner network problems. Combinatorica 15(3):435454.
-----0
Bauer, A.; Botea, A.; Grastien, A.; Haslum, P.; and Rintanen, J. 2011. Alarm processing with model-based diagnosis of discrete event systems. In Proceedings of the 22nd International Workshop on Principles of Diagnosis (DX), 5259.
Boddy, M. S.; Gohde, J.; Haigh, T.; and Harp, S. A. 2005.Course of action generation for cyber security using classical planning. In Proceedings of the 15th International Conference on Automated Planning and Scheduling (ICAPS), 1221.
Cassandras, C., and Lafortune, S. 1999. Introduction to discrete event systems. Kluwer Academic Publishers.
Cordier, M.-O., and Thiebaux, S. 1994. Event-based diagnosis of evolutive systems. In Proceedings of the 5th International Workshop on Principles of Diagnosis (DX), 6469.
Emerson, E. A. 1990. Temporal and modal logic. Handbook of theoretical computer science: formal models and semantics B:9951072.
Gerevini, A.; Haslum, P.; Long, D.; Saetti, A.; and Dimopoulos, Y. 2009. Deterministic planning in the fifth international planning competition: PDDL3 and experimental evaluation of the planners. Artificial Intelligence 173(56):619668.
Gobelbecker, M.; Keller, T.; Eyerich, P.; Brenner, M.; and Nebel, B. 2010. Coming up with good excuses: What to do when no plan can be found. In Proceedings of the 20th International Conference on Automated Planning and Scheduling (ICAPS), 8188.
Grastien, A.; Anbulagan; Rintanen, J.; and Kelareva, E.2007. Diagnosis of discrete-event systems using satisfiability algorithms. In Proceedings of the 22nd National Conference on Artificial Intelligence (AAAI), 305310.
Grastien, A.; Haslum, P.; and Thiebaux, S. 2011. Exhaustive diagnosis of discrete event systems through exploration of the hypothesis space. In Proceedings of the 22nd International Workshop on Principles of Diagnosis (DX), 6067.
Haslum, P., and Grastien, A. 2011. Diagnosis as planning: Two case studies. In International Scheduling and Planning Applications woRKshop (SPARK), 2744.
Keyder, E., and Geffner, H. 2009. Soft Goals Can Be Compiled Away. Journal of Artificial Intelligence Research 36:547556.
Lucngeli, J.; Sarraute, C.; and Richarte, G. 2010. Attack planning in the real world. In Workshop on Intelligent Security (SecArt 2010).
McDermott, D. V. 1998. PDDL  The Planning Domain Definition Language. Technical Report TR-98-003/DCS TR-1165, Yale Center for Computational Vision and Control.
McIlraith, S. 1994. Towards a theory of diagnosis, testing and repair. In Proceedings of the 5th International Workshop on Principles of Diagnosis (DX), 185192.
Ram?rez, M., and Geffner, H. 2009. Plan recognition as planning. In Proceedings of the 21st International Joint Conference on Artificial Intelligence (IJCAI), 17781783.
Richter, S., and Westphal, M. 2010. The LAMA planner: Guiding cost-based anytime planning with landmarks. Journal of Artificial Intelligence Research 39:127177.
Roberts, M.; Howe, A.; Ray, I.; Urbanska, M.; Byrne, Z. S.; and Weidert, J. M. 2011. Personalized vulnerability analysis through automated planning. In Working Notes of IJCAI 2011, Workshop Security and Artificial Intelligence (SecArt11).
Sampath, M.; Sengupta, R.; Lafortune, S.; Sinnamohideen, K.; and Teneketzis, D. 1995. Diagnosability of discreteevent systems. IEEE Transactions on Automatic Control 40(9):15551575.
Sohrabi, S.; Baier, J.; and McIlraith, S. 2010. Diagnosis as planning revisited. In Proceedings of the 12th International Conference on the Principles of Knowledge Representation and Reasoning (KR), 2636.
Sohrabi, S.; Baier, J. A.; and McIlraith, S. A. 2011. Preferred explanations: Theory and generation via planning. In Proceedings of the 25th National Conference on Artificial Intelligence (AAAI), 261267. Accepted as both oral and poster presentation.
Srivastava, B.; Nguyen, T. A.; Gerevini, A.; Kambhampati, S.; Do, M. B.; and Serina, I. 2007. Domain independent approaches for finding diverse plans. In Proceedings of the 20th International Joint Conference on Artificial Intelligence (IJCAI), 20162022.
Thorsley, D.; Yoo, T.-S.; and Garcia, H. E. 2008. Diagnosability of stochastic discrete-event systems under unreliable observations. In Proceedings of American Control Conference, 1158 1165.
-----0
Beckmann, N.; Kriegel, H. P.; Schneider, R.; et al. 1990. The R*-tree: an Efficient and Robust Access Method for Points and Rectangles. In Proc. of SIGMOD, 322-331.
Berkhin, P. 2002. Survey of Clustering Data Mining Techniques. Technical report, Accrue Software.
Bohm, C.; Plant, C.; Shao, J.; et al. 2010. Clustering by Synchronization. In Proc. of KDD, 583-592.
Chandola, V.; Banerjee, A.; and Kumar, V. 2009. Anomaly Detection: A Survey. ACM Computing Surveys, 41(3): 1-58.
Chawla, N. 2009. Mining When Classes are Imbalanced, Rare Events Matter More, and Errors Have Costs Attached.In Proc. of SDM.
Cheng, J.; Ke, Y. P.; and Fu, A. W.; et al. 2011. Finding Maximal Cliques in Massive Networks. ACM Transactions on Database Systems, 36(4): 1-34.
Corral, A.; Manolopoulos, Y.; and Theodoridis, Y.; et al.2004. Algorithms for Processing K-closest-pair Queries in Spatial Databases. Data & Knowledge Engineering, 67-104.
Deodhar, M.; Cho, H.; Gupta, G.; et al. 2008. Robust Overlapping Co-clustering. Technical report, The University of Texas at Austin.
Dettling, M., and Buhlmann P. 2002. Supervised Clustering of Genes. Genome Biology. 3(12).
Ester, M.; Kriegel, H. P.; and Sander J.; et al. 1996. A Density-based Algorithm for Discovering Clusters in Large Spatial Databases with Noise. In Proc. of KDD, 226-231.
Feng, J. H.; Wang J. N.; and Li, G. L. 2012. Trie-join: a Triebased Method for Efficient String Similarity Joins. VLDB Journal, 21: 437-461.
Gupta, G., and Ghosh, J. 2008. Bregman Bubble Clustering: A Robust Framework for Mining Dense Clusters. ACM Transactions on Knowledge Discovery from Data, 2(2): 149.
Han, J. W.; Kamber, M.; and Pei, J. 2011. Data Mining: Concepts and Techniques (3rd Edition). Morgan Kaufmann.
Hastie, T.; Tibshirani, R.; and Eisen, M. B.; et al. 2000. Gene Shaving as a Method for Identifying Distinct Sets of Genes with Similar Expression Patterns. Genome Biology, 1, 1-21.
He, J. R. 2010. Rare Category Analysis. Carnegie Mellon University.
Hinneburg, A., and Keim, D. A. 1998. An Efficient Approach to Clustering in Large Multimedia Databases with Noise. In Proc. of KDD, 58-65.
Hjalason, G. R., and Samet, H. 1998. Incremental Distance Join Algorithms for Spatial Databases. In Proc. of SIGMOD, 237-248.
Hubert, L., and Arabie, P. 1985. Comparing Partitions. Journal of classification, 2(1): 193-218.
Jain, A. K. 2010. Data clustering: 50 Years Beyond KMeans. Pattern Recognition Letters, 31(8): 651-666.
Jain, A. K., and Dubes, R. C. 1988. Algorithms for Clustering Data. Prentice Hall.
Jiang, D. X.; Pei, J.; and Zhang A. D. 2005. A General Approach to Mining Quality Pattern-Based Clusters from Microarray Data. In Proc. of DASFAA, 188-200.
Jiang, D. X.; Tang, C.; and Zhang, A. D. 2004. Cluster Analysis for Gene Expression Data: A Survey. IEEE Transaction on Knowledge and Data Engineering, 16(11): 1370-1386.
Leskovec, J.; Lang, K. J.; and Dasgupta, A.; et al. 2008. Statistical Properties of Community Structure in Large Social and Information Networks. In Proc. of WWW, 695-704.
Leskovec, J.; Lang, K. J.; and Mahoney, M. W. 2010. Empirical Comparison of Algorithms for Network Community Detection. In Proc. of WWW, 631-640.
Li, M.; Chen, J. E.; and Wang, J. X.; et al. 2008. Modifying the DPClus Algorithm for Identifying Protein Complexes based on New Topological Structures. BMC Bioinformatics, 9: 398.
Liu, F. T.; Ting, K. M.; and Zhou, Z. H. 2010. On Detecting Clustered Anomalies using SCiForest. In Proc. of ECML/PKDD), 274-290.
Lu, C. T; DosSantos, R. F; and Liu, X.; et al. 2011. A Graphbased Approach to Detect Abnormal Spatial Points and Regions. International Journal on Artificial Intelligence Tools, 20(4): 721-751.
Lu, J.; Getz, G.; Miska, E. A.; et al. 2005. MicroRNA Expression Profiles Classify Human Cancers. Nature, 435(9): 834-838.
Macropo, K., and Ambuj, S. 2010. Scalable Discovery of Best Clusters on Large Graphs. In Proc. of VLDB, 693-702.
Maere, S.; Heymans, K.; and Kuiper, M. 2005. BiNGO: a Cytoscape Plugin to Assess Overrepresentation of Gene Ontology Categories in Biological Networks. Bioinformatics, 21(16): 3448-3449.
Papadimitriou, S.; Kitagawa, H.; and Gibbons, P. B.; et al.2003. Loci: Fast Outlier Detection using the Local Correlation Integral. In Proc. of ICDE, 315-327.
Sibson, R. 1973. SLINK: an Optimally Efficient Algorithm for the Single Link Cluster method. Computer Journal, 16: 30-34.
Tavazoie, S.; Hughes, J. D.; and Campbell, M. J.; et al. 1999.Systematic Determination of Genetic Network Architecture.Nature Genetics, 22: 281-285.
Xiao, C.; Wang, W.; and Lin, X.; et al. 2009. Top-k Set Similarity Joins. In Proc. of ICDE, 916-927.
Xiong, Y., and Zhu, Y. Y. 2009. Mining Peculiarity Groups in Day-by-Day Behavioral Datasets. In Proc. of ICDM, 578587.
Yin, X. X.; Han, J. W.; and Yu, P. S. 2006. LinkClus: Efficient Clustering via Heterogeneous Semantic Links. In Proc.of VLDB, 427-438.
Zheng, G. Y.; Tu, K.; and Yang, Q.; et al. 2008. ITFP: an Integrated Platform of Mammalian Transcription Factors.Bioinformatics, 24(20): 2416-2417.
-----0
Achlioptas, D. 2009. Random satisfiability. In Handbook of Satisfiability. IOS Press. 245270.
Aurell, E.; Gordon, U.; and Kirkpatrick, S. 2004. Comparing beliefs, surveys, and random walks. In Proc. of NIPS-04, 4956.
Balint, A., and Frhlich, A. 2010. Improving stochastic local search for SAT with a new probability distribution. In Proc. of SAT-10, 1015.
Balint, A., and Schning, U. 2012. Choosing probability distributions for stochastic local search and the role of make versus break. In Proc. of SAT-12, 1629.
Balint, A.; Gall, D.; Kapler, G.; and Retz, R. 2010. Experiment design and administration for computer clusters for SAT-solvers (edacc). JSAT 7(2-3):7782.
Birattari, M.; Yuan, Z.; Balaprakash, P.; and Sttzle, T. 2010.F-race and iterated F-race: An overview. In Empirical Methods for the Analysis of Optimization Algorithms. Springer.311336.
Cai, S., and Su, K. 2012. Configuration checking with aspiration in local search for SAT. In Proc. of AAAI-12, 334 340.
Gableske, O., and Heule, M. 2011. EagleUP: Solving random 3-SAT using SLS with unit propagation. In Proc. of SAT-11, 367368.
Hoos, H. H., and Sttzle, T. 2004. Stochastic Local Search: Foundations & Applications. Elsevier / Morgan Kaufmann.
Hoos, H. H. 2002. An adaptive noise mechanism for WalkSAT. In Proc. of AAAI-02, 655660.
Kautz, H. A.; Sabharwal, A.; and Selman, B. 2009. Incomplete algorithms. In Handbook of Satisfiability. IOS Press.185203.
Kirkpatrick, S., and Selman, B. 1994. Critical behavior in the satisfiability of random boolean formulae. Science 264:12971301.
Kroc, L.; Sabharwal, A.; and Selman, B. 2010. An empirical study of optimal noise and runtime distributions in local search. In Proc. of SAT-10, 346351.
Li, C. M., and Huang, W. Q. 2005. Diversification and determinism in local search for satisfiability. In Proc. of SAT05, 158172.
Li, C. M., and Li, Y. 2012. Satisfying versus falsifying in local search for satisfiability (poster presentation). In Proc.of SAT-12, 477478.
McAllester, D. A.; Selman, B.; and Kautz, H. A. 1997. Evidence for invariants in local search. In Proc. of AAAI-97, 321326.
Papadimitriou, C. H. 1991. On selecting a satisfying truth assignment. In Proc. of FOCS-91, 163169.
Seitz, S.; Alava, M.; and Orponen, P. 2005. Focused local search for random 3-satisfiability. J. Stat. Mech. P06006.
Selman, B.; Kautz, H. A.; and Cohen, B. 1994. Noise strategies for improving local search. In Proc. of AAAI-94, 337 343.
-----0
Abe, S., and Suzuki, N. 2003. Itineration of the internet over nonequilibrium stationary states in Tsallis statistics. Physical Review E 67(016106).
Abe, S., and Suzuki, N. 2005. Scale-free statistics of time interval between successive earthquakes. Physica A: Statistical Mechanics and its Applications 350:588596.
Aronszajn, N. 1950. Theory of reproducing kernels. Transactions of American Mathematical Society 68(3):337404.
Barabasi, A. L., and Albert, R. 1999. Emergence of scaling in random networks. Science 286:509512.
Berg, C.; Christensen, J. P. R.; and Ressel, P. 1984. Harmonic Analysis on Semigroups: Theory of Positive Definite and Related Functions. Springer.
Bochner, S. 1959. Lectures on Fourier Integral. Princeton N.J.: Princeton University Press.
Chang, C. C., and Lin, C. J. 2011. LIBSVM: A library for support vector machines. ACM Transactions on Intelligent Systems and Technology 2(3):27:127:27.
Cristianini, N., and Shawe-Taylor, J. 2004. Kernel methods for Pattern Analysis. Cambridge University Press.
Dukkipati, A.; Bhatnagar, S.; and Murty, M. N. 2007.On measure-theoretic aspects of nonextensive entropy functionals and corresponding maximum entropy prescriptions. Physica A: Statistical Mechanics and its Applications 384(2):758774.
Frank, A., and Asuncion, A. 2010. UCI Machine Learning Repository. University of California, Irvine, School of Information and Computer Sciences: http://archive.ics.uci.edu/ml.
Ghoshdastidar, D.; Dukkipati, A.; and Bhatnagar, S. 2012.q-Gaussian based smoothed functional algorithms for stochastic optimization. In International Symposium on Information Theory. IEEE.
Gradshteyn, I. S., and Ryzhik, I. M. 1994. Table of Integrals, Series and Products (5th ed.). Elsevier.
Gutenberg, B., and Richter, C. F. 1954. Seismicity of the Earth and Associated Phenomena (ed. 2). Princeton, NJ: Princeton University Press.
Havrda, J., and Charvat, F. 1967. Quantification method of classification processes: Concept of structural a-entropy.Kybernetika 3(1):3035.
He, Y.; Hamza, A. B.; and Krim, H. 2003. A generalized divergence measure for robust image registration. IEEE Transactions on Signal Processing 51(5):12111220.
Hofmann, T.; Scholkopf, B.; and Smola, A. J. 2008. Kernel methods in machine learning. Annals of Statistics 36(3):11711220.
Jaynes, E. T. 1957. Information theory and statistical mechanics. The Physical Review 106(4):620630.
Kullback, S. 1959. Information theory and statistics. N.Y.: John Wiley and Sons.
Martins, A. F. T.; Smith, N. A.; Xing, E. P.; Aguiar, P. M. Q.; and Figueiredo, M. A. T. 2009. Nonextensive information theoretic kernels on measures. Journal of Machine Learning Research 10:935975.
Pareto, V. 1906. Manuale di economica politica. Societa Editrice Libraria.
Prato, D., and Tsallis, C. 1999. Nonextensive foundation of Levy distributions. Physical Review E. 60(2):23982401.
Renyi, A. 1960. Some fundamental questions of information theory. MTA III. Oszt. Kozl. 10:251282. (reprinted in (Turan 1976), pp. 526-552).
Sato, A. H. 2010. q-Gaussian distributions and multiplicative stochastic processes for analysis of multiple financial time series. Journal of Physics: Conference Series 201(012008).Scholkopf, B., and Smola, A. J. 2002. Learning with Kernels. MIT Press.
Smola, A. J., and Scholkopf, B. 2004. A tutorial on support vector regression. Statistics and computing 14(3):199222.
Smola, A. J.; Scholkopf, B.; and Muller, K. 1998. The connection between regularization operators and support vector kernels. Neural Networks 11:637649.
Steinwart, I.; Hush, D. R.; and Scovel, C. 2006. An explicit description of the reproducing kernel Hilbert spaces of Gaussian RBF kernels. IEEE Transactions on Information Theory 52(10):46354643.
Suyari, H. 2004. Generalization of Shannon-Khinchin axioms to nonextensive systems and the uniqueness theorem for the nonextensive entropy. IEEE Transactions on Information Theory 50:17831787.
Tsallis, C.; Mendes, R. S.; and Plastino, A. R. 1998. The role of constraints within generalized nonextensive statistics. Physica A: Statistical Mechanics and its Applications 261(3):534554.
Tsallis, C. 1988. Possible generalization of BoltzmannGibbs statistics. Journal of Statiscal Physics 52(1-2):479 487.
Turan, P., ed. 1976. Selected Papers of Alfred Renyi. Budapest: Akademia Kiado.
-----0
R. Baeza-Yates, and B. Ribeiro-Neto. Modern information retrieval, ACM press New York, 1999.
J.C. Borda. Memoire sur les elections au scrutin. Histoire de lAcademie Royale des Sciences, 1781.
E. Candes, X. Li, Y. Ma, and J. Wright. Robust principal component analysis? Journal of the ACM,, 58(1):1-37, 2011.
J. Cai, E. Cande`s, and Z. Shen. A singular value thresholding algorithm for matrix completion. SIAM Journal on Optimization, 20(4):1956-1982, 2010.
C. Dwork, R. Kumar, M. Naor, and D. Sivakumar. Rank aggregation methods for the web. In Proceedings of the 10th international conference on World Wide Web, pages 613622, 2001.
R. Fagin, R. Kumar, and D. Sivakumar. Efficient similarity search and classification via rank aggregation. In Proceedings of the ACM SIGMOD International Conference on Management of data, pages 301-312, 2003.
D. F. Gleich, and L. H. Lim. Rank aggregation via nuclear norm minimization. In Proceedings of the 17th ACM SIGKDD international conference on Knowledge discovery and data mining, pages 60-68, 2011.
K. Jarvelin, and J. Kekalainen. Cumulated gain-based evaluation of ir techniques. ACM Transactions on Information Systems (TOIS), 20(4):422-446, 2002.
A. Klementiev, D. Roth, and K. Small. Unsupervised Rank Aggregation with Distance-Based Models. In Proceedings of the 25th International Conference on Machine Learning, pages 472-479, 2008.
Z. Lin, M. Chen, and Y. Ma. The augmented lagrange multiplier method for exact recovery of corrupted low-rank matrices. arXiv preprint arXiv:1009.5055, 2010.
Y. Liu, T. Liu, T. Qin, Z. Ma, and H. Li. Supervised rank aggregation. In Proceedings of the 16th international conference on World Wide Web, pages 481-490, 2007.
G. Liu, Z. Lin, and Y. Yu. Robust subspace segmentation by low-rank representation. In Proceedings of the 27th International Conference on Machine Learning, pages 663-670, 2010.
R. Liu, Z. Lin, F. Torre, and Z. Su. Fixed-Rank Representation for Unsupervised Visual Learning. In Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition, pages 598-605, 2012.
G. Liu, and S. Yan. Active Subspace: Towards Scalable Low-Rank Learning. Neural Computation, 24(12):33713394, 2012.
R. Manmatha, T. Rath, and F. Feng. Modeling score distributions for combining the outputs of search engines. In Proceedings of the 24th annual international ACM SIGIR conference on Research and Development in Information Retrieval, pages 267-275, 2001.
M. Montague, and J. A. Aslam. Relevance score normalization for metasearch. In Proceedings of the tenth International Conference on Information and Knowledge Management, pages 427-433, 2001.
T. Qin, X. Geng, and T. Liu. A new probabilistic model for rank aggregation. In Proceedings of the Neural Information Processing Systems, pages 681-689, 2010.
T. Qin, T. Liu, J. Xu, and H. Li. Letor: A benchmark collection for research on learning to rank for information retrieval. Information Retrieval, 13(4):346-374, 2010.
A. Rosti, N. Ayan, B. Xiang, S. Matsoukas, R. Schwartz, and B. Dorr. Combining outputs from multiple machine translation systems. In Proceedings of the Human Language Technologies and the North American Chapter of the Association for Computational Linguistics, pages 228-235, 2007.
G. N. Ye, D. Liu, I. H. Jhuo, and S.F. Chang. Robust Late Fusion with Rank Minimization. In Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition, pages 3021-3028, 2012.
-----0
Caruana, R. 1997. Multitask learning. Machine Learning 28(1):41-75.
Ando, R. K., and Zhang, T. 2005. A framework for learning predictive structures from multiple tasks and unlabeled data.Journal of Machine Learning Research 6:1817-1853.
Argyriou, A.; Evgeniou, T.; and Pontil, M. 2006. Multi-task feature learning. In NIPS, 41-48.
Micchelli, C. A., and Pontil, M. 2004. Kernels for multi-task learning. In NIPS.Micchelli, C. A., and Pontil, M. 2005. Learning multiple tasks with kernel methods. Journal of Machine Learning Research 6:615-637.Gu, Q., and Zhou, J. 2009. Learning the shared subspace for multi-task clustering and transductive transfer classification.In ICDM, 159-168.Gu, Q.; Li, Z.; and Han, J. 2011. Learning a kernel for multi-task clustering. In AAAI, 368-373.
Zhang, J., and Zhang, C. 2010. Multitask Bregman clustering. In AAAI, 655-660.
Girolami, M. 2002. Mercer kernel-based clustering in feature space. IEEE Transactions on Neural Networks 13:780784.
Rubner, Y.; Tomasi, C.; and Guibas, L. 1998. A metric for distributions with applications to image databases. In ICCV, 59-66.
Nielsen, F., and Nock, R. 2009. Sided and symmetrized Bregman centroids. IEEE Transactions on Information Thoery 55(6):2882-2904.
Saunders, C.; Stitson, M. O.; Weston, J.; Bottou, L.; Scho lkopf, B.; and Smola, A. 1998. Support vector machine reference manual. Technical Report, CSD-TR-98-03, Dept.of Computer Science, Royal Holloway College.
Gordon, A. D., and Henderson, J. T. 1977. An algorithm for Euclidean sum-of-squares classification. Biometrics 33:355362.
Boyd, S., and Vandenberghe, L. 2004. Convex optimization.Cambridge, UK: Cambridge University Press.
Ding, C. H.; Li, T.; and Jordan, M. I. 2008. Convex and semi-nonnegative matrix factorizations. IEEE Transactions on Pattern Analysis and Machine Intelligence 99(1):45-55.
Xu, W.; Liu, X.; and Gong, Y. 2003. Document clustering based on non-negative matrix factorization. In SIGIR, 267273.
Zhong, S., and Ghosh, J. 2003. A unified framework for model for model-based clustering. Journal of Machine Learning Research 4:1001-1037.
-----0
Bach, F. R., and Jordan, M. I. 2005. A probabilistic interpretation of canonical correlation analysis. Technical Report 688, Department of Statistics, University of California, Berkeley.
Blei, D. M.; Ng, A. Y.; and Jordan, M. I. 2003. Latent Dirichlet allocation. Journal of Machine Learning Research 3:9931022.
Boyd-Graber, J., and Blei, D. 2009. Multilingual topic models for unaligned text. In Proceedings of the Twenty-Fifth Conference on Uncertainty in Artificial Intelligence, 7582.AUAI Press.
Chang, C., and Lin, C. 2011. LIBSVM: a library for support vector machines. ACM Transactions on Intelligent Systems and Technology (TIST) 2(3):27.
Djuric, N.; Grbovic, M.; and Vucetic, S. 2012. Convex kernelized sorting. In Twenty-Sixth AAAI Conference on Artificial Intelligence.
Haghighi, A.; Liang, P.; Berg-Kirkpatrick, T.; and Klein, D.2008. Learning bilingual lexicons from monolingual corpora. In Proceedings of ACL-08: HLT, 771779.
Hardoon, D. R.; Szedmak, S.; and Shawe-Taylor, J. 2004.Canonical correlation analysis: an overview with application to learning methods. Neural Computation 16(12):2639 2664.
Harel, M., and Mannor, S. 2011. Learning from multiple outlooks. In Getoor, L., and Scheffer, T., eds., Proceedings of the 28th International Conference on Machine Learning, ICML 11, 401408.
Hubert, L., and Arabie, P. 1985. Comparing partitions. Journal of Classification 2(1):193218.
Iwata, T.; Mochihashi, D.; and Sawada, H. 2010. Learning common grammar from multilingual corpus. In Proceedings of 48th Annual Meeting of the Association for Computational Linguistics, 184188. Association for Computational Linguistics.
Jagarlamudi, J.; Juarez, S.; and Daume III, H. 2010. Kernelized sorting for natural language processing. In AAAI 10: Proceedings of the 24th AAAI Conference on Artificial Intelligence.
Kimura, A.; Kameoka, H.; Sugiyama, M.; Nakano, T.; Maeda, E.; Sakano, H.; and Ishiguro, K. 2010. SemiCCA: Efficient semi-supervised learning of canonical correlations.
In Proceedings of IAPR International Conference on Pattern Recognition, ICPR 10, 29332936.
Klami, A. 2012. Variational Bayesian matching. In Proceedings of Asian Conference on Machine Learning, 205220.
Lawrence, N. D., and Urtasun, R. 2009. Non-linear matrix factorization with Gaussian processes. In Proceedings of the 26th Annual International Conference on Machine Learning, ICML 09, 601608.
Li, B.; Yang, Q.; and Xue, X. 2009. Transfer learning for collaborative filtering via a rating-matrix generative model.
In Proceedings of the 26th Annual International Conference on Machine Learning, ICML 09, 617624.
Nocedal, J. 1980. Updating quasi-Newton matrices with limited storage. Mathematics of computation 35(151):773 782.
Quadrianto, N.; Smola, A. J.; Song, L.; and Tuytelaars, T.2010. Kernelized sorting. IEEE Trans. on Pattern Analysis and Machine Intelligence 32(10):18091821.
Rai, P., and Daume III, H. 2009. Multi-label prediction via sparse infinite CCA. In Advances in Neural Information Processing Systems, volume 22, 15181526.
Rasmussen, C. 2000. The infinite Gaussian mixture model. Advances in neural information processing systems 12(5.2):2.
Sethuraman, J. 1994. A constructive definition of Dirichlet priors. Statistica Sinica 4:639650.
Shi, X.; Liu, Q.; Fan, W.; Yu, P. S.; and Zhu, R. 2010.Transfer learning on heterogenous feature spaces via spectral transformation. In Proceedings of the IEEE International Conference on Data Mining, ICDM 10, 10491054.
Socher, R., and Fei-Fei, L. 2010. Connecting modalities: Semi-supervised segmentation and annotation of images using unaligned text corpora. In Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition, CVPR, 966973.
Sun, L.; Ji, S.; and Ye, J. 2011. Canonical correlation analysis for multilabel classification: A least-squares formulation, extensions, and analysis. IEEE Transactions on Pattern Analysis and Machine Intelligence 33:194200.
Tipping, M., and Bishop, C. 1999. Mixtures of probabilistic principal component analyzers. Neural Computation 11(2):443482.
Tripathi, A.; Klami, A.; Ores?ic?, M.; and Kaski, S. 2011.Matching samples of multiple views. Data Min. Knowl. Discov. 23:300321.
Tripathi, A.; Klami, A.; and Virpioja, S. 2010. Bilingual sentence matching using kernel CCA. In MLSP 10: Proceedings of the 2010 IEEE International Workshop on Machine Learning for Signal Processing, 130135.
Wang, C., and Mahadevan, S. 2008. Manifold alignment using Procrustes analysis. In ICML 08: Proceedings of the 25th International Conference on Machine Learning, 1120 1127.
Wang, C., and Mahadevan, S. 2009. Manifold alignment without correspondence. In Proceedings of the 21st International Joint Conference on Artifical Intelligence, IJCAI09, 12731278.
Yamada, M., and Sugiyama, M. 2011. Cross-domain object matching with model selection. In In Proceedings of Fourteenth International Conference on Articial Intelligence and Statistics, AISTATS 11, 807815.
-----0
Arbelaez, P.; Maire, M.; Fowlkes, C.; and Malik, J. 2009. From contours to regions: An empirical evaluation. In CVPR.
Arbelaez, P.; Maire, M.; Fowlkes, C.; and Malik, J. 2011.Contour detection and hierarchical image segmentation.PAMI 33(5):898916.
Bai, X.; Li, Q.; Latecki, L.; Liu, W.; and Tu, Z. 2009. Shape band: A deformable object detection approach. In CVPR.
Barrow, H.; Tenenbaum, J.; Bolles, R.; and Wolf, H. 1977.Parametric correspondence and chamfer matching: two new techniques for image matching. In IJCAI.
Belongie, S.; Malik, J.; and Puzicha, J. 2002. Shape matching and object recognition using shape contexts. PAMI 24(4):509522.
Bhat, P.; Zitnick, C.; Cohen, M.; and Curless, B. 2010. Gradientshop: A gradient-domain optimization framework for image and video filtering. ACM Transactions on Graphics 29(2):10.
Breu, H.; Gil, J.; Kirkpatrick, D.; and Werman, M. 1995.Linear time euclidean distance transform algorithms. PAMI 17(5):529533.
Dalal, N. 2006. Finding People in Images and Videos. Ph.D.Dissertation, Institut National Polytechnique de Grenoble / INRIA Grenoble.
Dollar, P.; Tu, Z.; and Belongie, S. 2006. Supervised learning of edges and object boundaries. In CVPR.
Felzenszwalb, P., and Huttenlocher, D. 2012. Distance transforms of sampled functions. Theory of Computing 8.
Ferrari, V.; Tuytelaars, T.; and Van Gool, L. 2006. Object detection by contour segment networks. In ECCV.
Freeman, W., and Adelson, E. 1991. The design and use of steerable filters. PAMI 13(9):891906.
Hinterstoisser, S.; Cagniart, C.; Ilic, S.; Sturm, P.; Navab, N.; Fua, P.; and Lepetit, V. 2012. Gradient response maps for real-time detection of textureless objects. PAMI 34(5):876 888.
Hsiao, E., and Hebert, M. 2012. Occlusion reasoning for object detection under arbitrary viewpoint. In CVPR.
Lai, K.; Bo, L.; Ren, X.; and Fox, D. 2011. A large-scale hierarchical multi-view rgb-d object dataset. In ICRA.
Lowe, D. 2004. Distinctive image features from scaleinvariant keypoints. IJCV 60(2):91110.
Luo, J., and Guo, C. 2003. Perceptual grouping of segmented regions in color images. Pattern Recognition 36(12):27812792.
Mairal, J.; Leordeanu, M.; Bach, F.; Hebert, M.; and Ponce, J. 2008. Discriminative sparse image models for classspecific edge detection and image interpretation. In ECCV.
Malisiewicz, T., and Efros, A. A. 2011. Ensemble of exemplar-svms for object detection and beyond. In ICCV.
Prasad, M.; Zisserman, A.; Fitzgibbon, A.; Kumar, M.; and Torr, P. 2006. Learning class-specific edges for object detection and segmentation. In CVGIP.
Scheirer, W. J.; Kumar, N.; Belhumeur, P. N.; and Boult, T. E. 2012. Multi-attribute spaces: Calibration for attribute fusion and similarity search. In CVPR.
Shotton, J.; Blake, A.; and Cipolla, R. 2008. Multiscale categorical object recognition using contour fragments. PAMI 30(7):12701281.
Srinivasan, P.; Zhu, Q.; and Shi, J. 2010. Many-to-one contour matching for describing and discriminating object shape. In CVPR.
Sun, M.; Bradski, G.; Xu, B.; and Savarese, S. 2010. Depthencoded hough voting for joint object detection and shape recovery. In ECCV.
Thayananthan, A.; Stenger, B.; Torr, P.; and Cipolla, R.2003. Shape context and chamfer matching in cluttered scenes. In CVPR.Tu, Z. 2005. Probabilistic boosting-tree: Learning discriminative models for classification, recognition, and clustering.In ICCV.
Zhao, D., and Chen, J. 1997. Affine curve moment invariants for shape recognition. Pattern Recognition 30(6):895901.
-----0
Babaioff, M., Lavi, R., and Pavlov, E. 2009. Single-value combinatorial auctions and algorithmic implementation in undominated strategies. J. ACM 56(1).
Bachrach, Y. 2010. Honor among thieves: collusion in multi-unit auctions. In AAMAS, 617624.
Conitzer, V., and Sandholm, T. 2006. Failures of the VCG mechanism in combinatorial auctions and exchanges. In AAMAS06, 521528.
Graham, D., and Marshall, R. 1987. Collusive bidder behavior at single-object second-price and english auctions. Journal of Political Economy 95:579599.
Mansour, Y., Muthukrishnan, S., and Nisan, N. 2012. Doubleclick ad exchange auction. CoRR abs/1204.0535.
McAfee, R., and McMillan, J. 1987. Auctions and bidding.Journal of Economic Literature 25:699738.
Monderer, D., and Tennenholtz, M. 2006. Strong Mediated Equilibrium. In Proceedings of AAAI-06.
Muthukrishnan, S. 2009. Ad exchanges: Research issues.In WINE, 112.
Myerson, R. 1981. Optimal auction design. Mathematics of Operations Research 6:5873.
Rozenfeld, O., and Tennenholtz, M. 2007. Routing Mediators. In Proc. 20th International Joint Conference on Artificial Intelligence.
-----0
Betz, N. E. 1987. Use of discriminant analysis in counseling psychology research. Journal of Counseling Psychology 34(4):393.
Chandola, V.; Banerjee, A.; and Kumar, V. 2009. Anomaly detection: A survey. ACM Computing Surveys 41(3):15:1 15:58.
Dutta, H.; Giannella, C.; Borne, K.; and Kargupta, H. 2007.Distributed top-k outlier detection in astronomy catalogs using the DEMAC system. In Proceedings of the SIAM International Conference on Data Mining.
Ehlmann, B. L.; Mustard, J. F.; Swayze, G. A.; Clark, R. N.; Bishop, J. L.; Poulet, F.; Marais, D. J. D.; Roach, 
L. H.; Milliken, R. E.; Wray, J. J.; Barnouin-Jha, O.; and Murchie, S. L. 2009. Identification of hydrated silicate minerals on Mars using MRO-CRISM: Geologic context near Nili Fossae and implications for aqueous alteration. Journal of Geophysical Research 114(E00D08).doi:10.1029/2009JE003339.
Evett, I. W., and Spiehler, E. J. 1987. Rule induction in forensic science. In KBS in Goverment, 107118. Online Publications.
Frank, A., and Asuncion, A. 2010. UCI machine learning repository. http://archive.ics.uci.edu/ml.
Golub, G. H., and Van Loan, C. F. 1996. Matrix Computations. The Johns Hopkins University Press.
Goodacre, R. 2003. Explanatory analysis of spectroscopic data using machine learning of simple, interpretable rules.Vibrational Spectroscopy 32(2):3345.
He, J., and Carbonell, J. 2007. Nearest-neighbor-based active learning for rare category detection. In In Advances in Neural Information Processing Systems 21, 633640. MIT Press.
He, J., and Carbonell, J. 2009. Prior-free rare category detection. In Proceedings of the SIAM International Conference on Data Mining, 155163.
Hoffmann, H. 2007. Kernel PCA for novelty detection. Pattern Recognition 40(3):863874.
Huang, H.; He, Q.; Chiew, K.; Qian, F.; and Ma, L.2012. CLOVER: a faster prior-free approach to rarecategory detection. Knowledge and Information Systems.doi:10.1007/s10115-012-0530-9.
Langley, P. W.; Simon, H. A.; Bradshaw, G. L.; and Zytkow, J. M. 1987. Scientific Discovery: Computational Explorations of the Creative Process. MIT Press.
Lanza, N. L.; Wiens, R. C.; Clegg, S. M.; Ollila, A. M.; Humphries, S. D.; Newsom, H. E.; and Barefield, J. E. 2010.Calibrating the ChemCam laser-induced breakdown spectroscopy instrument for carbonate minerals on Mars. Applied Optics 49(13):C211C217.
Li, Y. 2004. On incremental and robust subspace learning.Pattern Recognition 37:15091518.
Lim, J.; Ross, D.; Lin, R.-S.; and Yang, M.-H. 2005. Incremental learning for visual tracking. In Advances in Neural Information Processing Systems 17, 793800. MIT Press.
Mitchell, T. M.; Keller, R. M.; and Kedar-Cabelli, S. T.1986. Explanation-based generalization: A unifying view.Machine Learning 1(1):4780.
Murchie, S.; Arvidson, R.; Bedini, P.; Beisser, K.; Bibring, J.; Bishop, J.; Boldt, J.; Cavender, P.; Choo, T.; Clancy, R.; et al. 2007. Compact reconnaissance imaging spectrometer for Mars (CRISM) onMars Reconnaissance Orbiter (MRO).Journal of Geophysical Research 112(10.1029).
Pelleg, D., andMoore, A. 2004. Active learning for anomaly and rare-category detection. In In Advances in Neural Information Processing Systems 18, 10731080. MIT Press.
Shyu, M.-L.; Chen, S.-C.; Sarinnapakorn, K.; and Chang, L.2003. A novel anomaly detection scheme based on principal component classifier. In Proceedings of the IEEE Foundations and New Directions of Data Mining Workshop, 172 179.
Strumbelj, E.; Bosnic, Z.; Kononenko, I.; Zakotnik, B.; and Kuhar, C. G. 2010. Explanation and reliability of prediction models: the case of breast cancer recurrence. Knowledge and Information Systems 24:305324.
Thompson, D.; Mandrake, L.; Gilmore, M.; and Castano, R.2010. Superpixel endmember detection. IEEE Transactions on Geoscience and Remote Sensing 48(11):40234033.
Wiens, R. C.; Maurice, S.; and the ChemCam team. 2011.The ChemCam instrument suite on the Mars Science Laboratory rover Curiosity: Remote sensing by laser-induced plasmas. Geochemical News 145.
-----0
Aguiar, P.; Stosic, M.; and Xavier, J. 2008. Spectrally optimal factorization of incomplete matrices. In CVPR.
Basri, R., and Jacobs, D. 2003. Lambertian reflection and linear subspaces. IEEE Trans. PAMI 25:218233.
Breheny, P., and Huang, J. 2011. Coordinate desent algorithms for nonconvex penalized regression, with applications to biological feature selection. Annals of Applied Statistics 5:232253.
Brownrigg, D. R. K. 1984. The weighted median filter. Commun. Assoc. Comput. Mach. 27.
Buchanan, A. M., and Fitzgibbon, A. W. 2005. Damped newton algorithms for matrix factorization with missing data. In CVPR.
Cande`s, E. J., and Romberg, J. 2005. l1-MAGIC: recovery of sparse signals via convex programming. Technical Report, California Institute of Technology.
Cande`s, E.; Li, X.; Ma, Y.; and Wright, J. 2011. Robust principal component analysis? Journal of the ACM 58.
Cheng, C.; Yang, H.; King, I.; and Lyu, M. R. 2012a. Fused matrix factorization with geographical and social influence in location-based social networks. In AAAI.
Cheng, C.; Yang, H. Q.; King, I.; and Lyu, M. R. 2012b. Fused matrix factorization with geographical and social influence in location-based social networks. In AAAI.
De la Torre, F., and Black, M. J. 2003. A framework for robust subspace learning. IJCV 54:117142.
Deerwester, S.; Dumais, S.; Furnas, G.; Landauer, T.; and Harshman, R. 1990. Indexing by latent semantic analysis. Journal of the American Society for Information Science 41.
Ding, C.; Zhou, D.; He, X.; and Zha, H. 2006. R1-PCA: Rotational invariant l1-norm principal component analysis for robust subspace factorization. In ICML.
Eriksson, A., and van den Hengel, A. 2010. Efficient computation of robust low-rank matrix approximations in the presence of missing data using the l1 norm. In CVPR.
Eriksson, A., and van den Hengel, A. 2012. Efficient computation of robust weighted low-rank matrix approximations using the l1 norm. IEEE Trans. PAMI 34:16811690.
Friedman, J.; Hastie, T.; and Hofling. 2007. Pathwise coordinate optimization. The Annals of Applied Statistics 1:302332.
Friedman, J.; Hastie, T.; and Tibshirani, R. 2010. Regularized paths for generalized linear models via coordinate descent.Journal of Statistical Software 33:122.
Gabriel, K. R., and Zamir, S. 1979. Lower rank approximation of matrices by least squares with any choice of weights. Technometrics 21:489498.
Georghiades, A.; Belhumeur, P.; and Kriegman, D. 2001. From few to many: Illumination cone models for face recognition under variable lighting and pose. IEEE Trans. PAMI 23:643660.
Gillis, N., and Glineur, F. 2011. Low-rank matrix approximation with weights or missing data is NP-hard. SIAM Journal of Matrix Analysis and Applications 32.
Golub, G., and Loan, C. V. 1989. Matrix Computation. Maryland: Johns Hopkins University Press.
Jacobs, D. 1997. Linear fitting with missing data: Applications to structure-from-motion and to characterizing intensity images.In CVPR.
Jeffreys, H., and Jeffreys, B. S. 1988. Methods of Mathematical Physics. Cambridge University Press.
Ji, H.; Liu, C.; Shen, Z.; and Xu, Y. 2010. Robust video denoising using low rank matrix completion. In CVPR.
Ke, Q., and Kanade, T. 2001. A subspace approach to layer extraction. In CVPR.
Ke, Q., and Kanade, T. 2005. Robust l1 norm factorization in the presence of outliers and missing data by alternative convex programming. In CVPR.
Koren, Y. 2008. Factorization meets the neighborhood: A multifaceted collaborative filtering model. In SIGKDD.
Kwak, N. 2008. Principal component analysis based on l1norm maximization. IEEE Trans. PAMI 30:16721680.
Li, W. J., and Yeung, D. Y. 2009. Relation regularized matrix factorization. In IJCAI.
Lin, Z.; Chen, M.; and Ma, Y. 2009. The augmented lagrange multiplier method for exact recovery of corrupted low-Rank matrix. Technical Report UILU-ENG-09-2215.
Luo, D.; Ding, C.; and Huang, H. 2011. Cluster indicator decomposition for efficient matrix factorization. In IJCAI.
Okatani, T., and Deguchi, K. 2007. On the Wiberg algorithm for matrix factorization in the presence of missing components.IJCV 72:329337.
Rauh, A., and Arce, G. R. 2010. A fast weighted median algorithm based on quickselect. In ICIP.
Shum, H.; Ikeuchi, K.; and Reddy, R. 1995. Principal component analysis with missing data and its application to polyhedral object modeling. IEEE Trans. PAMI 17:855867.
Sinha, A. 2010. Topics in the analysis of sparse and irregularly spaced time dependent gene expression data. Columbia University, Doctoral Dissertation.
Srebro, N., and Jaakkola, T. 2003. Weighted low-rank approximations. In ICML.
Strelow, D. 2012. General and nested Wiberg minimization. In CVPR.
Sturm, P. 2000. Algorithms for plane-based pose estimation. In CVPR.
Tomasi, C., and Kanade, T. 1992. Shape and motion from image streams under orthography: A factorization method. IJCV 9:137154.
Tseng, P. 2001. Convergence of a block coordinate descent method for nondifferentiable minimization. Journal of Optimization Theory and Applications 109:475494.
Turk, M., and Pentland, A. 1991. Eigenfaces for recognition.Journal of Cognitive Neuroscience 3:7186.
Wright, J.; Peng, Y.; Ma, Y.; Ganesh, A.; and Rao, S. 2009. Robust principal component analysis: Exact recovery of corrupted low-rank matrices by convex optimization. In NIPS.
-----0
Cantrell, R.; Scheutz, M.; Schermerhorn, P.; and Wu, X. 2010. Robust spoken instruction understanding for HRI. In Proceedings of the 2010 Human-Robot Interaction Conference.
Chen, D. L., and Mooney, R. J. 2001. Learning to interpret natural language navigation instructions from observations. In Proceedings of the 25th AAAI Conference on Artificial Intelligence.
Hawes, N.; Hanheide, M.; Hargreaves, J.; Page, B.; Zender, H.; and Jensfelt, P. 2011. Home alone: Autonomous extension and correction of spatial representations. In Robotics and Automation (ICRA), 2011 IEEE International Conference on, 3907 3914.
Hemachandra, S.; Kollar, T.; Roy, N.; and Teller, S. 2011.Following and interpreting narrated guided tours. In Proceedings of the IEEE International Conference on Robotics and Automation.
Kollar, T.; Tellex, S.; Roy, D.; and Roy, N. 2010. Toward understanding natural language directions. In Proceeding of the 5th ACM/IEEE international conference on Humanrobot interaction, HRI 10, 259266. New York, NY, USA: ACM.
Kruijff, G.-J. M.; Zender, H.; Jensfelt, P.; and Christensen, H. I. 2007. Situated dialogue and spatial organization: What, where... and why? International Journal of Advanced Robotic Systems 4:125138.
Kuipers, B. 2000. The spatial semantic hierarchy. Artificial Intelligence 119:191233.
Matuszek, C.; Herbst, E.; Zettlemoyer, L.; and Fox, D. 2012.Learning to parse natural language commands to a robot control system. In Proc. of the 13th Intl Symposium on Experimental Robotics (ISER).
Matuszek, C.; Fox, D.; and Koscher, K. 2010. Following directions using statistical machine translation. In Proceeding of the 5th ACM/IEEE international conference on Humanrobot interaction, HRI 10, 251258. New York, NY, USA: ACM.
Moratz, R., and Tenbrink, T. 2006. Spatial reference in linguistic human-robot interaction. Spatial Cognition and Computation 63  106.
Moratz, R.; Tenbrink, T.; Bateman, J.; and Fischer, K. 2003.Spatial knowledge representation for human-robot interaction. In Freksa, C.; Brauer, W.; Habel, C.; and Wender, K. F., eds., Spatial cognition III. Berlin, Heidelberg: SpringerVerlag. 263286.
Scheutz, M.; Schermerhorn, P.; Kramer, J.; and Anderson, D. 2007. First steps toward natural human-like HRI. Autonomous Robots 22(4):411423.Shimizu, N., and Haas, A. 2009. Learning to follow navigational route instructions. In Proceedings of the 21st international jont conference on Artifical intelligence, 1488 1493. San Francisco, CA, USA: Morgan Kaufmann Publishers Inc.
Stopp, E.; Gapp, K.-P.; Herzog, G.; Laengle, T.; and Lueth, T. C. 1994. Utilizing spatial relations for natural language access to an autonomous mobile robot.
Tellex, S.; Kollar, T.; Dickerson, S.; Walter, M. R.; Berjee, A. G.; Teller, S.; and Roy, N. 2011. Understanding natural language commands for robotic navigation and mobile manipulation. In AAAI11.
Zender, H.; Kruijff, G.-J. M.; and Kruijff-Korbayova, I.2009. Situated resolution and generation of spatial referring expressions for robotic assistants. In Proceedings of the 21st international jont conference on Artifical intelligence, 
IJCAI09, 16041609. San Francisco, CA, USA: Morgan Kaufmann Publishers Inc.
-----0
Batista, G. E. A. P. A., and Monard, M. C. 2003. An analysis of four missing data treatment methods for supervised learning. Applied Artificial Intelligence 17(5-6):519533.
Biskup, J., and Link, S. 2012. Appropriate inferences of data dependencies in relational databases. Ann. Math. Artif.Intell. 63(3-4):213255.
Biskup, J.; Hartmann, S.; and Link, S. 2012. Probabilistic conditional independence under schema certainty and uncertainty. In SUM, 365378.
Biskup, J. 1980. Inferences of multivalued dependencies in fixed and undetermined universes. Theor. Comput. Sci.10(1):93106.
Chickering, D. M., and Heckerman, D. 1997. Efficient approximations for the marginal likelihood of Bayesian networks with hidden variables. Machine Learning 29(23):181212.
Darwiche, A. 2009. Modeling and Reasoning with Bayesian Networks. Cambridge University Press.
Dawid, A. P. 1979. Conditional independence in statistical theory. Journal of the Royal Statistical Society. Series B (Methodological) 41(1):131.
de Waal, P. R., and van der Gaag, L. C. 2005. Stable independence in perfect maps. In UAI, 161168.
Dempster, A.; Laird, N. M.; and Rubin, D. 1977. Maximum likelihood from incomplete data via the EM algorithm. Journal of the Royal Statistical Society B 39:139.
Fayyad, U. M.; Piatetsky-Shapiro, G.; and Smyth, P. 1996.From data mining to knowledge discovery in databases. AI Magazine 17(3):3754.
Friedman, N. 1997. Learning belief networks in presence of missing values and hidden variables. In ICML, 125133.
Galil, Z. 1982. An almost linear-time algorithm for computing a dependency basis in a relational database. J. ACM 29(1):96102.
Geiger, D., and Pearl, J. 1990. Logical and algorithmic properties of independence and their application to Bayesian networks. Ann. Math. Artif. Intell. 2:165178.
Geiger, D., and Pearl, J. 1993. Logical and algorithmic properties of conditional independence and graphical models. The Annals of Statistics 21(4):20012021.
Halpern, J. 2005. Reasoning about uncertainty. MIT Press.Hartmann, S., and Link, S. 2012. The implication problem of data dependencies over SQL table definitions. ACM Trans. Database Syst. 37(2):Article 13.
Hartmann, S.; Link, S.; and Schewe, K.-D. 2004. Reasoning about functional and multi-valued dependencies in the presence of lists. In FoIKS, 134154.
Lauritzen, S. 1995. The EM algorithm for graphical association models with missing data. Computational Statistics and Data Analysis 19:191201.
Levesque, H. 1989. A knowledge-level account of abduction. In IJCAI, 10611067.
Lien, E. 1982. On the equivalence of database models. J.ACM 29(2):333362.
Link, S. 2006. On the logical implication of multivalued dependencies with null values. In CATS, 113122.
Link, S. 2008. On the implication of multivalued dependencies in partial database relations. Int. J. Found. Comput. Sci.19(3):691715.
Link, S. 2012a. Characterizations of multivalued dependency implication over undetermined universes. J. Comput.Syst. Sci. 78(4):10261044.
Link, S. 2012b. Propositional reasoning about saturated conditional independence. In WoLLIC, 257267.
Lou, Q., and Obradovic, Z. 2012. Margin-based feature selection in incomplete data. In AAAI, 10401046.
Malvestuto, F. 1992. A unique formal system for binary decompositions of database relations, probability distributions, and graphs. Inf. Sci. 59(1-2):2152.
Marlin, B. M.; Zemel, R. S.; Roweis, S. T.; and Slaney, M.2011. Recommender systems, missing data and statistical model estimation. In IJCAI, 26862691.
Matus?, F. 1992. Ascending and descending conditional independence relations. In Transactions of the 11th Prague Conference on Information Theory, 189200.
Niepert, M.; Van Gucht, D.; and Gyssens, M. 2008. On the conditional independence implication problem: A latticetheoretic approach. In UAI, 435443.
Niepert, M.; Van Gucht, D.; and Gyssens, M. 2010. Logical and algorithmic properties of stable conditional independence. Int. J. Approx. Reasoning 51(5):531543.
Pearl, J., and Verma, T. 1991. A statistical semantics for causation. Statistics and Computing 2:9195.
Pearl, J. 1988. Probabilistic Reasoning in Intelligent Systems: Networks of Plausible Inference. San Franciso, U.S.A.: Morgan Kaufmann.
Saar-Tsechansky, M., and Provost, F. J. 2007. Handling missing values when applying classification models. Journal of Machine Learning Research 8:16231657.
Sagiv, Y.; Delobel, C.; Parker Jr., D. S.; and Fagin, R. 1981.An equivalence between relational data dependencies and a fragment of propositional logic. J. ACM 28(3):435453.
Singh, M. 1997. Learning Bayesian networks from incomplete data. In AAAI/IAAI, 534539.
Studeny, M. 1992. Conditional independence relations have no finite complete characterization. In Transactions of the 11th Prague Conference on Information Theory, 377396.
Tian, J., and Pearl, J. 2000. Probabilities of causation: Bounds and identification. Ann. Math. Artif. Intell. 28(14):287313.
Zhang, S.; Jin, Z.; and Zhu, X. 2011. Missing data imputation by utilizing information within incomplete instances.Journal of Systems and Software 84(3):452459.
Zhu, X.; Zhang, S.; Zhang, J.; and Zhang, C. 2007. Costsensitive imputing missing values with ordering. In AAAI, 19221923.
-----0
Amini, M.; Usunier, N.; and Goutte, C. 2009. Learning from multiple partially observed views an application to multilingual text categorization. In Advances in Neural Information Processing Systems (NIPS).
Argyriou, A.; Evgeniou, T.; and Pontil, M. 2006. Multitask feature learning. In Advances in Neural Information Processing Systems (NIPS).
Bach, F.; Mairal, J.; and Ponce, J. 2008. Convex sparse matrix factorizations. arXiv:0812.1869v1.
Bickel, S., and Scheffer, T. 2004. Multi-view clustering.In Proceedings of IEEE International Conference on Data Mining (ICDM).
Blum, A., and Mitchell, T. 1998. Combing labeled and unlabeled dta with co-training. In Proceedings of Annual Conference on Learning Theory (COLT).
Boyd, S., and Vandenberghe, L. 2004. Convex Optimization.Cambridge University Press.
C. Christoudias, R. U., and Darrell, T. 2008. Multi-view learning in the presence of view disagreement. In Proceedings of Conference on Uncertainty in Artificial Intelligence (UAI).
Chaudhuri, K.; Kakade, S.; Livescu, K.; and Sridharan, K.2009. Multi-view clustering via canonical correlation analysis. In Proceedings of International Conference on Machine Learning (ICML).
Collins, M., and Singer, Y. 1999. Unsupervised models for named entity classification. In Proceedings of Conference on Empirical Methods in Natural Language Processing (EMNLP).
Dasgupta, S.; Littman, M.; and McAllester, D. 2001. PAC generalization bounds for co-training. In Advances in Neural Information Processing Systems (NIPS).de Sa, V. 2005. Spectral clustering with two views. In Workshop on Learning with Multiple Views, ICML.
Grave, E.; Obozinski, G.; and Bach, F. 2011. Trace lasso: a trace norm regularization for correlated designs. In Advances in Neural Information Processing Systems (NIPS).
Guo, Y., and Xiao, M. 2012. Cross language text classification via subspace co-regularized multi-view learning. In Proceedings of International Conference on Machine Learning (ICML).
Kiwiel, K. C. 1990. Proximity control in bundle methods for convex nondifferentiable minimization. Mathematical Programming 46:105122.
Kumar, A., and Daume III, H. 2011. A co-training approach for multi-view spectral clustering. In Proceedings of International Conference on Machine Learning (ICML).
Kumar, A.; Rai, P.; and Daume III, H. 2011. Co-regularized multi-view spectral clustering. In Advances in Neural Information Processing Systems (NIPS).
Rockafellar, R. 1970. Convex Analysis. Princeton University Press.
Sindhwani, V., and Rosenberg, D. 2008. An RKHS for multi-view learning and manifold co-regularization. In Proceedings of International Conference on Machine Learning (ICML).
Sridharan, K., and Kakade, S. 2008. An information theoretic framework for multi-view learning. In Proceedings of Annual Conference on Learning Theory (COLT).
White, M.; Yu, Y.; Zhang, X.; and Schuurmans, D. 2012.Convex multi-view subspace learning. In Advances in Neural Information Processing Systems (NIPS).
Zhang, X.; Yu, Y.; White, M.; Huang, R.; and Schuurmans, D. 2011. Convex sparse coding, subspace learning, and semi-supervised extensions. In Proceedings of the AAAI Conference on Artificial Intelligence (AAAI).
Zhou, D., and Burges, C. 2007. Spectral clustering and tranductive learning with multiple views. In Proceedings of International Conference on Machine Learning (ICML).
-----0
Barzilay, R., and Lapata, M. 2008. Modeling local coherence: An entity-based approach. Computational Linguistics 34(1):134.
Barzilay, R., and Lee, L. 2004. Catching the drift: Probabilistic content models, with applications to generation and summarization. In Susan Dumais, D. M., and Roukos, S., eds., HLT-NAACL 2004: Main Proceedings, 113120.
Blei, D. M.; Ng, A. Y.; Jordan, M. I.; and Lafferty, J. 2003.Latent dirichlet allocation. Journal of Machine Learning Research 3:9931022.
Clark, J. H.; Dyer, C.; Lavie, A.; and Smith, N. A. 2011.Better hypothesis testing for statistical machine translation: Controlling for optimizer instability. In Proceedings of the 49th Annual Meeting of the Association for Computational Linguistics: Human Language Technologies, 176181.
de Beaugrande, R.-A., and Dressler, W. 1981. Introduction to Text Linguistics.Doddington, G. 2002. Automatic evaluation of machine translation quality using n-gram co-occurrence statistics. In Proceedings of the second international conference on Human Language Technology Research, HLT 02, 138145.
Fung, P., and Ngai, G. 2006. One story, one flow: Hidden markov story models for multilingual multidocument summarization. ACM Transactions on Speech and Language Processing 3(2):116.
Galley, M.; Graehl, J.; Knight, K.; Marcu, D.; DeNeefe, S.; Wang, W.; and Thayer, I. 2006. Scalable inference and training of context-rich syntactic translation models. In Proceedings of the 21st International Conference on Computational Linguistics and 44th Annual Meeting of the Association for Computational Linguistics, 961968.
Gong, Z.; Zhang, M.; and Zhou, G. 2011. Cache-based document-level statistical machine translation. In Proceedings of the 2011 Conference on Empirical Methods in Natural Language Processing, 909919.
Gruber, A.; Rosen-zvi, M.; and Weiss, Y. 2007. Hidden topic markov models. In In Proceedings of Artificial Intelligence and Statistics.
Hardmeier, C.; Nivre, J.; and Tiedemann, J. 2012.Document-wide decoding for phrase-based statistical machine translation. In Proceedings of the 2012 Joint Conference on Empirical Methods in Natural Language Processing and Computational Natural Language Learning, 1179 1190.
Koehn, P.; Och, F. J.; and Marcu, D. 2003. Statistical phrasebased translation. In Proceedings of the 2003 Human Language Technology Conference of the North American Chapter of the Association for Computational Linguistics, 5854.
Lin, Z.; Ng, H. T.; and Kan, M.-Y. 2011. Automatically evaluating text coherence using discourse relations. In Proceedings of the 49th Annual Meeting of the Association for Computational Linguistics: Human Language Technologies, 9971006.
Louis, A., and Nenkova, A. 2012. A coherence model based on syntactic patterns. In Proceedings of the 2012 Joint Conference on Empirical Methods in Natural Language Processing and Computational Natural Language Learning, 11571168.
Mimno, D.; Wallach, H. M.; Naradowsky, J.; Smith, D. A.; and McCallum, A. 2009. Polylingual topic models. In Proceedings of the 2009 Conference on Empirical Methods in Natural Language Processing, 880889.
Och, F. J. 2003. Minimum error rate training in statistical machine translation. In Proceedings of the 41st Annual Meeting of the Association for Computational Linguistics, 160167. Sapporo, Japan: Association for Computational Linguistics.
Papineni, K.; Roukos, S.; Ward, T.; and Zhu, W.-J. 2002.Bleu: a method for automatic evaluation of machine translation. In Proceedings of 40th Annual Meeting of the Association for Computational Linguistics, 311318.
Stolcke, A. 2002. Srilman extensible language modeling toolkit. In Proceedings of the 7th International Conference on Spoken Language Processing, 901904.
Su, J.; Wu, H.; Wang, H.; Chen, Y.; Shi, X.; Dong, H.; and Liu, Q. 2012. Translation model adaptation for statistical machine translation with monolingual topic information.
In Proceedings of the 50th Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers), 459468.
Tiedemann, J. 2010. To cache or not to cache? experiments with adaptive models in statistical machine translation. In Proceedings of the Joint Fifth Workshop on Statistical Machine Translation and MetricsMATR, 189194.
Wu, D. 1997. Stochastic inversion transduction grammars and bilingual parsing of parallel corpora. Computational Linguistics 23(3):377403.
Xiao, X.; Xiong, D.; Zhang, M.; Liu, Q.; and Lin, S. 2012.A topic similarity model for hierarchical phrase-based translation. In Proceedings of the 50th Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers), 750758.
Xiong, D.; Liu, Q.; and Lin, S. 2006. Maximum entropy based phrase reordering model for statistical machine translation. In Proceedings of the 21st International Conference on Computational Linguistics and 44th Annual Meeting of the Association for Computational Linguistics, 521528.
Zhao, B., and Xing, E. P. 2006. Bitam: Bilingual topic admixture models for word alignment. In Proceedings of the COLING/ACL 2006 Main Conference Poster Sessions, 969 976.
-----0
Blackburn, P., and Bos, J. 2005. Representation and inference for natural language: A first course in computational semantics.
Chiang, D. 2007. Hierarchical phrase-based translation.Computational Linguistics 33(2):201228.
DeNero, J.; Bansal, M.; Pauls, A.; and Klein, D. 2009. Efficient parsing for transducer grammars. In Proceedings of NAACL HLT 2009, 227235.
Galley, M.; Hopkins, M.; Knight, K.; and Marcu, D. 2004.Whats in a translation rule? In Proceedings of HLT/NAACL04, 273280.
Galley, M.; Graehl, J.; Knight, K.; Marcu, D.; DeNeefe, S.; Wang, W.; and Thayer, I. 2006. Scalable inference and training of context-rich syntactic translation models. In Proceedings of COLINGACL 2006, 961968.
Ge, R., and Mooney, R. 2005. A statistical semantic parser that integrates syntax and semantics. In Proceedings of CoNLL-2005, 916.
Jones, B.; Johnson, M.; and Goldwater, S. 2011. Formalizing semantic parsing with tree transducers. In Proceedings of ALTA Workshop 2011, 1928.
Jones, B.; Johnson, M.; and Goldwater, S. 2012. Semantic parsing with bayesian tree transducers. In Proceedings of ACL 2012, 488496.
Kate, R. J., and Mooney, R. J. 2006. Using string-kernels for learning semantic parsers. In Proceedings of COLINGACL 2006, 913920.
Kate, R. J.; Wong, Y. W.; and Mooney, R. J. 2005. Learning to transform natural to formal languages. In Proceedings of AAAI-05, 10621068.
Kwiatkowski, T.; Zettlemoyer, L.; Goldwater, S.; and Steedman, M. 2010. Inducing probabilistic CCG grammars from logical form with higher-order unification. In Proceedings of EMNLP 2010, 12231233.
Liu, Y.; Liu, Q.; and Lin, S. 2006. Tree-to-string alignment template for statistical machine translation. In Proceedings of COLINGACL 2006, 609616.
Liu, Y.; Liu, Q.; and Lu, Y. 2011. Adjoining tree-to-string translation. In Proceedings of ACL HLT 2011, 12781287.
Liu, Y.; Lu, Y.; and Liu, Q. 2009. Improving tree-to-tree translation with packed forests. In Proceedings of ACLIJCNLP 2009, 558566.
Lu, W., and Ng, H. T. 2011. A probabilistic forest-to-string model for language generation from typed lambda calculus expressions. In Proceedings of EMNLP 2011, 16111622.
Lu, W.; Ng, H. T.; Lee, W. S.; and Zettlemoyer, L. S. 2008.A generative model for parsing natural language to meaning representations. In Proceedings of EMNLP 2008, 783792.
Mi, H., and Huang, L. 2008. Forest-based translation rule extraction. In Proceedings of EMNLP 2008, 206214.
Och, F. J., and Ney, H. 2002. Discriminative training and maximum entropy models for statistical machine translation.In Proceedings of ACL 2002, 295302.
Och, F. J., and Ney, H. 2003. A systematic comparison of various statistical alignment models. Computational Linguistics 29(1):1951.
Tang, L., and Mooney, R. 2001. Using multiple clause constructors in inductive logic programming for semantic parsing. 466477.
Wong, Y. W., and Mooney, R. J. 2006. Learning for semantic parsing with statistical machine translation. In Proceedings of HLT-NAACL 2006, 439446.
Wong, Y. W., and Mooney, R. J. 2007. Learning synchronous grammars for semantic parsing with lambda calculus. In Proceedings of ACL 2007, 960967.
Wu, X.; Matsuzaki, T.; and Tsujii, J. 2010. Fine-grained tree-to-string translation rule extraction. In Proceedings of ACL 2010, 325334.
Zelle, J. M., and Mooney, R. J. 1996. Learning to parse database queries using inductive logic programming. In Proceedings of AAAI-96, 10501055.
Zettlemoyer, L. S., and Collins, M. 2005. Learning to map sentences to logical form: Structured classification with probabilistic categorial grammars. In Proceedings of UAI05, 658666.
Zettlemoyer, L., and Collins, M. 2007. Online learning of relaxed CCG grammars for parsing to logical form. In Proceedings of EMNLP-CoNLL 2007, 678687.
Zhang, H.; Fang, L.; Xu, P.; and Wu, X. 2011. Binarized forest to string translation. In Proceedings of ACL HLT 2011, 835845.
-----0
Abou-Moustafa, K., and Ferrie, F. 2012. A note on metric properties for some divergence measures: The Gaussian case. The Journal of Machine Learning Research 25:115.
Ali, S., and Shah, M. 2010. Human action recognition in videos using kinematic features and multiple instance learning. IEEE Transactions on Pattern Analysis and Machine Intelligence 32(2):288303.
Chai, K. 2012. Variational multinomial logit Gaussian process. The Journal of Machine Learning Research 98888:17451808.
Chan, A.; Vasconcelos, N.; and Moreno, P. 2004. A family of probabilistic kernels based on information divergence. Univ. California, San Diego, CA, Tech. Rep. SVCLTR-2004-1.
Cichocki, A.; Zdunek, R.; Phan, A. H.; and Amari, S. I.2009. Nonnegative Matrix and Tensor Factorizations. John Wiley & Sons.
De Sterck, H. 2012. A nonlinear GMRES optimization algorithm for canonical tensor decomposition. SIAM Journal on Scientific Computing 34(3):13511379.
Endres, D., and Schindelin, J. 2003. A new metric for probability distributions. IEEE Transactions on Information Theory 49(7):18581860.
Girolami, M., and Rogers, S. 2006. Variational Bayesian multinomial probit regression with Gaussian process priors.Neural Computation 18(8):17901817.
Guha, T., and Ward, R. 2012. Learning sparse representations for human action recognition. IEEE Transactions on Pattern Analysis and Machine Intelligence 34(8):1576 1588.
Holte, M.; Chakraborty, B.; Gonzalez, J.; and Moeslund, T.2012. A local 3-D motion descriptor for multi-view human action recognition from 4-D spatio-temporal interest points. IEEE Journal of Selected Topics in Signal Processing 6(5):553565.
Kersting, K., and Xu, Z. 2009. Learning preferences with hidden common cause relations. In Machine Learning and Knowledge Discovery in Databases. Springer. 676691.
Kim, T., and Cipolla, R. 2009. Canonical correlation analysis of video volume tensors for action categorization and detection. IEEE Transactions on Pattern Analysis and Machine Intelligence 31(8):14151428.
Kim, H., and Ghahramani, Z. 2006. Bayesian Gaussian process classification with the EM-EP algorithm. IEEE Transactions on Pattern Analysis and Machine Intelligence 28(12):19481959.
Kolda, T., and Bader, B. 2009. Tensor decompositions and applications. SIAM Review 51(3):455500.
Lui, Y.; Beveridge, J.; and Kirby, M. 2010. Action classification on product manifolds. In 2010 IEEE Conference on Computer Vision and Pattern Recognition (CVPR), 833 839. IEEE.
Moreno, P.; Ho, P.; and Vasconcelos, N. 2003. A KullbackLeibler divergence based kernel for SVM classification in multimedia applications. Advances in Neural Information Processing Systems 16:13851393.
Nickisch, H., and Rasmussen, C. 2008. Approximations for binary Gaussian process classification. Journal of Machine Learning Research 9:20352078.
Niebles, J.; Wang, H.; and Fei-Fei, L. 2008. Unsupervised learning of human action categories using spatial-temporal words. International Journal of Computer Vision 79(3):299 318.
Rasmussen, C., and Williams, C. 2006. Gaussian processes for machine learning. The MIT Press, Cambridge, MA, USA.
Riihimaki, J.; Jylanki, P.; and Vehtari, A. 2012. Nested expectation propagation for Gaussian process classification with a multinomial probit likelihood. arXiv preprint arXiv:1207.3649.
Saatci, Y. 2011. Scalable Inference for Structured Gaussian Process Models. Ph.D. Dissertation, University of Cambridge.
Schuldt, C.; Laptev, I.; and Caputo, B. 2004. Recognizing human actions: A local SVM approach. In Proceedings of the 17th International Conference on Pattern Recognition, ICPR, volume 3, 3236. IEEE.
Signoretto, M.; De Lathauwer, L.; and Suykens, J. A. 2011.A kernel-based framework to tensorial data analysis. Neural networks 24(8):861874.
Song, Y.; Zheng, Y.; Tang, S.; Zhou, X.; Zhang, Y.; Lin, S.; and Chua, T. 2011. Localized multiple kernel learning for realistic human action recognition in videos. IEEE Transactions on Circuits and Systems for Video Technology 21(9):11931202.
Tsuda, K.; Akaho, S.; Kawanabe, M.; and Muller, K. 2004.Asymptotic properties of the Fisher kernel. Neural Computation 16(1):115137.
Williams, C., and Barber, D. 1998. Bayesian classification with Gaussian processes. IEEE Transactions on Pattern Analysis and Machine Intelligence 20(12):13421351.
Wong, S.; Kim, T.; and Cipolla, R. 2007. Learning motion categories using both semantic and structural information.In Computer Vision and Pattern Recognition. CVPR07, 1 6. IEEE.
Xu, Z.; Yan, F.; and Qi, Y. 2012. Infinite Tucker decomposition: Nonparametric Bayesian models for multiway data analysis. In Proceedings of the 29 th International Conference on Machine Learning. ACM.
Zhang, T.; Liu, J.; Liu, S.; Xu, C.; and Lu, H. 2011. Boosted exemplar learning for action recognition and annotation.
IEEE Transactions on Circuits and Systems for Video Technology 21(7):853866.
-----0
Abreu, R., and Van Gemund, A. 2009. A low-cost approximate minimal hitting set algorithm and its application to model-based diagnosis. In Proceedings of the 8th Symposium on Abstraction, Reformulation, and Approximation, SARA09.
Abreu, R., and Van Gemund, A. 2010. Diagnosing multiple intermittent failures using maximum likelihood estimation.
Artificial Intelligence 174(18):14811497.Abreu, R.; Zoeteweij, P.; and Van Gemund, A. 2007. On the accuracy of spectrum-based fault localization. In Testing: Academic and Industrial Conference Practice and Research Techniques, TAICPART07, 8998.
Abreu, R.; Zoeteweij, P.; and Van Gemund, A. 2008a. A dynamic modeling approach to software multiple-fault localization. In Proceedings of the 19th International Workshop on Principles of Diagnosis, DX08, 714.
Abreu, R.; Zoeteweij, P.; and Van Gemund, A. 2008b. An observation-based model for fault localization. In Proceedings of the 6th Workshop on Dynamic Analysis, WODA08, 6470.
Abreu, R.; Zoeteweij, P.; and Van Gemund, A. 2009. A new bayesian approach to multiple intermittent fault diagnosis. In Proceedings of the 21st International Joint Conference on Artificial Intelligence, IJCAI09, 653658.
Carey, J.; Gross, N.; Stepanek, M.; and Port, O. 1999. Software hell. In Business Week, 391411.
Chen, M. Y.; Kiciman, E.; Fratkin, E.; Fox, A.; Fox, O.; and Brewer, E. 2002. Pinpoint: Problem determination in large, dynamic internet services. In Proceedings of the 2002 International Conference on Dependable Systems and Networks, DSN 2002, 595604.
Cheng, S.-W.; Garlan, D.; and Schmerl, B. R. 2009. Evaluating the effectiveness of the rainbow self-adaptive system. In Proceedings of Workshop on Software Engineering for Adaptive and Self-Managing Systems, SEAMS09, 132 141.
Feldman, A.; Provan, G.; and Van Gemund, A. 2008. Computing minimal diagnoses by greedy stochastic search. In Proceedings of the 23rd national conference on Artificial intelligence Volume 2, AAAI08, 911918.
Harrold, M. J.; Rothermel, G.; Wu, R.; and Yi, L. 1998.An empirical investigation of program spectra. In Proceedings of the 1998 ACM SIGPLAN-SIGSOFT workshop on Program analysis for software tools and engineering, PASTE98, 8390.
Jones, J. A., and Harrold, M. J. 2005. Empirical evaluation of the tarantula automatic fault-localization technique. In Proceedings of the 20th IEEE/ACM international Conference on Automated software engineering, ASE 05, 273 282.
De Kleer, J., and Williams, B. C. 1992. Readings in modelbased diagnosis. In Readings in model-based diagnosis.chapter Diagnosing multiple faults, 100117.
De Kleer, J. 2006. Getting the probabilities right for measurement selection. In 17th International Workshop on Principles of Diagnosis, DX06, 141146.
De Kleer, J. 2009. Diagnosing multiple persistent and intermittent faults. In Proceedings of the 21st International Joint Conference on Artificial Intelligence, IJCAI09, 733738.
Kuhn, L.; Price, B.; Do, M.; Liu, J.; Zhou, R.; Schmidt, T.; and De Kleer, J. 2010. Pervasive diagnosis. Transactions on Systems, Man Cybernetics Part A 40(5):15621595.
Silverman, B. W. 1986. Density estimation for statistics and data analysis. Chapman and Hall.
-----0
Altman, E. 1999. Constrained Markov Decision Processes.Chapman and Hall.
Bergemann, D., and Valimaki, J. 2010. The dynamic pivot mechanism. Econometrica 78:771789.
Boutilier, C., and Procaccia, A. D. 2012. A dynamic rationalization of distance rationalizability. In Proceedings of the 26th AAAI Conference on Artificial Intelligence (AAAI), 12781284.
Boutilier, C.; Caragiannis, I.; Haber, S.; Lu, T.; Procaccia, A. D.; and Sheffet, O. 2012. Optimal social choice functions: A utilitarian view. In Proceedings of the 13th ACM Conference on Electronic Commerce (EC), 197214.
Boutilier, C.; Dearden, R.; and Goldszmidt, M. 1995. Exploiting structure in policy construction. In Proceedings of the 14th International Joint Conference on Artificial Intelligence (IJCAI), 11041111.
Cavallo, R.; Parkes, D. C.; and Singh, S. 2006. Optimal coordinated planning amongst self-interested agents with private state. In Proceedings of the 22nd Annual Conference on Uncertainty in Artificial Intelligence (UAI), 5562.
Crawford, E., and Veloso, M. 2005. Learning dynamic preferences in multi-agent meeting scheduling. In Proceedings of the 5th IEEE/WIC/ACM International Conference on Intelligent Agent Technology (IAT), 487490.
Dolgov, D., and Durfee, E. 2005. Stationary deterministic policies for constrained MDPs with multiple rewards, costs, and discount factors. In Proceedings of the 19th International Joint Conference on Artificial Intelligence (IJCAI), 13261331.
Dolgov, D., and Durfee, E. 2006. Resource allocation among agents with MDP-induced preferences. Journal of Artificial Intelligence Research 27:505549.
Elkind, E.; Faliszewski, P.; and Slinko, A. 2009. On distance rationalizability of some voting rules. In Proceedings of the 12th Conference on Theoretical Aspects of Rationality and Knowledge (TARK), 108117.
Meir, R.; Polukarov, M.; Rosenschein, J. S.; and Jennings, N. R. 2010. Convergence to equilibria in plurality voting.
In Proceedings of the 24th AAAI Conference on Artificial Intelligence (AAAI), 823828.
Parkes, D. C.; Cavallo, R.; Constantin, F.; and Singh, S. 2010. Dynamic incentive mechanisms. AI Magazine 31(4):7994.
Puterman, M. L. 1994. Markov Decision Processes: Discrete Stochastic Dynamic Programming. Wiley.
Roberts, K. W. S. 1980. Social choice theory: The singleprofile and multi-profile approaches. Review of Economic Studies 47(2):441450.
Tideman, N. 2006. Collective Decisions and Voting. Ashgate.
Zinkevich, M., and Balch, T. 2001. Symmetry in Markov decision processes and its implications for single agent and multiagent learning. In Proceedings of the 18th International Conference on Machine Learning (ICML), 632640.
-----0
Bartholomew, M., and Lee, J. 2010. A decidable class of groundable formulas in the general theory of stable models. In 12th International Conference on the Principles of Knowledge Representation and Reasoning (KR10), 477485.AAAI Press.
Bonatti, P. A. 2002. Reasoning with Infinite Stable Models II: Disjunctive Programs. In 18th International Conference on Logic Programming (ICLP02), volume 2401 of LNCS, 333346. Springer.
Bonatti, P. A. 2004. Reasoning with infinite stable models.Artificial Intelligence 156(1):75111.
Brewka, G.; Eiter, T.; and Truszczynski, M. 2011. Answer set programming at a glance. Communications of the ACM 54(12):92103.
Cabalar, P.; Pearce, D.; and Valverde, A. 2009. A revised concept of safety for general answer set programs. In 10th International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR09), volume 5753 of LNCS, 5870. Springer.
Calimeri, F.; Cozza, S.; Ianni, G.; and Leone, N. 2008.Computable Functions in ASP: Theory and Implementation.
In 24th International Conference on Logic Programming (ICLP08), volume 5366 of LNCS, 407424. Springer.
Calimeri, F.; Cozza, S.; and Ianni, G. 2007. External Sources of Knowledge and Value Invention in Logic Programming. Annals of Mathematics and Artificial Intelligence 50(34):333361.
Eiter, T.; Ianni, G.; Schindlauer, R.; and Tompits, H. 2005. A Uniform Integration of Higher-Order Reasoning and External Evaluations in Answer-Set Programming. In 19th International Joint Conference on Artificial Intelligence (IJCAI05), 9096. Professional Book Center.
Eiter, T.; Ianni, G.; Schindlauer, R.; and Tompits, H. 2006.Effective Integration of Declarative Rules with External Evaluations for Semantic-Web Reasoning. In 3rd European Semantic Web Conference (ESWC06), volume 4011 of LNCS, 273287. Springer.
Eiter, T.; Fink, M.; Ianni, G.; Krennwallner, T.; and Schuller, P. 2011. Pushing Efficient Evaluation of HEX Programs by Modular Decomposition. In 11th International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR11), volume 6645 of LNCS, 93106. Springer.
Faber, W.; Leone, N.; and Pfeifer, G. 2011. Semantics and complexity of recursive aggregates in answer set programming. Artificial Intelligence 175(1):278298.
Gebser, M.; Schaub, T.; and Thiele, S. 2007. GrinGo: A New Grounder for Answer Set Programming. In 9th International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR07), volume 4483, 266271. Springer.
Gelfond, M., and Lifschitz, V. 1991. Classical Negation in Logic Programs and Disjunctive Databases. New Generation Computing 9(34):365386.
Krishnamurthy, R.; Ramakrishnan, R.; and Shmueli, O. 1996.A framework for testing safety and effective computability.Journal of Computer and System Sciences 52(1):100124.
Lee, J.; Lifschitz, V.; and Palla, R. 2008. Safe formulas in the general theory of stable models (preliminary report). In 24th International Conference on Logic Programming (ICLP08), volume 5366 of LNCS, 672676. Springer.
Lierler, Y., and Lifschitz, V. 2009. One more decidable class of finitely ground programs. In 25th International Conference on Logic Programming (ICLP09), volume 5649 of LNCS, 489493. Springer.
Ramakrishnan, R.; Bancilhon, F.; and Silberschatz, A. 1987.Safety of recursive horn clauses with infinite relations. In 6th Symposium on Principles of Database Systems (PODS87), 328339. ACM.
Sagiv, Y., and Vardi, M. Y. 1989. Safety of datalog queries over infinite databases. In 8th Symposium on Principles of Database Systems (PODS89), 160171. ACM.
Sipser, M. 2012. Introduction to the Theory of Computation.Course Technology, 3rd edition.
Syrjanen, T. 2001. Omega-restricted logic programs. In 6th International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR01), volume 2173 of LNCS, 267279. Springer.
Zantema, H. 1994. Termination of term rewriting: Interpretation and type elimination. Journal of Symbolic Computation 17(1):2350.
Zantema, H. 2001. The termination hierarchy for term rewriting. Applicable Algebra in Engineering, Communication and Computing 12(1-2):319.
Zuker, M., and Sankoff, D. 1984. RNA secondary structures and their prediction. Bulletin of Mathematical Biology 46(4):591621.
-----0
Abrams, R., and Balota, D. 1991. Mental chronometry: Beyond reaction time. Psychological Science 2(3):153157.
Chen, T., and Ren, J. 2009. Bagging for gaussian process regression. Neurocomputing 72(7):16051610.
Csato, L., and Opper, M. 2002. Sparse on-line gaussian processes. Neural Computation 14(3):641668.delta data set. http://www.dcc.fc.up.pt/?ltorgo/ Regression/.bank data set. http://www.cs.toronto.edu/?delve/.cpuact data set. http://www.cs.toronto.edu/?delve/.elevator data set. http://www.dcc.fc.up.pt/?ltorgo/ Regression/.houses data set. http://lib.stat.cmu.edu/datasets/.sarcos data set. http://www.gaussianprocess.org/gpml/ data/.
Dale, R.; Kehoe, C.; and Spivey, M. 2007. Graded motor responses in the time course of categorizing atypical exemplars. Memory & Cognition 35(1):1528.
Feige, U. 1998. A threshold of ln n for approximating set cover. Journal of the ACM 45(4):634652.
Freeman, J., and Ambady, N. 2009. Motions of the hand expose the partial and parallel activation of stereotypes. Psychological Science 20(10):11831188.
Freeman, J.; Pauker, K.; Apfelbaum, E.; and Ambady, N.2010. Continuous dynamics in the real-time perception of race. Journal of Experimental Social Psychology 46(1):179 185.
GPR and SGPP MATLAB implementation. http://www.cs.man.ac.uk/?neill/gp/.
LoGP MATLAB implementation. http://www.ias.informatik.tu-darmstadt.de/Member/DuyNguyen-Tuong.
SOGP MATLAB implementation. http://www.cs.ubbcluj.ro/?csatol/.
Keerthi, S., and Chu, W. 2006. A matching pursuit approach to sparse gaussian process regression. In Advances in Neural Information Processing Systems, volume 18, 643. MIT Press.
Kimeldorf, G., and Wahba, G. 1971. Some results on tchebycheffian spline functions. Journal of Mathematical Analysis and Applications 33(1):8295.
Krause, A., and Guestrin, C. 2007. Near-optimal observation selection using submodular functions. In Proceedings of the National Conference on Artificial Intelligence, volume 22, 1650. Menlo Park, CA; Cambridge, MA; London; AAAI Press; MIT Press; 1999.
Krause, A.; Mcmahan, H.; Guestrin, C.; and Gupta, A. 2007.Selecting observations against adversarial objectives. In Advances in Neural Information Processing Systems. MIT Press.
Krause, A.; Singh, A.; and Guestrin, C. 2008. Nearoptimal sensor placements in gaussian processes: Theory, efficient algorithms and empirical studies. Journal of Machine Learning Research 9:235284.
Minoux, M. 1978. Accelerated greedy algorithms for maximizing submodular set functions. Optimization Techniques 234243.
Nabney, I. T. 2004. NETLAB: algorithms for pattern recognition. Springer.
Nemhauser, G.; Wolsey, L.; and Fisher, M. 1978. An analysis of approximations for maximizing submodular set functionsi. Mathematical Programming 14(1):265294.
Nguyen-tuong, D., and Peters, J. 2008. Local gaussian process regression for real time online model learning and control. In Advances in Neural Information Processing Systems.MIT Press.
Quinonero-Candela, J., and Rasmussen, C. 2005. A unifying view of sparse approximate gaussian process regression.Journal of Machine Learning Research 6:19391959.
Rasmussen, C., and Williams, C. 2006. Gaussian processes for machine learning, volume 1. MIT press Cambridge, MA.
Seeger, M.; Williams, C.; and Lawrence, N. 2003. Fast forward selection to speed up sparse gaussian process regression. In Workshop on AI and Statistics, volume 9, 2003.
Smola, A. J., and Bartlett, P. 2001. Sparse greedy gaussian process regression. In Advances in Neural Information Processing Systems, 619625. MIT Press.
Snelson, E., and Ghahramani, Z. 2006. Sparse gaussian processes using pseudo-inputs. In Advances in Neural Information Processing Systems, 12571264. MIT press.
Song, J., and Nakayama, K. 2008. Target selection in visual search as revealed by movement trajectories. Vision research 48(7):853861.
Spivey, M.; Grosjean, M.; and Knoblich, G. 2005. Continuous attraction toward phonological competitors. Proceedings of the National Academy of Sciences of the United States of America 102(29):1039310398.
Tresp, V. 2000. A bayesian committee machine. Neural Computation 12(11):27192741.
-----0
Adler, I. (forthcoming). The equivalence of linear programs and zero-sum games. International Journal of Game Theory.
Borgs, C.; Chayes, J.; Immorlica, N.; Kalai, A. T.; Mirrokni, V.; and Papadimitriou, C. 2010. The myth of the Folk Theorem. Games and Economic Behavior 70(1):3443.
Chen, X.; Deng, X.; and Teng, S.-H. 2009. Settling the complexity of computing two-player Nash equilibria. Journal of the ACM 56(3).
Dantzig, G. 1951. A proof of the equivalence of the programming problem and the game problem. In Koopmans, T., ed., Activity Analysis of Production and Allocation. John Wiley & Sons. 330335.
Daskalakis, C.; Goldberg, P.; and Papadimitriou, C. H. 2009.The complexity of computing a Nash equilibrium. SIAM Journal on Computing 39(1):195259.
Etessami, K., and Yannakakis, M. 2010. On the complexity of Nash equilibria and other fixed points. SIAM Journal on Computing 39(6):25312597.
Halvorson, E.; Conitzer, V.; and Parr, R. 2009. Multistep multi-sensor hider-seeker games. In Proceedings of the Twenty-First International Joint Conference on Artificial Intelligence (IJCAI), 159166.
Hansen, K. A.; Hansen, T. D.; Miltersen, P. B.; and Srensen, T. B. 2008. Approximability and parameterized complexity of minmax values. In Proceedings of the Fourth Workshop on Internet and Network Economics (WINE), 684695.
Jain, M.; Korzhyk, D.; Vanek, O.; Conitzer, V.; Pechoucek, M.; and Tambe, M. 2011. A double oracle algorithm for zero-sum security games on graphs. In Proceedings of the Tenth International Joint Conference on Autonomous Agents and Multi-Agent Systems (AAMAS), 327334.
Kontogiannis, S. C., and Spirakis, P. G. 2008. Equilibrium points in fear of correlated threats. In Proceedings of the Fourth Workshop on Internet and Network Economics (WINE), 210221.
Littman, M. L., and Stone, P. 2005. A polynomial-time Nash equilibrium algorithm for repeated games. Decision Support Systems 39:5566.
Nudelman, E.; Wortman, J.; Leyton-Brown, K.; and Shoham, Y. 2004. Run the GAMUT: A comprehensive approach to evaluating game-theoretic algorithms. In Proceedings of the International Conference on Autonomous Agents and Multi-Agent Systems (AAMAS), 880887.
Shoham, Y. 2008a. Computer science and game theory.Communications of the ACM 51(8):7479.
Shoham, Y. 2008b. Game theory pragmatics: A challenge for AI. In Proceedings of the National Conference on Artificial Intelligence (AAAI), 16061608.
-----0
Akyildiz, I. F.; Lee, W.-Y.; Vuran, M. C.; and Mohanty, S. 2006. NeXt Generation/Dynamic Spectrum Access/Cognitive Radio Wireless Networks: A Survey. Comput. Netw. 50:21272159.
Atlas, J., and Decker, K. 2010. Coordination for uncertain outcomes using distributed neighbor exchange. In Proc. AAMAS, 10471054.
Burdett, K., and Malueg, D. A. 1981. The theory of search for several goods. JET 24:362376.
Carlson, J. A., and McAfee, R. P. 1984. Joint search for several goods. JET 32:337345.
Chhabra, M.; Das, S.; and Sarne, D. 2011. Expert-mediated search. In Proc. AAMAS, 415422.
Dias, M. 2004. TraderBots: A New Paradigm for Robust and Efficient Multirobot Coordination in Dynamic Environments. Ph.D. Dissertation, Robotics Institute, CMU.
Hazon, N.; Aumann, Y.; and Kraus, S. 2009. Collaborative multi agent physical search with probabilistic knowledge. In Proc. IJCAI, 167174.
Kephart, J., and Greenwald, A. 2002. Shopbot economics.JAAMAS 5:255287.
Lermann, K., and Shehory, O. 2000. Coalition formation for large-scale electronic markets. In Proc. ICMAS, 167174.
Li, C.; Chawla, S.; Rajan, U.; and Sycara, K. 2003. Mechanisms for coalition formation and cost sharing in an electronic marketplace. In Proc. EC03, 6877.
McMillan, J., and Rothschild, M. 1994. Search. In Proc.Handbook of Game Theory with Economic Applications, 905927.
Michiardi, P., and Molva, R. 2005. Analysis of coalition formation and cooperation strategies in mobile ad hoc networks. Ad Hoc Networks 3:193219.
Rochlin, I.; Sarne, D.; and Laifenfeld, M. 2012. Coordinated exploration with a shared goal in costly environments. In Proc. ECAI, 690695.
Rochlin, I.; Sarne, D.; and Zussman, G. 2011. Sequential multilateral search for a common goal. In Proc. IAT, 349 356.
Rosenfeld, A.; Kaminka, G. A.; Kraus, S.; and Shehory, O.2008. A study of mechanisms for improving robotic group performance. Artif. Intell. 172:633655.
Sandholm, T.; Larson, K.; Andersson, M.; Shehory, O.; and Tohme, F. 1999. Coalition structure generation with worst case guarantees. AIJ 111:209238.
Sarne, D.; Manisterski, E.; and Kraus, S. 2010. Multi-goal economic search using dynamic search structures. JAAMAS 21:204236.
Shehory, O., and Kraus, S. 1998. Methods for task allocation via agent coalition formation. AIJ 101:165200.
Smith, S.; Gallagher, A.; Zimmerman, T.; Barbulescu, L.; and Rubinstein, Z. 2007. Distributed management of flexible times schedules. In Proc. AAMAS, 472479.
Smith, L. 2011. Frictional matching models. Annual Reviews in Economics 3:319338.
Talukdar, S.; Baerentzen, L.; Gove, A.; and de Souza, P. S.1998. Asynchronous teams: Cooperation schemes for autonomous agents. Heuristics 4:295321.
Tsvetovat, N.; Sycara, K.; Chen, Y.; and Ying, J. 2000. Customer coalitions in electronic markets. In Proc. AMEC, 121 138.
Yamamoto, J., and Sycara, K. 2001. A stable and efficient buyer coalition formation scheme for e-marketplaces. In Proc. Agents01, 576583.
-----0
Bakshy, E.; Hofman, J. M.; Mason, W. A.; and Watts, D. J.2011. Everyones an influencer: quantifying influence on twitter. In Proceedings of the 4th ACM international conference on Web search and data mining.
Beck, A., and Teboulle, M. 2009. A fast iterative shrinkage thresholding algorithm for linear inverse problems. SIAM Journal on Imaging Science 2:183202.
Biessmann, F.; Papaioannou, J.-M.; Braun, M.; and Harth, A. 2012. Canonical trends: Detecting trend setters in web data. In Proceedings of the 29th International Conference on Machine Learning.
Blei, D. M.; Ng, A. Y.; and Jordan, M. I. 2003. Latent Dirichlet Allocation. Journal of Machine Learning Research 3:9931022.
Brin, S., and Page, L. 1998. The anatomy of a large-scale hypertextual web search engine. Computer Network ISDN Systems 30:107117.
Cha, M.; Haddadi, H.; Benevenuto, F.; and Gummadi, K. P.2010. Measuring user influence in twitter: The million follower fallacy. In Proceedings of the 4th International AAAI Conference on Weblogs and Social.
Chen, X., and Liu, H. 2012. An efficient optimization algorithm for structured sparse cca, with applications to eqtl mapping. Statistics in Biosciences 4(1):326.
Chen, X.; Pan, W.; Kwok, J.; and Carbonell, J. 2009. Accelerated gradient method for multi-task sparse learning problem. In Proceedings of the 9th IEEE International Conference on Data Mining.
Chen, X.; Lin, Q.; Kim, S.; Carbonell, J.; and Xing, E. P.2012. Smoothing proximal gradient method for general structured sparse learning. Annals of Applied Statistics 6(2):719752.
Chen, W.; Wang, C.; and Wang, Y. 2010. Scalable influence maximization for prevalent viral marketing in large-scale social networks. In Proceedings of the 16th ACM SIGKDD international conference on Knowledge discovery and data mining.
Griffiths, T. L., and Steyvers, M. 2004. Finding scientific topics. In Proceedings of the National Academy of Sciences.
Kempe, D.; Kleinberg, J.; and Eva Tardos. 2003. Maximizing the spread of influence through a social network. In Proceedings of the 9th ACM SIGKDD international conference on Knowledge discovery and data mining.
Kempe, D.; Kleinberg, J.; and Eva Tardos. 2005. Influential nodes in a diffusion model for social networks. In Proceedings of the 32nd international conference on Automata, Languages and Programming.
Liu, J.; Ji, S.; and Ye, J. 2009. Multi-task feature learning via efficient 2,1-norm minimization. In Proceedings of the 25th Conference on Uncertainty in Artificial Intelligence.
Ma, H.; Yang, H.; Lyu, M. R.; and King, I. 2008. Mining social networks using heat diffusion processes for marketing candidates selection. In Proceedings of the 17th ACM conference on Information and knowledge management.
Nesterov, Y. 2003. Introductory lectures on convex optimization: a basic course. Kluwer Academic Pub.
Obozinski, G. R.; Wainwright, M. J.; and Jordan, M. I. 2009.High-dimensional union support recovery in multivariate regression. In Proceedings of the 23rd Annual Conference on Neural Information Processing Systems.
Phan, X.-H., and Nguyen, C.-T. 2007. GibbsLDA++: A C/C++ implementation of Latent Dirichlet Allocation (LDA).
Richardson, M., and Domingos, P. 2002. Mining knowledge-sharing sites for viral marketing. In Proceedings of the 8th ACM SIGKDD international conference on Knowledge discovery and data mining.
Weng, J.; Lim, E.-P.; Jiang, J.; and He, Q. 2010. Twitterrank: finding topic-sensitive influential twitterers. In Proceedings of the 3rd ACM international conference on Web search and data mining.
Yang, J., and Leskovec, J. 2010. Modeling information diffusion in implicit network. In Proceedings of the10th IEEE International Conference on Data Mining.
Yuan, M., and Lin, Y. 2006. Model selection and estimation in regression with grouped variables. Journal of the Royal Statistical Society, Series B 68:4967.
-----0
Alon, U.; Barkai, N.; Notterman, D.; Gish, K.; Ybarra, S.; Mack, D.; and Levine, A. 1999. Broad patterns of gene expression revealed by clustering analysis of tumor and normal colon tissues probed by oligonucleotide arrays. Proceedings of the National Academy of Sciences 96(12):67456750.
Antoniadis, A.; Lambert-Lacroix, S.; and Leblanc, F. 2003.Effective dimension reduction methods for tumor classification using gene expression data. Bioinformatics 19(5):563 570.
Dettling, M., and Bhlmann, P. 2003. Boosting for tumor classification with gene expression data. Bioinformatics 19(9):10611069.
Ding, C. H. Q., and Peng, H. 2005. Minimum redundancy feature selection from microarray gene expression data. J.
Bioinformatics and Computational Biology 3(2):185206.Dudoit, S.; Fridlyand, J.; and Speed, T. P. 2002. Comparison of discrimination methods for the classification of tumors using gene expression data. Journal Of The American Statistical Association 97(457):7787.
Furey, T. S.; Cristianini, N.; Duffy, N.; Bednarski, D. W.; Schummer, M.; and Haussler, D. 2000. Support vector machine classification and validation of cancer tissue samples using microarray expression data. BMC Bioinformatics 16(10):906914.
Golub, T. R.; Slonim, D. K.; Tamayo, P.; Huard, C.; Gaasenbeek, M.; Mesirov, J. P.; Coller, H.; Loh, M. L.; Downing, J. R.; Caligiuri, M. A.; and et al. 1999. Molecular classification of cancer: class discovery and class prediction by gene expression monitoring. Science 286(5439):531537.
Kohavi, R., and John, G. H. 1997. Wrappers for feature subset selection. Artif. Intell. 97(1-2):273324.
Kononenko, I. 1994. Estimating attributes: Analysis and extensions of RELIEF. In European Conference on Machine Learning, 171182.
Ma, S.; Song, X.; and Huang, J. 2007. Supervised group lasso with applications to microarray data analysis. BMC Bioinformatics 8.
Peng, H.; Long, F.; and Ding, C. H. Q. 2005. Feature selection based on mutual information: Criteria of maxdependency, max-relevance, and min-redundancy. IEEE Trans. Pattern Anal. Mach. Intell. 27(8):12261238.
Raileanu, L. E., and Stoffel, K. 2004. Theoretical comparison between the gini index and information gain criteria.Ann. Math. Artif. Intell. 41(1):7793.
Tibshirani, R. 1996. Regression shrinkage and selection via the Lasso. Journal of the Royal Statistical Society. Series B (Methodological) 58(1):267288.
Xu, H.; Caramanis, C.; and Mannor, S. 2012. Sparse algorithms are not stable: A no-free-lunch theorem. IEEE Trans.
Pattern Anal. Mach. Intell. 34(1):187193.Yang, A.-J., and Song, X.-Y. 2010. Bayesian variable selection for disease classification using gene expression data.Bioinformatics 26(2):215222.
Yuan, M., and Lin, Y. 2006. Model selection and estimation in regression with grouped variables. Journal of the Royal Statistical Society: Series B (Statistical Methodology) 68(1):4967.
Zou, H., and Hastie, T. 2005. Regularization and variable selection via the elastic net. Journal of the Royal Statistical Society: Series B (Statistical Methodology) 67(2):301320.
-----0
Argyriou, A.; Evgeniou, T.; and Pontil, M. 2008. Convex multi-task feature learning. Machine Learning 73(3):243 272.
Auslender, A. 1976. Optimisation: methodes numeriques.Masson.
Bertsekas, D. P. 1999. Nonlinear programming.Boyd, S., and Vandenberghe, L. 2004. Convex optimization.Cambridge university press.
Evgeniou, T., and Pontil, M. 2004. Regularized multitask learning. In Proceedings of the 10th International Conference on Knowledge Discovery and Data Dining, KDD04, 109117. ACM.
Fu, W. J. 1998. Penalized regressions: the bridge versus the lasso. Journal of computational and graphical statistics 7(3):397416.
Gonzalez, H.; Han, J.; Li, X.; Myslinska, M.; and Sondag, J. P. 2007. Adaptive fastest path computation on a road network: a traffic mining approach. In Proceedings of the 33rd International Conference on Very Large Data Bases, VLDB07, 794805.
Ide, T., and Kato, S. 2009. Travel-time prediction using gaussian process regression: A trajectory-based approach. In Proceedings of the 9th SIAM International Conference on Data Mining, SDM09, 11831194.
Ide, T., and Sugiyama, M. 2011. Trajectory regression on road networks. In Proceedings of the 25th AAAI Conf. on Artificial Intelligence, AAAI11, 203208.
Kanoulas, E.; Du, Y.; Xia, T.; and Zhang, D. 2006. Finding fastest paths on a road network with speed patterns. In Proceedings of the 22nd International Conference on Data Engineering, ICDE06. IEEE.
Nachtigall, K. 1995. Time depending shortest-path problems with applications to railway networks. European Journal of Operational Research 83(1):154166.
Orda, A., and Rom, R. 1990. Shortest-path and minimumdelay algorithms in networks with time-dependent edgelength. Journal of the ACM (JACM) 37(3):607625.
Tibshirani, R.; Saunders, M.; Rosset, S.; Zhu, J.; and Knight, K. 2005. Sparsity and smoothness via the fused lasso.Journal of the Royal Statistical Society: Series B (Statistical Methodology) 67(1):91108.
Tseng, P. 2001. Convergence of a block coordinate descent method for nondifferentiable minimization. Journal of optimization theory and applications 109(3):475494.
Yuan, J.; Zheng, Y.; Zhang, C.; Xie, W.; Xie, X.; Sun, G.; and Huang, Y. 2010. T-drive: driving directions based on taxi trajectories. In Proceedings of the 18th SIGSPATIAL International Conference on Advances in Geographic Information Systems, 99108. ACM.
Zhang, Y., and Yeung, D. 2010. A convex formulation for learning task relationships in multi-task learning. In Proceedings of the 26th Conference on Uncertainty in Artificial Intelligence, UAI10, 733742.
-----0
Alterman, R. 1986. An adaptive planner. In Proceedings of AAAI, 6571.Amir, E. 2005. Learning partially observable deterministic action models. In Proceedings of IJCAI, 14331439.
Bacchus, F., and Yang, Q. 1991. The downward refinement property. In Proceedings of the Twelfth International Joint Conference on Artificial Intelligence, 286292.
Bertoli, P.; Pistore, M.; and Traverso, P. 2010. Automated composition of web services via planning in asynchronous domains. Artificial Intelligence Journal 174(3-4):316361.
Blythe, J.; Deelman, E.; and Gil, Y. 2004. Automatically composedworkflows for grid environments. IEEE Intelligent Systems 19(4):1623.
Bryce, D., and Weber, C. 2011. Planning and acting in incomplete domains. In Proceedings of ICAPS.
Cresswell, S.; McCluskey, T. L.; and West, M. M. 2009.Acquisition of object-centred domain models from planning examples. In Proceedings of ICAPS-09.
Hammond, K. J. 1989. Case-Based Planning: Viewing Planning as a Memory Task. San Diego, CA: Academic Press.
Hoffmann, J.; Bertoli, P.; and Pistore, M. 2007. Web service composition as planning, revisited: In between background theoriesandinitial state uncertainty. In Proceedings of AAAI.
Ihrig, L. H., and Kambhampati, S. 1997. Storing and indexing plan derivations through explanation-based analysis of retrieval failures. Journal of Artificial Intelligence Research 7:161198.
Kambhampati, S., and Hendler, J. A. 1992. A validationstructure-based theory of plan modification and reuse. Artificial Intelligence Journal 55:193C258.
Kambhampati, S. 2007. Model-lite planning for the web age masses: The challenges of planning with incomplete and evolving domain theories. In Proceedings of AAAI.
Nguyen, T. A.; Kambhampati, S.; and Do, M. B. 2010.Assessing and generating robust plans with partial domain models. In ICAPS Workshop on Planning under Uncertainty.
Pei, J.; Han, J.; Mortazavi-Asl, B.; Wang, J.; Pinto, H.; Chen, Q.; Dayal, U.; and Hsu, M.-C. 2004. Mining sequential patterns by pattern-growth: The prefixspan approach.IEEE Transactions on Knowledge and Data Engineering 16(11):14241440.
Serina, I. 2010. Kernel functions for case-based planning.Artificial Intelligence 174(16-17):13691406.
Sutton, R. S., and Barto, A. G. 1998. Reinforcement Learning: An Introduction. Cambridge, Massachusetts: MIT Press.
Veloso, M.; Carbonell, J.; Prez, A.; Borrajo, D.; Fink, E.; and Blythe, J. 1995. Integrating planning and learning: The prodigy architecture. Journal of Experimental and Theoretical Artificial Intelligence 7(1).
Walsh, T. J., and Littman, M. L. 2008. Efficient learning of action schemas and web-service descriptions. In Proceedings of AAAI-08, 714719.Yang, Q.; Wu, K.; and Jiang, Y. 2007. Learning action models from plan examples using weighted MAX-SAT. Artificial Intelligence Journal 171:107143.
Zaki, M. J. 2001. Spade: An efficient algorithm for mining frequent sequences. machine learning 42:3160.
Zettlemoyer, L. S.; Pasula, H. M.; and Kaelbling, L. P. 2005.Learning planning rules in noisy stochastic worlds. In Proceedings of AAAI.
Zhuo, H. H.; Yang, Q.; Hu, D. H.; and Li, L. 2010. Learning complex action models with quantifiers and implications.
Artificial Intelligence 174(18):1540  1569.Zhuo, H. H.; Nguyen, T.; and Kambhampati, S. 2013. Refining incomplete planning domain models through plan traces.In Proceedings of IJCAI.
-----0
Apsel, U., and Brafman, R. 2012. Exploiting uniform assignments in first-order mpe. In Proceedings of UAI, 7483.
Asano, T. 2006. An improved analysis of goemans and williamsons lp-relaxation for max sat. Theoretical Computer Science 354(3):339353.
Bodi, R.; Herr, K.; and Joswig, M. 2013. Algorithms for highly symmetric linear and integer programs. Mathematical Programming 137(1-2):6590.
Bui, H. H.; Huynh, T. N.; and Riedel, S. 2012. Automorphism groups of graphical models and lifted variational inference. CoRR abs/1207.4814.
Darga, P.; Sakallah, K.; and Markov, I. 2008. Faster symmetry discovery using sparsity of symmetries. In Proceedings of the 45th annual Design Automation Conference, 149154.
de Salvo Braz, R.; Amir, E.; and Roth, D. 2006. MPE and partial inversion in lifted probabilistic variable elimination.In Proceedings of AAAI, 11231130.
Diaconis, P. 1977. Finite forms of de finettis theorem on exchangeability. Synthese 36(2):27181.
Domingos, P.; Jain, D.; Kok, S.; Lowd, D.; Poon, H.; and Richardson, M. 2012. Alchemy website.http://alchemy.cs.washington.edu/. last visit: 22.11.2012.
Finetti, B. 1972. Probability, induction and statistics: the art of guessing. Probability and mathematical statistics. Wiley.
Genesereth, M., and Nilsson, N. 1987. Logical foundations of artificial intelligence, volume 9. Morgan Kaufmann.
Gogate, V., and Domingos, P. 2011. Probabilistic theorem proving. In Proceedings of UAI, 256265.
Huynh, T. N., and Mooney, R. J. 2009. Max-margin weight learning for markov logic networks. In Proceedings of EMCL PKDD, 564579.
Kautz, H.; Selman, B.; and Jiang, Y. 1997. A general stochastic approach to solving problems with hard and soft constraints. Satisfiability Problem: Theory and Applications 17.
Kersting, K.; Ahmadi, B.; and Natarajan, S. 2009. Counting belief propagation. In Proceedings of UAI, 277284.
Kisynski, J., and Poole, D. 2009. Lifted aggregation in directed first-order probabilistic models. In Proceedings of IJCAI, 19221929.
Koch, T.; Achterberg, T.; Andersen, E.; Bastert, O.; Berthold, T.; Bixby, R.; Danna, E.; Gamrath, G.; Gleixner, A.; Heinz, S.; et al. 2011. Miplib 2010. Mathematical Programming Computation 161.
Kok, S., and Domingos, P. 2008. Extracting semantic networks from text via relational clustering. Machine Learning and Knowledge Discovery in Databases 624639.
Low, Y.; Gonzalez, J.; Kyrola, A.; Bickson, D.; Guestrin, C.; and Hellerstein, J. M. 2010. Graphlab: A new framework for parallel machine learning. In Proceedings of UAI, 340349.
Lowd, D., and Domingos, P. 2007. Efficient weight learning for markov logic networks. In Proceedings of ECML PKDD, 200211.
Margot, F. 2003. Exploiting orbits in symmetric ilp. Math.Program. 98(1-3):321.
Margot, F. 2010. Symmetry in integer linear programming.In 50 Years of Integer Programming 1958-2008. Springer Berlin Heidelberg. 647686.
McCallum, A.; Nigam, K.; Rennie, J.; and Seymore, K.2000. Automating the construction of internet portals with machine learning. Information Retrieval 3(2):127163.
Milch, B.; Zettlemoyer, L. S.; Kersting, K.; Haimes, M.; and Kaelbling, L. P. 2008. Lifted probabilistic inference with counting formulas. In Proceedings of AAAI, 10621068.
Mladenov, M.; Ahmadi, B.; and Kersting, K. 2012. Lifted linear programming. Journal of Machine Learning Research 22:788797.
Niepert, M.; Meilicke, C.; and Stuckenschmidt, H. 2010. A probabilistic-logical framework for ontology matching. In Proceedings of AAAI, 14131418.
Niepert, M. 2010. A delayed column generation strategy for exact k-bounded map inference in markov logic networks.In Proceedings of UAI, 384391.
Niepert, M. 2012. Markov chains on orbits of permutation groups. In Proceedings of UAI, 624633.
Niu, F.; Re, C.; Doan, A.; and Shavlik, J. 2011. Tuffy: Scaling up statistical inference in markov logic networks using an rdbms. Proceedings of the VLDB Endowment 4(6):373 384.
Ostrowski, J.; Linderoth, J.; Rossi, F.; and Smriglio, S. 2011.Orbital branching. Math. Program. 126(1):147178.
Poole, D. 2003. First-order probabilistic inference. In Proceedings of IJCAI, 985991.
Poon, H., and Domingos, P. 2007. Joint inference in information extraction. In Proceedings of AAAI, 913918.
Richardson, M., and Domingos, P. 2006. Markov logic networks. Machine learning 62(1):107136.
Riedel, S. 2008. Improving the accuracy and efficiency of map inference for markov logic. Proceedings of UAI 468 475.
Shavlik, J. W., and Natarajan, S. 2009. Speeding up inference in markov logic networks by preprocessing to reduce the size of the resulting grounded network. In Proceedings of IJCAI, 19511956.
Singla, P., and Domingos, P. 2006. Entity resolution with markov logic. In Proceedings of ICDM, 572582.
Singla, P., and Domingos, P. 2008. Lifted first-order belief propagation. In Proceedings of AAAI, 10941099.
Van den Broeck, G. 2011. On the completeness of first-order knowledge compilation for lifted probabilistic inference. In Proceedings of NIPS, 13861394.
Venugopal, D., and Gogate, V. 2012. On lifting the gibbs sampling algorithm. In Proceedings of NIPS. 16641672.
Wu, F., and Weld, D. 2008. Automatically refining the wikipedia infobox ontology. In Proceedings of WWW, 635 644.
-----0
Agogino, A. K., and Tumer, K. 2008. Analyzing and visualizing multiagent rewards in dynamic and stochastic environments. Journal of Autonomous Agents and Multi Agent Systems 17(2):320338.
Arthur, W. B. 1994. Complexity in economic theory: Inductive reasoning and bounded rationality. The American Economic Review 84(2):406411.
Bazzan, A. L. 2005. A distributed approach for coordination of traffic signal agents. Autonomous Agents and Multi-Agent Systems 10:131164.
G. Jonker, J.-J. Ch. Meyer, F. D. 2007. Achieving cooperation among selfish agents in the air traffic management domain using signed money. In Proceedings of the Sixth International Joint Conference on Autonomous Agents and Multi-Agent Systems.
Hardin, G. 1968. The tragedy of the commons. Science 162:12431248.
Hill, J. C.; Johnson, F. R.; Archibald, J. K.; Frost, R. L.; and Stirling, W. C. 2005. A cooperative multi-agent approach to free flight. In AAMAS 05: Proceedings of the fourth international joint conference on Autonomous agents and multiagent systems, 10831090. New York, NY, USA: ACM Press.
Jefferies, P.; Hart, M. L.; and Johnson, N. F. 2002. Deterministic dynamics in the minority game. Physical Review E 65 (016105).
Klugl, F.; Bazzan, A.; and Ossowski, S., eds. 2005. Applications of Agent Technology in Traffic and Transportation.Springer.
Proper, S., and Tadepalli, P. 2006. Scaling model-based average-reward reinforcement learning for product delivery.In ECML 06: Proceedings of the 17th European Conference on Machine Learning, 735742.
Sherstov, A., and Stone, P. 2005. Three automated stocktrading agents: A comparative study. In Agent Mediated Electronic Commerce VI: Theories for and Engineering of Distributed Mechanisms and Systems (AMEC 2004), Lecture Notes in Artificial Intelligence. Berlin: Springer Verlag.173187.
Sislak, D.; Samek, J.; and Pechoucek, M. 2008. Decentralized algorithms for collision avoidance in airspace. In Proceedings of Seventh International Conference on Autonomous Agents and Multi-Agent Systems, 543550.
Stone, P.; Sutton, R. S.; and Kuhlmann, G. 2005. Reinforcement learning for RoboCup-soccer keepaway. Adaptive Behavior.
Sutton, R. S., and Barto, A. G. 1998. Reinforcement Learning: An Introduction. Cambridge, MA: MIT Press.
Tumer, K., and Agogino, A. 2007. Distributed agent-based air traffic flow management. In Proceedings of the Sixth International Joint Conference on Autonomous Agents and Multi-Agent Systems, 330337.
Tumer, K., and Agogino, A. K. 2009. Multiagent learning for black box system reward functions. Advances in Complex Systems 12:475492.
Tumer, K.; Welch, Z. T.; and Agogino, A. 2008. Aligning social welfare and agent preferences to alleviate traffic congestion. In Proceedings of the Seventh International Joint Conference on Autonomous Agents and Multi-Agent Systems.
Wellman, M. P.; Cheng, S.-F.; Reeves, D. M.; and Lochne, K. M. 2003. Trading agents competing: Performance, progress, and market effectiveness. IEEE Intelligent Systems 18(6):4853.
-----0
Breunig, M. M.; Kriegel, H.-P.; Ng, R. T.; and Sander, J.
2000. Lof: identifying density-based local outliers. SIGMOD Rec. 29(2):93104.
Cerioli, A. 2009. Multivariate outlier detection with highbreakdown estimators. Journal of the American Statistical Association 105(489):147156.
Chandola, V.; Banerjee, A.; and Kumar, V. 2009. Anomaly detection: A survey. ACM Comput. Surv.
Das, K. 2007. Detecting anomalous records in categorical datasets. In KDD 07, 220229.Frank, A., and Asuncion, A. 2010. UCI Machine Learning Repository. http://archive.ics.uci.edu/ml/.
Gentle, J. 2007. Solutions that Minimize Other Norms of the Residuals. New York: Springer.
Ghoting, A.; Otey, M. E.; Parthasarathy, S.; and Ohio, T.2004. Loaded: Link-based outlier and anomaly detection in evolving data sets. In Proceedings of the 4th IEEE ICDM, 387390.
Otey, M. E.; Parthasarathy, S.; and Ghoting, A. 2006. Fast lightweight outlier detection in mixed-attribute data sets.DMKD.
Piatetsky-Shapiro, G.; Djeraba, C.; Getoor, L.; Grossman, R.; Feldman, R.; and Zaki, M. 2006. What are the grand challenges for data mining?: Kdd-2006 panel report.SIGKDD Explor. Newsl. 8(2):7077.
Press, W.; Teukolsky, S.; Vetterling, W.; and Flannery, B.2007. Section 7.9.1 Importance Sampling. New York: Cambridge University Press.
Ramaswamy, S.; Rastogi, R.; and Shim, K. 2000. Efficient algorithms for mining outliers from large data sets. SIGMOD Rec. 29(2):427438.
Riani, M.; Atkinson, A. C.; and Cerioli, A. 2009. Finding an unknown number of multivariate outliers. Journal of the Royal Stats Society Series B 71(2):447466.
Rue, H.; Martino, S.; and Chopin, N. 2009. Approximate bayesian inference for latent gaussian models by using integrated nested laplace approximations. Journal of the Royal Stats Society Series B 71(2):319392.
Steuer, R. E.; Kurths, J.; Daub, C. O.; Weise, J.; and Selbig, J. 2002. The mutual information: Detecting and evaluating dependencies between variables. In ECCB, 231240.
Tyler, D. E. 2008. Robust statistics: Theory and methods.Journal of the American Statistical Association 103:888 889.
Yang, Q., andWu, X. 2006. 10 challenging problems in data mining research. IJITDM 5(04):597604.
-----0
Charikar, M. S. 2002. Similarity estimation techniques from rounding algorithms. ACM Symposium on Theory of Computing, 380388. New York, NY, USA: ACM.
Datar, M.; Immorlica, N.; Indyk, P.; and Mirrokni, V. S.2004. Locality-sensitive hashing scheme based on p-stable distributions. In Symposium on Computational Geometry.
Gionis, A.; Indyk, P.; and Motwani, R. 1999. Similarity search in high dimensions via hashing. In Very Large Data Bases.
Gong, Y., and Lazebnik, S. 2011. Iterative quantization: A procrustean approach to learning binary codes. In IEEE International Conference on Computer Vision and Pattern Recognition, 817 824.
He, J.; Chang, S.-F.; Radhakrishnan, R.; and Bauer, C. 2011.Compact hashing with joint optimization of search accuracy and time. In IEEE International Conference on Computer Vision and Pattern Recognition, 753760.
He, J.; Kumar, S.; and Chang, S.-F. 2012. On the difficulty of nearest neighbor search. In International Conference on Machine Learning.
Heo, J.-P.; Lee, Y.; He, J.; Chang, S.-F.; and Yoon, S.-E.2012. Spherical hashing. In IEEE International Conference on Computer Vision and Pattern Recognition, 29572964.
Indyk, P., and Motwani, R. 1998. Approximate nearest neighbors: towards removing the curse of dimensionality. In ACM Symposium on Theory of Computing.
Jegou, H.; Douze, M.; and Schmid, C. 2011. Product quantization for nearest neighbor search. IEEE Trans.
Pattern Anal. Mach. Intell. 33(1):117128.Joly, A., and Buisson, O. 2011. Random maximum margin hashing. In IEEE International Conference on Computer Vision and Pattern Recognition, 873880.
Kong, W., and Li, W.-J. 2012. Double-bit quantization for hashing. In AAAI Conference on Artificial Intelligence.
Kulis, B., and Grauman, K. 2009. Kernelized localitysensitive hashing for scalable image search. In IEEE International Conference on Computer Vision.Kumar, S., and Udupa, R. 2011. Learning hash functions for cross-view similarity search. In Proceedings of the Twenty-Second international joint conference on Artificial Intelligence, 13601365. AAAI Press.
Liu, H., and Yan, S. 2010. Robust graph mode seeking by graph shift. In International Conference on Machine Learning, 671678.
Liu, W.; Wang, J.; Kumar, S.; and Chang, S.-F. 2011. Hashing with graphs. In International Conference on Machine Learning.
Liu, X.; He, J.; Lang, B.; and Chang, S.-F. 2013. Hash bit selection: a unified solution for selection problems in hashing. In IEEE International Conference on Computer Vision and Pattern Recognition.
Lv, Q.; Josephson, W.; Wang, Z.; Charikar, M.; and Li, K. 2007. Multi-probe lsh: efficient indexing for highdimensional similarity search. In Proceedings of the 33rd international conference on Very large data bases, 950961.
Mu, Y., and Yan, S. 2010. Non-metric locality-sensitive hashing. In Fox, M., and Poole, D., eds., AAAI Conference on Artificial Intelligence. AAAI Press.
Norouzi, M.; Punjani, A.; and Fleet, D. J. 2012. Fast search in hamming space with multi-index hashing. In IEEE Conference on Computer Vision and Pattern Recognition, 31083115.
Pavan, M., and Pelillo, M. 2007. Dominant sets and pairwise clustering. IEEE Trans. Pattern Anal. Mach. Intell. 167172.
Slaney, M.; Lifshits, Y.; and He, J. 2012. Optimal parameters for locality-sensitive hashing. Proceedings of the IEEE 100(9):26042623.
Wang, J.; Kumar, S.; and Chang, S.-F. 2012. Semisupervised hashing for large scale search. Pattern Analysis and Machine Intelligence, IEEE Transactions on.
Weiss, Y.; Torralba, A.; and Fergus, R. 2008. Spectral hashing. In Advances in Neural Information Processing Systems.
Xu, H.; Wang, J.; Li, Z.; Zeng, G.; Li, S.; and Yu, N. 2011.Complementary hashing for approximate nearest neighbor search. In IEEE International Conference on Computer Vision.
Yan, S.; Xu, D.; Zhang, B.; Zhang, H.; Yang, Q.; and Lin, S.2007. Graph embedding and extensions: A general framework for dimensionality reduction. IEEE Trans. Pattern Anal. Mach. Intell. 29(1):4051.
Zhang, D.; Wang, F.; and Si, L. 2011. Composite hashing with multiple information sources. In ACM SIGIR Conference on Research and Development in Information Retrieval.
Zhao, Z.; Wang, L.; and Liu, H. 2010. Efficient spectral feature selection with minimum redundancy. In AAAI Conference on Artificial Intelligence.
Zhen, Y., and Yeung, D.-Y. 2012. Co-regularized hashing for multimodal data. In Advances in Neural Information Processing Systems.
-----0
Boerkoel, J., and Durfee, E. 2010. A comparison of algorithms for solving the multiagent simple temporal problem.In Proc. of ICAPS-10, 2633.
Boerkoel, J., and Durfee, E. 2011. Distributed algorithms for solving the multiagent temporal decoupling problem. In Proc. of AAMAS-11, 141148.
Boerkoel, J., and Durfee, E. 2012. A distributed approach to summarizing spaces of multiagent schedules. In Proc. of AAAI-12, 17421748.
Boerkoel, J. C., and Durfee, E. H. 2013. Distributed Reasoning for Multiagent Simple Temporal Problems. Journal of Artificial Intelligence Research (JAIR), To Appear.
Dechter, R.; Meiri, I.; and Pearl, J. 1991. Temporal constraint networks. In Knowledge Representation, volume 49, 6195.
Dutertre, B., and Moura, L. D. 2006. The YICES SMTsolver. Technical report, SRI International. Available at http://yices.csl.sri.com/tool-paper.pdf.
Floyd, R. 1962. Shortest path. Communications of the ACM 5(6):345.
Hunsberger, L. 2002. Algorithms for a temporal decoupling problem in multi-agent planning. In Proc. of AAAI-02, 468 475.
Oliehoek, F. A.; Witwicki, S. J.; and Kaelbling, L. P. 2012.Influence-based abstraction for multiagent systems. In Proc.of AAAI-12, 14221428.
Planken, L. R.; de Weerdt, M. M.; and Witteveen, C. 2010.Optimal temporal decoupling in multiagent systems. In Proc.of AAMAS-10, 789796.
Stergiou, K., and Koubarakis, M. 2000. Backtracking algorithms for disjunctions of temporal constraints. Artificial Intelligence 120(1):81117.
Tsamardinos, I., and Pollack, M. 2003. Efficient solution techniques for disjunctive temporal reasoning problems. Artificial Intelligence 151(1-2):4389.
Wilcox, R.; Nikolaidis, S.; and Shah, J. 2012. Optimization of temporal dynamics for adaptive human-robot interaction in assembly manufacturing. In Proc. of RSS-12, 5663.
-----0
Arthur, D., and Vassilvitskii, S. 2007. k-means++: the advantages of careful seeding. In Proceedings of the 18th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), 10271035.
Buttou, L., and LeCun, Y. 2004. Large scale online learning.In Proceedings of Advances in Neural Information Processing Systems (NIPS), 217224.
Chang, C.-C., and Lin, C.-J. 2011. LIBSVM: a library for support vector machines. ACM Transactions on Intelligent Systems and Technology, 2(3): 27.
Duan, K., and Keerthi, S. S. 2005. Which is the best multiclass SVM method? An empirical study. In Proceedings of the 6th International Workshop on Multiple Classifier Systems, 278285.
Farhardi, A., Endres, I., Hoiem, D., and Forsyth, D. 2009.Describing objects by their attributes. In Proceedings of IEEE Conference on Computer Vision and Pattern Recognition (CVPR), 17781785.
Felzenszwalb, P. F., Girshick, R. B., McAllester, D., and Ramanan, D. 2010. Object detection with discriminatively trained part-based models. IEEE Transactions on Pattern Analysis and Machine Intelligence (PAMI), 23(9): 1627 1645.
Gomes, R., Welling, M., and Perona, P. 2008. Incremental learning of nonparametric Bayesian mixture models. In Proceedings of IEEE Conference on Computer Vision and Pattern Recognition (CVPR), 18.
Kankuekul, P., Kawewong, A., Tangruamsub, S., and Hasegawa, O. 2012. Online incremental attribute-based zero-shot learning. In In Proceedings of IEEE Conference on Computer Vision and Pattern Recognition (CVPR), 3657 3664.
Kohonen, T. 1990. The self-organizing map. Proceedings of the IEEE, 78(9): 14641480.
Lampert, C. H., Nickisch, H., and Harmeling, S. 2009.Learning to detect unseen object classes by between-class attribute transfer. In Proceedings of IEEE Conference on Computer Vision and Pattern Recognition (CVPR), 951 958.
Lazebnik, S., Schmid, C., and Ponce, J. 2006. Beyond bags of features: Spatial pyramid matching for recognizing natural scene categories. In Proceedings of IEEE Conference on Computer Vision and Pattern Recognition (CVPR), 2169 2178.
Lin, H.-T., Lin, C.-J., and Weng, R. C. 2007. A note on Platts probabilistic outputs for support vector machines. Machine Learning, 68: 267276.
Li-Jia, L., Hao, S., and Fei-Fei, L. 2010. Object bank: A high-level image representation for scene classification and semantic feature sparsification. In Proceedings of Advances in Neural Information Processing Systems (NIPS), 1378 1386.
Oliva, A., and Torralba, A. 2001. Modeling the shape of the scene: a holistic representation of the spatial envelope. International Journal of Computer Vision (IJCV), 42(3): 145 175.
Pandey, M., and Lazebnik, S. 2011. Scene recognition and weakly supervised object localization with deformable partbased models. In Proceedings of IEEE Interntaional Conference on Computer Vision (ICCV), 13071314.
Platt, J. C. 2000. Probabilistic outputs for support vector machines and comparison to regularized likelihood methods.
Advances in Large Margin Classifiers, MIT Press.Quattoni, A., and Torralba, A. 2009. Recognizing indoor scenes. In Proceedings of IEEE Conference on Computer Vision and Pattern Recognition (CVPR), 413420.
Shen, F., and Hasegawa, O. 2006. An incremental network for on-line unsupervised classification and topology learning. Neural Networks, 19(1): 90106.
Sivic, J., and Zisserman, A. 2003. Video Google: A text retrieval approach to object matching in videos. In Proceedings of IEEE International Conference on Computer Vision (ICCV), 14701477.
Tangruamsub, S., Tsuboyama, M., Kawewong, A., and Hasegawa, O. 2009. Mobile robot vision-based navigation using self-organizing and incremental neural networks. In Proceedings of International Joint Conference on Neural Networks (IJCNN), 3094-3101.
Torralba, A., Murphy, K., Freeman, W., and Rubin, M. 2003.Context-based vision system for place and object recognition. In Proceedings of IEEE International Conference on Computer Vision (ICCV), 273280.
Valgren, C., and Lilienthal, A. 2008. Incremental spectral clustering and seasons: Appearance-based localization in outdoor environments. In Proceedings of IEEE International Conference on Robotics and Automation (ICRA), 1856 1861.
Wu, J., and Rehg, J. M. 2011. CENTRIST: a visual descriptor for scene categorization. IEEE Transactions on Pattern Analysis and Machine Intelligence (PAMI), 33(8): 1489 1501.
Zhu, J., Li-Jia, L., Fei-Fei, L., and Xing, E. P. 2010. Large margin learning of upstream scene understanding models. In Proceedings of Advances in Neural Information Processing Systems (NIPS), 25862594.
-----0
Bacchus, F., and Kabanza, F. 2000. Using temporal logics to express search control knowledge for planning. Artificial Intelligence 116(1-2):123191.
Balduccini, M. 2011. Learning and using domain-specific heuristics in ASP solvers. AI Communic. 24(2):147164.Baral, C. 2003. Knowledge Representation, Reasoning and Declarative Problem Solving. Cambridge University Press.
Biere, A.; Heule, M.; van Maaren, H.; and Walsh, T., eds.2009. Handbook of Satisfiability, volume 185 of Frontiers in Artificial Intelligence and Applications. IOS Press.
Calimeri, F. et al. 2011. The third answer set programming competition: Preliminary report of the system competition track. In Delgrande and Faber (2011), 388403.
Castell, T.; Cayrol, C.; Cayrol, M.; and Le Berre, D. 1996.Using the Davis and Putnam procedure for an efficient computation of preferred models. In Wahlster, W., ed., Proceedings of the Twelfth European Conference on Artificial Intelligence (ECAI96), 350354. John Wiley & sons.
Dechter, R. 2003. Constraint Processing. Morgan Kaufmann.
Delgrande, J., and Faber, W., eds. 2011. Proceedings of the Eleventh International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR11). Springer.
Di Rosa, E.; Giunchiglia, E.; and Maratea, M. 2010. Solving satisfiability problems with preferences. Constraints 15(4):485515.
Faber, W.; Leone, N.; Maratea, M.; and Ricca, F. 2007.Experimenting with look-back heuristics for hard ASP programs. In Baral, C.; Brewka, G.; and Schlipf, J., eds., Proceedings of the Ninth International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR07), 110122. Springer.
Faber, W.; Leone, N.; and Pfeifer, G. 2001. Experimenting with heuristics for answer set programming. In Nebel, B., ed., Proceedings of the Seventeenth International Joint Conference on Artificial Intelligence (IJCAI01), 635640.Morgan Kaufmann.
Freeman, J. 1995. Improvements to Propositional Satisfiability Search Algorithms. Ph.D. Dissertation, University of Pennsylvania.
Gebser, M.; Guziolowski, C.; Ivanchev, M.; Schaub, T.; Siegel, A.; Thiele, S.; and Veber, P. 2010. Repair and prediction (under inconsistency) in large biological networks with answer set programming. In Lin, F., and Sattler, U., eds., Proceedings of the Twelfth International Conference on Principles of Knowledge Representation and Reasoning (KR10), 497507. AAAI Press.
Gebser, M.; Kaminski, R.; Knecht, M.; and Schaub, T. 2011.plasp: A prototype for PDDL-based planning in ASP. In Delgrande and Faber (2011), 358363.
Gebser, M.; Kaminski, R.; Kaufmann, B.; Schaub, T. 2012.Answer Set Solving in Practice. Morgan and Claypool.
Giunchiglia, E., and Maratea, M. 2012. Algorithms for solving satisfiability problems with qualitative preferences. In Erdem, E.; Lee, J.; Lierler, Y.; and Pearce, D., eds., Correct Reasoning: Essays on Logic-Based AI in Honour of Vladimir Lifschitz, 327344. Springer.
Goldberg, E., and Novikov, Y. 2002. BerkMin: A fast and robust SAT solver. In Proceedings of the Fifth Conference on Design, Automation and Test in Europe (DATE02), 142 149. IEEE Computer Society Press.hclasp. http://www.cs.uni-potsdam.de/hclasp.ICAPS. http://ipc.icaps-conference.org.
Jarvisalo, M.; Junttila, T.; and Niemela, I. 2005. Unrestricted vs restricted cut in a tableau method for Boolean circuits. Annals of Mathematics and Artificial Intelligence 44(4):373399.
Korf, R. 1985. Depth-first iterative-deepening: An optimal admissible tree search. Artificial Intelligence 27(1):97109.
Lifschitz, V. 2002. Answer set programming and plan generation. Artificial Intelligence 138(1-2):3954.
Marques-Silva, J., and Sakallah, K. 1999. GRASP: A search algorithm for propositional satisfiability. IEEE Transactions on Computers 48(5):506521.
Moskewicz, M.; Madigan, C.; Zhao, Y.; Zhang, L.; and Malik, S. 2001. Chaff: Engineering an efficient SAT solver.
In Proceedings of the Thirty-eighth Conference on Design Automation (DAC01), 530535. ACM Press.
Pipatsrisawat, K., and Darwiche, A. 2007. A lightweight component caching scheme for satisfiability solvers. In 
Marques-Silva, J., and Sakallah, K., eds., Proceedings of the Tenth International Conference on Theory and Applications of Satisfiability Testing (SAT07), 294299. Springer.
Pretolani, D. 1996. Efficiency and stability of hypergraph SAT algorithms. In Johnson, D., and Trick, M., eds., DIMACS Series in Discrete Mathematics and Theoretical Computer Science, volume 26, 479498. American Mathematical Society.
Rintanen, J. 2011. Planning with SAT, admissible heuristics and A?. In Walsh (2011), 20152020.
Rintanen, J. 2012. Planning as satisfiability: heuristics. Artificial Intelligence 193:4586.
Schaub, T., and Thiele, S. 2009. Metabolic network expansion with ASP. In Hill, P., and Warren, D., eds., Proceedings of the Twenty-fifth International Conference on Logic Programming (ICLP09), 312326. Springer.
Siddiqi, S. 2011. Computing minimum-cardinality diagnoses by model relaxation. In Walsh (2011), 10871092.
Sierra-Santibanez, J. 2004. Heuristic planning: A declarative approach based on strategies for action selection. Artificial Intelligence 153(1-2):307337.
Walsh, T., ed. 2011. Proceedings of the Twenty-second International Joint Conference on Artificial Intelligence (IJCAI11). IJCAI/AAAI.
Zhang, L.; Madigan, C.; Moskewicz, M.; and Malik, S.2001. Efficient conflict driven learning in a Boolean satisfiability solver. In Proceedings of the International Conference on Computer-Aided Design (ICCAD01), 279285.ACM Press.
-----0
Ahuja, R.; Magnanti, T.; and Orlin, J. 1993. Network Flows: Theory, Algorithms, and Applications. Prentice Hall.
Arrow, K. J., and amd K. Suzumura, A. K. S. 2002. Handbook of Social Choice and Welfare. North-Holland.
Bacchus, F., and Grove, A. 1995. Graphical models for preference and utility. In UAI.
Bartholdi, J. J.; Tovey, C. A.; and Trick, M. A. 1992. How hard is it to control an election. In Mathematical and Computer Modeling, 2740.
Bistarelli, S.; Montanari, U.; and Rossi, F. 1997. Semiringbased constraint solving and optimization. Journal of the ACM 44(2):201236.
Bodlaender, H. L. 1998. A partial k-arboretum of graphs with bounded treewidth. Theoretical Computer Science 209(12):145.
Boutilier, C.; Brafman, R. I.; Domshlak, C.; Hoos, H. H.; and Poole, D. 2004. CP-nets: A tool for representing and reasoning with conditional ceteris paribus preference statements.JAIR 21(1):135191.
Brafman, R. I.; Rossi, F.; Salvagnin, D.; Venable, K. B.; and Walsh, T. 2010. Finding the next solution in constraintand preference-based knowledge representation formalisms. In Proc. KR 2010.
Christian, R.; Fellows, M.; Rosamond, F.; and Slinko, A.2007. On complexity of lobbying in multiple referenda. Review of Economic Design 11(3):217224.
Dalla Pozza, G.; Pini, M. S.; Rossi, F.; and Venable, K. B.2011. Multi-agent soft constraint aggregation via sequential voting. In IJCAI, 172177.
Dalla Pozza, G.; Rossi, F.; and Venable, K. B. 2011. Multiagent soft constraint aggregation:a sequential approach. In ICAART, 277282.
Dechter, R. 2006. Tractable structures for CSPs. In Rossi, F.; Van Beek, P.; and Walsh, T., eds., Handbook of Constraint Programming. Elsevier.
Elkind, E.; Faliszewski, P.; and Slinko, A. 2009. Swap bribery. Algorithmic Game Theory 299310.
Faliszewski, P.; Hemaspaandra, E.; Hemaspaandra, L. A.; and Rothe, J. 2007. Llull and copeland voting broadly resist bribery and control. In Proceedings of AAAI07, 724730.
Faliszewski, P.; Hemaspaandra, E.; and Hemaspaandra, L.2009. How hard is bribery in elections? JAIR 35:485532.
Faliszewski, P. 2008. Nonuniform bribery. In Proc. AAMAS 2008, 15691572.
Gibbard, A. 1973. Manipulation of voting schemes: A general result. Econometrica 41:587601.
Kemeny, J. G. 1959. Mathematics without numbers.Daedalus 88:571591.
Lang, J., and Xia, L. 2009. Sequential composition of voting rules in multi-issue domains. Mathematical Social Sciences 57(3):304324.
Mattei, N.; Pini, M. S.; Venable, K. B.; and Rossi, F. 2012a.Bribery in voting over combinatorial domains is easy. In Proceedings of ISAIM12.
Mattei, N.; Pini, M. S.; Venable, K. B.; and Rossi, F. 2012b.Bribery in voting over combinatorial domains is easy (extended abstract). In Proceedings of AAMAS12, 14071408.
Mattei, N.; Pini, M. S.; Venable, K. B.; and Rossi, F. 2013.Bribery in voting with CP-nets. Annals of Mathematics and Artificial Intelligence.
Pini, M. S.; Venable, K. B.; and Rossi, F. 2013. Resistance to bribery when aggregating soft constraints (extended abstract).In Proceedings of AAMAS13.
Rollon, E.; Flerova, N.; and Dechter, R. 2011. Inference schemes for m best solutions for soft CSPs. In Proc.SOFT11.
Rossi, F.; Van Beek, P.; and Walsh, T. 2006. Handbook of Constraint Programming. Elsevier.
Thorup, M. 1998. All structured programs have small tree width and good register allocation. Information and Computation 142(2):159181.
-----0
Agarwal, P.; Vaithiyanathan, R.; Sharma, S.; and Shroff, G.2012. Catching the long-tail: Extracting local news events from twitter. In Proceedings of Association for the Advancement of Artificial Intelligence.
Backstrom, L.; Sum, E.; and Marlow, C. 2010. Find me if you can: Improving geographical prediction with social and spatial proximity. In Proceedings of the International Conference on World Wide Web.
Blei, D. M.; Ng, A. Y.; and Jordan, M. I. 2003. Latent dirichlet allocation. Journal of Machine Learning Research 3:9931022.
Chen, Y.; Li, Z.; Nie, L.; Hu, X.; Wang, X.; Chua, T. S.; and Zhang, X. 2012. A semi-supervised bayesian network model for microblog topic classification. In Proceedings of the International Conference on Computational Linguistics.
Cheng, C.; Yang, H.; King, I.; and Lyu, M. R. 2012. Catching the long-tail: Extracting local news events from twitter. In Proceedings of Association for the Advancement of Artificial Intelligence.
Cheng, Z.; Caverlee, J.; and Lee, K. 2010. You are where you tweet: A content-based approach to geo-locating twitter users. In Proceedings of ACM Conference on Information and Knowledge Management.
Cho, E.; Myers, S. A.; and Leskovec, J. 2011. Friendship and mobility: User movement in location-based social networks. In Proceedings of ACM SIGKDD international conference on Knowledge discovery and data mining.
Crandall, D. J.; Backstrom, L.; Cosley, D.; Suri, S.; Huttenlocher, D.; and Kleinberg, J. 2010. Inferring social ties from geographic coincidences. Proceedings of the National Academy of Sciences 107:2243622441.
Diao, Q.; Jiang, J.; Zhu, F.; and Lim, E. P. 2012. Finding bursty topics from microblogs. In Proceedings of Association for Computational Linguistics.
Eubank, S.; Guclu, H.; Anil Kumar, V. S.; Marathe, M. V.; Aravind, S.; Toroczkai, Z.; and Wang, N. 2004. Modelling disease outbreaks in realistic urban social networks. Nature 429:180184.
Gao, H.; Tang, J.; and Liu, H. 2012. Exploring socialhistorical ties on location-based social networks. In Proceedings of Association for the Advancement of Artificial Intelligence.
Guimera, R.; Llorente, A.; Moro, E.; and Sales-Pardo, M.2012. Predicting human preferences using the block structure of complex social networks. PLoS ONE 7:e44620.
Heatherly, R.; Kantarcioglu, M.; and Thuraisingham, B.2009. Social network classification incorporating link type. In Proceedings of IEEE Intelligence and Security Informatics.
Henderson, K.; Eliassi-Rad, T.; Papadimitriou, S.; and Faloutsos, C. 2010. Hcdf: A hybrid community discovery framework. In Proceedings of the SIAM International Conference on Data Mining.
Lindamood, J.; Heatherly, R.; Kantarcioglu, M.; and Thuraisingham, B. 2009. Inferring private information using social network data. In Proceedings of the International Conference on World Wide Web.
Mahmud, J.; Nichols, J.; and Drews, C. 2012. Where is this tweets from? Inferring home location of twitter users. In Proceedings of Association for the Advancement of Artificial Intelligence.
Mok, D., and Wellman, B. 2007. Did distance matter before the internet? interpersonal contact and support in the 1970s.Social networks 29:430461.
Pathak, N.; DeLong, C.; Banerjee, A.; and Erickson, K.2008. Social topics models for community extraction. In Proceedings of the 2nd SNA-KDD Workshop.
Phelan, O.; McCarthy, K.; and Smyth, B. 2009. Using twitter to recommend real-time topical news. In Proceedings of ACM conference on Recommender systems.
Roller, S.; Speriosu, M.; Rallapalli, S.; Wing, B.; and Baldridge, J. 2012. Supervised text-based geolocation using language models on an adaptive grid. In Proceedings of International Conference on Empirical Methods in Natural Language Processing.
Sachan, M.; Contractor, D.; Faruquie, T. A.; and Subramaniam, L. V. 2011. Probabilistic model for discovering topic based communities in social networks. In Proceedings of ACM Conference on Information and Knowledge Management.
Sadilek, A.; Kautz, H.; and Bigham, J. P. 2012. Finding your friends and following them to where you are. In Proceedings of ACM Conference on Web Search and Data Mining.
Sakaki, T.; Okazaki, M.; and Matsuo, Y. 2010. Earthquake shakes twitter users: real time event detection by social sensors. In Proceedings of the International Conference on World Wide Web.
Song, C.; Qu, Z.; Blumm, N.; and Barabasi, A. L. 2010.Limits of predictabilility in human mobility. Science 327:10181021.
Yardi, S., and Boyd, D. 2010. Tweeting from the town square: Measuring geographic local networks. In Proceedings of the International AAAI Conference on Weblogs and Social Media.
Zhang, H.; Giles, C. L.; Foley, H. C.; and Yen, J. 2007.Probabilistic community discovery using hierarchical latent gaussian mixture model. In Proceedings of Association for the Advancement of Artificial Intelligence.
Zhao, J.; Dong, L.; Wu, J.; and Xu, K. 2012. Moodlens: an emoticon-based sentiment analysis system for chinese tweets. In Proceedings of ACM SIGKDD international conference on Knowledge discovery and data mining.
Zheng, V. W.; Zheng, Y.; Xie, X.; and Yang, Q. 2010. Collaborative location and activity recommendations with GPS history data. In Proceedings of the International Conference on World Wide Web.
Zhou, D.; Manavoglu, E.; Li, J.; Giles, C. L.; and Zha, H.2006. Probabilistic models for discovering e-communities. In Proceedings of the International Conference on World Wide Web.
-----0
Beis, J. S., and Lowe, D. G. 1997. Shape indexing using approximate nearest-neighbour search in high-dimensional spaces. In Proceedings of the IEEE International Conference on Computer Vision and Pattern Recognition (CVPR), 10001006. San Juan, Puerto Rico: IEEE Computer Society.
Chebotarev, P. 2011. A class of graph-geodetic distances generalizing the shortest-path and the resistance distances.
Discrete Applied Mathematics 159(5):295302.Dijkstra, E. W. 1959. A note on two problems in connexion with graphs. Numerische Mathematik 1:269271.
Fouss, F.; Pirotte, A.; Renders, J. M.; and Saerens, M. 2007.Random-walk computation of similarities between nodes of a graph with application to collaborative recommendation.IEEE Trans. Knowledge and Data Engineering 19(3):355 369.
Fouss, F.; Francoisse, K.; Yen, L.; Pirotte, A.; and Saerens, M. 2012. An experimental investigation of kernels on graphs for collaborative recommendation and semisupervised classification. Neural Networks 31:5372.
Fredman, M. L., and Tarjan, R. E. 1987. Fibonacci heaps and their uses in improved network optimization algorithms.Journal of the ACM 34(3):596615.
Georghiades, A. S.; Belhumeur, P. N.; and Kriegman, D. J.2001. From few to many: Illumination cone models for face recognition under variable lighting and pose. IEEE Trans.Pattern Analysis and Machine Intelligence 23(6):643660.
Goldberger, J.; Roweis, S.; Hinton, G.; and Salakhutdinov, R. 2005. Neighbourhood components analysis. In Advances in Neural Information Processing Systems (NIPS), volume 17, 513520. Vancouver, Canada: MIT Press.
Gower, J. C., and Ross, G. J. S. 1969. Minimum spanning tree and single-linkage cluster analysis. Applied Statistics 18:5464.
Kim, K.-H., and Choi, S. 2007. Neighbor search with global geometry: A minimax message passing algorithm. In Proceedings of the International Conference on Machine Learning (ICML), 401408. Corvallis, Oregon, USA: ACM.
Lee, K.-C.; Ho, J.; and Kriegman, D. 2005. Acquiring linear subspaces for face recognition under variable lighting. IEEE Trans. Pattern Analysis and Machine Intelligence 27(5):1 15.
Luo, H.; Niu, C.; Shen, R.; and Ullrich, C. 2008. A collaborative filtering framework based on both local user similarity and global user similarity. Machine Learning 72(3):231 245.
Mantrach, A.; Yen, L.; Callut, J.; Francoisse, K.; Shimbo, M.; and Saerens, M. 2010. The sum-over-paths covariance kernel: A novel covariance measure between nodes of a directed graph. IEEE Trans. Pattern Analysis and Machine Intelligence 32(6):338361.
Mobahi, H.; Collobert, R.; and Weston, J. 2009. Deep learning from temporal coherence in video. In Proceedings of the International Conference on Machine Learning (ICML), 737744. Montreal, Canada: ACM.
Nene, S. A.; Nayar, S. K.; and Murase, H. 1996. Columbia object image library (COIL-100). Technical Report CUCS006-96, Department of Computer Science, Columbia University.
Pollack, M. 1960. The maximum capacity through a network. Operation Research 8(5):733736.
Samet, H. 2005. Foundations of Multidimensional and Metric Data Structures. San Francisco, California, USA: Morgan Kaufmann Publishers Inc.
Tenenbaum, J. B.; de Silva, V.; and Langford, J. C. 2000.A global geometric framework for nonlinear dimensionality reduction. Science 290:23192323.
Weinberger, K. Q., and Saul, L. K. 2009. Distance metric learning for large margin nearest neighbor classification.Journal of Machine Learning Research 10:207244.
Xing, E. P.; Ng, A. Y.; Jordan, M. I.; and Russel, S. 2003.Distance metric learning, with application to clustering with side-information. In Advances in Neural Information Processing Systems (NIPS), volume 15, 505512. Vancouver, Canada: MIT Press.
Yen, L.; Fouss, F.; Decaestecker, C.; Francq, P.; and Saerens, M. 2009. Graph nodes clustering with the sigmoid commute-time kernel: A comparative study. Data & Knowledge Engineering 68(3):338361.
Yen, L.; Mantrach, A.; and Shimbo, M. 2008. A family of dissimilarity measures between nodes generalizing both the shortest-path and the commute-time distances. In Proceedings of the ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD), 785793.Las Vegas, Nevada, USA: ACM.
Zadeh, R. B., and Ben-David, S. 2009. A uniqueness theorem for clustering. In Proceedings of the International Conference on Uncertainty in Artificial Intelligence (UAI), 639 646. Montreal, Canada: AUAI Press.
-----0
Belkin, M.; Niyogi, P.; and Sindhwani, V. 2006. Manifold regularization: A geometric framework for learning from labeled and unlabeled examples. The Journal of Machine Learning Research 7:23992434.
Boutell, M.; Luo, J.; Shen, X.; and Brown, C. 2004. Learning multi-label scene classification. Pattern recognition 37(9):17571771.
Chen, G.; Song, Y.; Wang, F.; and Zhang, C. 2008. Semisupervised multi-label learning by solving a sylvester equation. In SIAM international conference on Data Mining, 410419.
Everingham, M.; Van Gool, L.; Williams, C. K. I.; Winn, J.; and Zisserman, A. The PASCAL Visual Object Classes Challenge 2007 (VOC2007) Results.
Guillaumin, M.; Verbeek, J.; and Schmid, C. 2010. Multimodal semi-supervised learning for image classification. In IEEE conference on Computer Vision and Pattern Recognition, 902909.
Hariharan, B.; Zelnik-Manor, L.; Vishwanathan, S.; and Varma, M. 2010. Large scale max-margin multi-label classification with priors. In International Conference on Machine Learning, 423430.
Hsu, D.; Kakade, S.; Langford, J.; and Zhang, T. 2009.Multi-label prediction via compressed sensing. In Advances in Neural Information Processing Systems, 772780.
Huiskes, M. J., and Lew, M. S. 2008. The MIR flickr retrieval evaluation. In ACM international conference on Multimedia Information Retrieval, 3943.
Kloft, M.; Brefeld, U.; Sonnenburg, S.; and Zien, A. 2011.Lp-norm multiple kernel learning. The Journal of Machine Learning Research 12:953997.
Lowe, D. 2004. Distinctive image features from scaleinvariant keypoints. International Journal of Computer Vision 60(2):91110.
Luo, Y.; Tao, D.; Geng, B.; Xu, C.; and Maybank, S. 2013.Manifold regularized multitask learning for semi-supervised multilabel image classification. IEEE Transaction on Image Processing 22(2):523536.
Micchelli, C., and Pontil, M. 2005. On learning vectorvalued functions. Neural Computation 17(1):177204.
Minh, H., and Sindhwani, V. 2011. Vector-valued manifold regularization. In International Conference on Machine Learning, 5764.
Oliva, A., and Torralba, A. 2001. Modeling the shape of the scene: A holistic representation of the spatial envelope.International Journal of Computer Vision 42(3):145175.
Rakotomamonjy, A.; Bach, F.; Canu, S.; and Grandvalet, Y.2008. SimpleMKL. Journal of Machine Learning Research 9:24912521.Scholkopf, B., and Smola, A. 2002. Learning with kernels: 
Support vector machines, regularization, optimization, and beyond. MIT press.
Sindhwani, V.; Niyogi, P.; and Belkin, M. 2005. A coregularization approach to semi-supervised learning with multiple views. In ICML Workshop on Learning with Multiple Views, 7479.
Strange, H., and Zwiggelaar, R. 2011. A generalised solution to the out-of-sample extension problem in manifold learning. In AAAI Conference on Artificial Intelligence.
Sun, L.; Ji, S.; and Ye, J. 2011. Canonical correlation analysis for multilabel classification: A least-squares formulation, extensions, and analysis. IEEE Transactions on Pattern Analysis and Machine Intelligence 33(1):194200.
Suzuki, I.; Hara, K.; Shimbo, M.; Matsumoto, Y.; and Saerens, M. 2012. Investigating the effectiveness of laplacian-based kernels in hub reduction. In AAAI Conference on Artificial Intelligence.
Van De Weijer, J., and Schmid, C. 2006. Coloring local feature extraction. European Conference on Computer Vision 334348.
Vu, H.; Carey, C.; and Mahadevan, S. 2012. Manifold warping: Manifold alignment over time. In AAAI Conference on Artificial Intelligence.
Yang, J., and Zhang, Y. 2011. Alternating direction algorithms for \ell 1-problems in compressive sensing. SIAM journal on scientific computing 33(1):250278.
Zhang, M. 2011. Lift: Multi-label learning with labelspecific features. In International Joint Conference on Artificial Intelligence, 16091614.
Zhou, Z.; Zhang, M.; Huang, S.; and Li, Y. 2012.Multi-instance multi-label learning. Artificial Intelligence 176(1):22912320.
Zhu, M. 2004. Recall, precision and average precision.Technical report, University of Waterloo.
-----0
Ambite, J. L., and Knoblock, C. A. 2001. Planning by rewriting. JAIR 15:207261.
Bylander, T. 1994. The computational complexity of propositional STRIPS planning. AIJ 69(12):165204.
Cafarella, M. J., and Re, C. 2010. Manimal: Relational optimization for data-intensive programs. In Proceedings of the 13th International Workshop on the Web and Databases 2010.
Chaiken, R.; Jenkins, B.; Larson, P.-A.; Ramsey, B.; Shakib, D.; Weaver, S.; and Zhou, J. 2008. SCOPE: easy and efficient parallel processing of massive data sets. Proc. VLDB Endow. 1(2):12651276.
Chien, S. A.; Fisher, F.; Lo, E.; Mortensen, H.; and Greeley, R. 1999. Using artificial intelligence planning to automate science image data analysis. Intelligent Data Analysis 3(3):159176.
Codd, E. F. 1970. A relational model of data for large shared data banks. CACM 13(6):377387.
Cohen, S. 2006. User-defined aggregate functions: bridging theory and practice. In Proc. SIGMOD 2006, 4960. ACM.
Dean, J., and Ghemawat, S. 2008. MapReduce: simplified data processing on large clusters. CACM 51(1):107113.
Fikes, R. E., and Nilsson, N. J. 1971. STRIPS: A new approach to the application of theorem proving to problem solving. AIJ 2:189208.
Fox, M., and Long, D. 2003. PDDL2.1: An extension to PDDL for expressing temporal planning domains. JAIR 20:61124.
Garey, M. R., and Johnson, D. S. 1979. Computers and Intractability  A Guide to the Theory of NP-Completeness.Freeman.
Golden, K. 2002. DPADL: An action language for data processing domains. In Proceedings of the 3rd NASA Intl.
Planning and Scheduling workshop, 2833.He, B.; Yang, M.; Guo, Z.; Chen, R.; Su, B.; Lin, W.; and Zhou, L. 2010. Comet: batched stream processing for data intensive distributed computing. In Proc SoCC 2010, 6374.
Helmert, M. 2006. The Fast Downward planning system.JAIR 26:191246.
Hoffmann, J., and Nebel, B. 2001. The FF planning system: Fast plan generation through heuristic search. JAIR 14:253 302.
Isard, M., and Yu, Y. 2009. Distributed data-parallel computing using a high-level programming language. In Proc.SIGMOD 2009, 987994. ACM.
Isard, M.; Budiu, M.; Yu, Y.; Birrell, A.; and Fetterly, D.2007. Dryad: distributed data-parallel programs from sequential building blocks. In Proc. SIGOPS/Eurosys 2007, 5972. ACM.
Karp, R. M. 1972. Reducibility among combinatorial problems. In Miller, R. E., and Thatcher, J. W., eds., Complexity of Computer Computations. Plenum Press. 85103.
Klug, A. 1982. Equivalence of relational algebra and relational calculus query languages having aggregate functions.JACM 29(3):699717.
Olston, C.; Reed, B.; Silberstein, A.; and Srivastava, U.2008a. Automatic optimization of parallel dataflow programs. In USENIX 2008, 267273.
Olston, C.; Reed, B.; Srivastava, U.; Kumar, R.; and Tomkins, A. 2008b. Pig latin: a not-so-foreign language for data processing. In Proc. SIGMOD 2008, 10991110.ACM.
Ozsu, M. T., and Valduriez, P. 2007. Principles of Distributed Database Systems. Upper Saddle River, NJ, USA: Prentice Hall Press, 3rd edition.
Padhy, R. P.; Patra, M. R.; and Satapathy, S. C. 2011.RDBMS to NoSQL: Reviewing Some Next-Generation Non-Relational Databases. International Journal of Advanced Engineering Science and Technologies 11(1).
Thusoo, A.; Sarma, J. S.; Jain, N.; Shao, Z.; Chakka, P.; Anthony, S.; Liu, H.; Wyckoff, P.; and Murthy, R. 2009.Hive: a warehousing solution over a map-reduce framework.Proc. VLDB Endow. 2(2):16261629.
Thusoo, A.; Sarma, J. S.; Jain, N.; Shao, Z.; Chakka, P.; Zhang, N.; Antony, S.; Liu, H.; and Murthy, R. 2010. Hive a petabyte scale data warehouse using hadoop. In Proc.ICDE 2010, 996  1005.
Ullman, J. D. 1988. Principles of Database and KnowledgeBase Systems. Volume I: Classical Database Systems. Computer Science Press.
Valduriez, P. 1993. Parallel database systems: Open problems and new issues. Distributed and Parallel Databases 1(2):137165.
-----0
Achanta, R.; Estrada, F.; Wils, P.; and Susstrunk, S. 2008.Salient region detection and segmentation. In Proc. of ICVS, 6675.
Achanta, R.; Hemami, S.; Estrada, F.; and Susstrunk, S.2009. Frequency-tuned salient region detection. In Proc.of CVPR, 15971604.
Adams, A.; Baek, J.; and Davis, M. A. 2010. Fast highdimensional filtering using the permutohedral lattice. Comput. Graph. Forum 29(2):753762.
Borji, A.; Sihite, D. N.; and Itti, L. 2012. Salient object detection: A benchmark. In Proc. of ECCV, 414429.
Cande`s, E.; Li, X.; Ma, Y.; and Wright, J. 2011. Robust principal component analysis? J. ACM 58(3):139.
Chen, C.-F.; Wei, C.-P.; and Wang, Y.-C. 2012. Low-rank matrix recovery with structural incoherence for robust face recognition. In Proc. of CVPR, 26182625.
Cheng, M.; Zhang, G.; Mitra, N. J.; Huang, X.; and Hu, S.2011. Global contrast based salient region detection. In Proc. of CVPR, 409416.
Comanicu, D., and Meer, P. 2002. Mean shift: A robust approach toward feature space analysis. IEEE PAMI 24(5):603619.
Feichtinger, H. G., and Strohmer, T. 1998. Gabor analysis and algorithms:theory and applications. Springer.
Felzenszwalb, P., and Huttenlocher, D. 2004. Efficient graph-based image segmentation. International Journal of Computer Vision 59(2):167181.
Goferman, S.; Manor, L. Z.; and Tal, A. 2010. Contextaware saliency detection. In Proc. of CVPR, 19151926.
Harel, J.; Koch, C.; and Perona, P. 2006. Graph-based visual saliency. In Proc. of NIPS, 545552.
Hou, X., and Zhang, L. 2007. Saliency detection: A spectral residual approach. In Proc. of CVPR, 18.
Itti, L.; Koch, C.; and Niebur, E. 1998. A model of saliencybased visual attention for rapid scene analysis. IEEE TPAMI 20(11):12541259.
Jenatton, R.; Mairal, J.; Obozinski, G.; and Bach, F. 2011.Proximal methods for hierarchical sparse coding. Journal of Machine Learning Research 12:22972334.
Jia, K.; Chan, T.; and Ma, Y. 2012. Robust and practical face recognition via structured sparsity. In Proc. of ECCV, 331344.
Khan, F. S.; Weijer, J. V. D.; and Vanrell, M. 2009. Topdown color attention for object recognition. In Proc. of ICCV, 979986.
Lang, C.; Liu, G.; Yu, J.; and Yan, S. 2012. Saliency detection by multitask sparsity pursuit. IEEE TIP 21(3):1327 1338.
Lin, Z.; Chen, M.; Wu, L.; and Ma, Y. 2009. The augmented lagrange multiplier method for exact recovery of corrupted low-rank matrices. UIUC Technical Report 09(2215):118.
Liu, J., and Ye, J. 2010. Moreau-yosida regularization for grouped tree structure learning. In Proc. of NIPS, 1459 1467.
Liu, T.; Sun, J.; Zheng, N.; and Tang, X. 2007. Learning to detect a salient object. In Proc. of CVPR, 18.
Ma, Y.-F., and Zhang, H.-J. 2003. Contrast-based image attention analysis by using fuzzy growing. In Proc. of ACM MM, 374381.
Oliva, A.; Torralba, A.; Casthelano, M.; and Henderson, J.2003. Top-down control of visual attention in object detection. In Proc. of ICIP, 253256.
Perazzi, F.; Krahenbuhl, P.; Pritch, Y.; and Hornung, A.2012. Saliency filters: Contrast based filtering for salient region detection. In Proc. of CVPR, 733740.
Rutishauser, U.; Walther, D.; Koch, C.; and Perona, P. 2004.Is bottom-up attention useful for object recognition? In Proc. of CVPR, 3744.
Shen, X., and Wu, Y. 2012. A unified approach to salient object detection via low rank matrix recovery. In Proc. of CVPR, 22962303.
Simoncelli, E. P., and Freeman, W. T. 1995. The steerable pyramid: A flexible architecture for multi-scale derivative computation. In Proc. of ICIP, 444447.
Zhai, Y., and Shah., M. 2006. Visual attention detection in video sequences using spatiotemporal cues. In Proc. of ACM MM, 815824.
Zhao, P.; Rocha, G.; and Yu, B. 2009. The composite absolute penalties family for grouped and hierarchical variable selection. Annals of Statistics 37(6):34683497.
-----0
Bennewitz, M.; Burgard, W.; and Thrun, S. 2002. Finding and optimizing solvable priority schemes for decoupled path planning techniques for teams of mobile robots. Robotics and Autonomous Systems 41(23):8999.
Brewka, G.; Eiter, T.; and Truszczynski, M. 2011. Answer set programming at a glance. Commun. ACM 54(12):92103.
Dantsin, E.; Eiter, T.; Gottlob, G.; and Voronkov, A. 2001.Complexity and expressive power of logic programming.ACM Computing Surveys 33(3):374425.
Dresner, K. M., and Stone, P. 2008. A multiagent approach to autonomous intersection management. J. Artif. Intell. Res.(JAIR) 31:591695.
Erdem, E., and Wong, M. D. F. 2004. Rectilinear steiner tree construction using answer set programming. In Proc. of ICLP, 386399.
Erdogan, S. T., and Lifschitz, V. 2004. Definitions in answer set programming. In Proc. of LPNMR, 114126.
Gebser, M.; Kaufmann, B.; Neumann, A.; and Schaub, T.2007. clasp: A conflict-driven answer set solver. In Proc. of LPNMR, 260265.
Gelfond, M., and Lifschitz, V. 1991. Classical negation in logic programs and disjunctive databases. New Generation Computing 9:365385.
Jansen, R., and Sturtevant, N. 2008. A new approach to cooperative pathfinding. In Proc. of AAMAS, 14011404.
Jennings, J.; Whelan, G.; and Evans, W. 1997. Cooperative search and rescue with a team of mobile robots. In Proc. of ICAR, 193200.
Khorshid, M. M.; Holte, R. C.; and Sturtevant, N. R. 2011.A polynomial-time algorithm for non-optimal multi-agent pathfinding. In Proc. of SOCS.
Kishimoto, A., and Sturtevant, N. R. 2008. Optimized algorithms for multi-agent routing. In Proc. of AAMAS, 1585 1588.
Kitano, H.; Tadokoro, S.; Noda, I.; Matsubara, H.; Takahashi, T.; Shinjou, A.; and Shimada, S. 1999. Robocup rescue: Search and rescue in large-scale disasters as a domain for autonomous agents research. In Proc. of IEEE SMC, 739746.IEEE Computer Society.
Lagoudakis, M. G.; Markakis, E.; Kempe, D.; Keskinocak, P.; Kleywegt, A. J.; Koenig, S.; Tovey, C. A.; Meyerson, A.; and Jain, S. 2005. Auction-based multi-robot routing. In Proc. of Robotics: Science and Systems, 343350.
Lifschitz, V. 2008. What is answer set programming? In Proc. of AAAI, 15941597. MIT Press.
Luna, R., and Bekris, K. E. 2011. Efficient and complete centralized multi-robot path planning. In Proc. of IROS, 32683275.
Machado, A.; Ramalho, G.; Zucker, J.-D.; and Drogoul, A.2002. Multi-agent patrolling: An empirical analysis of alternative architectures. In Proc. of MABS, 155170.
McCarthy, J. 1998. Elaboration tolerance. In Proc. of Commonsense.
Pallottino, L.; Scordio, V. G.; Bicchi, A.; and Frazzoli, E.2007. Decentralized cooperative policy for conflict resolution in multivehicle systems. IEEE Transactions on Robotics 23(6):11701183.
Ratner, D., and Warmuth, M. K. 1986. Finding a shortest solution for the n n extension of the 15-puzzle is intractable.In Proc. of AAAI, 168172.
Ryan, M. 2008. Exploiting subgraph structure in multi-robot path planning. J. Artif. Intell. Res. (JAIR) 31:497542.
Ryan, M. 2010. Constraint-based multi-robot path planning.In Proc. of ICRA, 922928.
Sharon, G.; Stern, R.; Goldenberg, M.; and Felner, A. 2011.The increasing cost tree search for optimal multi-agent pathfinding. In Proc. of IJCAI, 662667.
Silver, D. 2005. Cooperative pathfinding. In Proc. of AIIDE, 117122.
Smith, B. S.; Egerstedt, M.; and Howard, A. 2009. Automatic generation of persistent formations for multi-agent networks under range constraints. Mob. Netw. Appl. 14(3):322335.
Standley, T. S., and Korf, R. E. 2011. Complete algorithms for cooperative pathfinding problems. In Proc. of IJCAI, 668673.
Standley, T. S. 2010. Finding optimal solutions to cooperative pathfinding problems. In Proc. of AAAI.
Sturtevant, N. 2012. Benchmarks for grid-based pathfinding.Transactions on Computational Intelligence and AI in Games.
Surynek, P. 2009. An application of pebble motion on graphs to abstract multi-robot path planning. In Proc. of ICTAI, 151158.
Surynek, P. 2010. An optimization variant of multi-robot path planning is intractable. In Proc. of AAAI.
Svestka, P., and Overmars, M. H. 1998. Coordinated path planning for multiple robots. Robotics and Autonomous Systems 23(3):125152.
Tomlin, C.; Pappas, G. J.; Member, S.; Member, S.; and Sastry, S. 1998. Conflict resolution for air traffic management: A study in multiagent hybrid systems. IEEE Transactions on Automatic Control 43:509521.
Wang, K.-H. C., and Botea, A. 2008. Fast and memoryefficient multi-agent pathfinding. In Proc. of ICAPS, 380 387.
Wang, K.-H. C., and Botea, A. 2011. MAPP: a scalable multi-agent path planning algorithm with tractability and completeness guarantees. J. Artif. Intell. Res. (JAIR) 42:55 90.
Xu, L., and Stentz, A. 2011. An efficient algorithm for environmental coverage with multiple robots. In Proc. of ICRA, 49504955.
Yu, J., and LaValle, S. M. 2013. Planning optimal paths for multi robots on graphs. In Proc. of ICRA.
-----0
Boutilier, C.; Brafman, R.; Domshlak, C.; Hoos, H.; and Poole, D. 2004. Preference-based constrained optimization with CP-nets. Computational Intelligence 20:137157.
Brewka, G., and Eiter, T. 1999. Preferred answer sets for extended logic programs. Artificial Intelligence 109(1-2):297 356.
Brewka, G.; Benferhat, S.; and Le Berre, D. 2002. Qualitative choice logic. In Fensel, D.; Giunchiglia, F.; McGuinness, D. L.; and Williams, M.-A., eds., Proceedings of the 8th International Conference on Principles of Knowledge Representation and Reasoning (KR 2002), 158169. Morgan Kaufmann.
Brewka, G.; Niemela, I.; and Syrjanen, T. 2004. Logic programs with ordered disjunctions. Computational Intelligence 20(2):335357.
Buccafurri, F.; Leone, N.; and Rullo, P. 2000. Enhancing Disjunctive Datalog by Constraints. IEEE Transactions on Knowledge and Data Engineering 12(5):845860.
Delgrande, J. P.; Schaub, T.; Tompits, H.; and Wang, K.2004. A classification and survey of preference handling approaches in nonmonotonic reasoning. Computational Intelligence 20(2):308334.
Faber, W., and Konczak, K. 2006. Strong order equivalence. Annals of Mathematics and Artificial Intelligence 47(12):4378.
Faber, W.; Tompits, H.; and Woltran, S. 2008. Notions of strong equivalence for logic programs with ordered disjunction. In Brewka, G., and Lang, J., eds., Proceedings of the 11th International Conference on Principles of Knowledge Representation and Reasoning (KR 2008), 433443. AAAI Press.
Faber, W.; Truszczynski, M.; and Woltran, S. 2012.Strong equivalence of qualitative optimization problems. In 
Brewka, G.; Eiter, T.; and McIlraith, S. A., eds., Proceedings of the 13th International Conference onm Principles of Knowledge Representation and Reasoning (KR 2012), 188 198. AAAI Press.
Faber, W.; Truszczynski, M.; and Woltran, S. 2013. Abstract preference frameworks  a unifying perspective on separability and strong equivalence. Technical Report DBAITR-2013-81, Institute of Information Systems 184/2, Vienna University of Technology, Austria.
Goldsmith, J., and Junker, U., eds. 2008. Special Issue on Preferences, volume 29(4) of AI Magazine.
Goldsmith, J.; Lang, J.; Truszczynski, M.; and Wilson, N.2008. The computational complexity of dominance and consistency in CP-nets. Journal of Artificial Intelligence Research 33:403432.
Kaci, S. 2011. Working with Preferences. Springer.Lifschitz, V.; Pearce, D.; and Valverde, A. 2001. Strongly equivalent logic programs. ACM Transactions on Computational Logic 2(4):526541.
Simons, P.; Niemela, I.; and Soininen, T. 2002. Extending and implementing the stable model semantics. Artificial Intelligence 138:181234.
Simons, P. 1999. Extending the stable model semantics with more expressive rules. In Gelfond, M.; Leone, N.; and Pfeifer, G., eds., Proceedings of LPNMR99, volume 1730 of Lecture Notes in AI, 305316. Springer Verlag.
Turner, H. 2003. Strong equivalence made easy: nested expressions and weight constraints. Theory and Practice of Logic Programming 3:609622.
Wilson, N. 2004. Extending CP-nets with stronger conditional preference statements. In Proceedings of the 19th National Conference on Artificial Intelligence (AAAI 2004), 735741. AAAI Press.
-----0
Bessiere, C.; Regin, J.-C.; Yap, R. H.; and Zhang, Y. 2005.
An Optimal Coarse-Grained Arc Consistency Algorithm.Artificial Intelligence 165(2):165185.
Bessiere, C.; Stergiou, K.; and Walsh, T. 2008. Domain Filtering Consistencies for Non-Binary Constraints. Artificial Intelligence 172:800822.
Dechter, R., and Pearl, J. 1989. Tree Clustering for Constraint Networks. Artificial Intelligence 38:353366.
Dechter, R. 1996. Bucket Elimination: A Unifying Framework for Probabilistic Inference Algorithms. In Proc. of the Conference on Uncertainty in AI (UAI 96), 211219.
Dechter, R. 1999. Bucket Elimination: A Unifying Framework for Reasoning. Artificial Intelligence 113(1-2):4185.
Dechter, R. 2003. Constraint Processing. Morgan Kaufmann.
Fattah, Y. E., and Dechter, R. 1996. An Evaluation of Structural Parameters for Probabilistic Reasoning: Results on Benchmark Circuits. In Proc. of the Conference on Uncertainty in AI (UAI 96), 244251.
Freuder, E. C. 1982. A Sufficient Condition for BacktrackFree Search. JACM 29 (1):2432.
Golumbic, M. C. 1980. Algorithmic Graph Theory and Perfect Graphs. New York, NY: Academic Press Inc.
Gottlob, G.; Leone, N.; and Scarcello, F. 1999. A Comparison of Structural CSP Decomposition Methods. In Proc. of the International Joint Conference on Artificial Intelligence (IJCAI 99), 394399.
Gyssens, M. 1986. On The Complexity Of Join Dependencies. ACM Transactions on Database Systems 11 (1):81 108.
Janssen, P.; Jegou, P.; Nougier, B.; and Vilarem, M.C. 1989. A Filtering Process for General ConstraintSatisfaction Problems: Achieving Pairwise-Consistency Using an Associated Binary Representation. In Proceedings of the IEEE Workshop on Tools for Artificial Intelligence, 420 427.
Jeavons, P. G.; Cohen, D. A.; and Gyssens, M. 1994. A Structural Decomposition for Hypergraphs. Contemporary Mathematics 178:161177.
Jegou, P., and Terrioux, C. 2003. Hybrid Backtracking Bounded by Tree-Decomposition of Constraint Networks.Artificial Intelligence 146:4375.
Jegou, P., and Terrioux, C. 2010. A New Filtering Based on Decomposition of Constraint Sub-Networks. In Proc. of the IEEE International Conference on Tools with Artificial Intelligence (ICTAI 10), 263270.
Karakashian, S.; Woodward, R.; Reeson, C.; Choueiry, B. Y.; and Bessiere, C. 2010. A First Practical Algorithm for High Levels of Relational Consistency. In Proc. of the Conference on Artificial Intelligence (AAAI 10), 101107.
Kask, K.; Dechter, R.; Larrosa, J.; and Dechter, A. 2005.Unifying Tree Decompositions for Reasoning in Graphical Models. Artificial Intelligence 166(1-2):165193.
Kjrulff, U. 1990. Triagulation of Graphs Algorithms Giving Small Total State Space. Research Report R-90-09, Aalborg University, Denmark.
Paparrizou, A., and Stergiou, K. 2012. An Efficient HigherOrder Consistency Algorithm for Table Constraints. In Proc.of the Conference on Artificial Intelligence (AAAI 12).
Rollon, E., and Dechter, R. 2010. New Mini-Bucket Partitioning Heuristics for Bounding the Probability of Evidence. In Proc. of the Conference on Artificial Intelligence (AAAI 10), 11991204.
Samaras, N., and Stergiou, K. 2005. Binary Encodings of Non-binary Constraint Satisfaction Problems: Algorithms and Experimental Results. Journal of Artificial Intelligence Research (JAIR) 24:641684.
Xu, L.; Hutter, F.; Hoos, H. H.; and Leyton-Brown, K.2008. SATzilla: Portfolio-based Algorithm Selection for SAT. Journal of AI Research 32:565606.
-----0
Amir, E., and Russell, S. 2003. Logical filtering. In Proceedings of the International Joint Conference on Artificial Intelligence (IJCAI), 7582. Acapulco, Mexico: Morgan Kaufmann.
Apt, K.; Blair, H.; and Walker, A. 1987. Towards a theory of declarative knowledge. In Minker, J., ed., Foundations of Deductive Databases and Logic Programming. Morgan Kaufmann. chapter 2, 89148.
Bonatti, P. 2001a. Reasoning with open logic programs. In Eiter, T.; Faber, W.; and Trusczynski, M., eds., Proceedings of the International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR), volume 2173 of LNCS, 147159. Vienna, Austria: Springer.
Bonatti, P. 2001b. Resolution with skeptical stable model semantics. Journal of Automated Reasoning 156(1):391 421.
Edelkamp, S.; Federholzner, T.; and Kissmann, P. 2012.Searching with partial belief states in general games with incomplete information. In Glimm, B., and Kruger, A., eds., Proceedings of the German Annual Conference on Artificial Intelligence (KI), volume 7526 of LNCS, 2536.Saarbrucken, Germany: Springer.
Gelfond, M., and Lifschitz, V. 1988. The stable model semantics for logic programming. In Kowalski, R., and Bowen, K., eds., Proceedings of the International Joint Conference and Symposium on Logic Programming (IJCSLP), 10701080. Seattle, OR: MIT Press.
Genesereth, M.; Love, N.; and Pell, B. 2005. General game playing: Overview of the AAAI competition. AI Magazine 26(2):6272.
Kissmann, P., and Edelkamp, S. 2010. Instantiating general games using Prolog or dependency graphs. In Dillmann, R.; 
Beyerer, J.; Hanebeck, U.; and Schultz, T., eds., Proceedings of the German Annual Conference on Artificial Intelligence (KI), volume 6359 of LNCS, 255262. Karlsruhe, Germany: Springer.
Kleene, S. 1952. Introduction to Metamathematics. Van Nostrand, New York.
Lloyd, J., and Topor, R. 1986. A basis for deductive database systems II. Journal of Logic Programming 3(1):5567.
Lloyd, J. 1987. Foundations of Logic Programming. Series Symbolic Computation. Springer, second, extended edition.
Love, N.; Hinrichs, T.; Haley, D.; Schkufza, E.; and Genesereth, M. 2006. General Game Playing: Game Description Language Specification. Technical Report LG2006 01, Stanford Logic Group, Computer Science Department, 
Stanford University, 353 Serra Mall, Stanford, CA 94305.Available at: games.stanford.edu.
Parker, A.; Nau, D.; and Subrahmanian, V. S. 2005. Gametree search with combinatorially large belief states. In Kaelbling, L., and Saffiotti, A., eds., Proceedings of the International Joint Conference on Artificial Intelligence (IJCAI), 254259.
Quenault, M., and Cazenave, T. 2007. Extended general gaming model. In Computers Games Workshop, 1952004.
Richards, M., and Amir, E. 2009. Information set sampling in general imperfect information positional games. In Proceedings of the IJCAI Workshop on General Intelligence in Game-Playing Agents (GIGA), 5966.
Rosenhouse, J. 2009. The Monty Hall Problem. Oxford University Press.
Saffidine, A., and Cazenave, T. 2011. A forward chaining based game description language compiler. In Proceedings of the IJCAI Workshop on General Intelligence in GamePlaying Agents (GIGA), 6975.
Schkufza, E.; Love, N.; and Genesereth, M. 2008. Propositional automata and cell automata: Representational frameworks for discrete dynamic systems. In Proceedings of the Australasian Joint Conference on Artificial Intelligence, volume 5360 of LNCS, 5666. Auckland: Springer.
Schofield, M.; Cerexhe, T.; and Thielscher, M. 2012. HyperPlay: A solution to general game playing with imperfect information. In Proceedings of the AAAI Conference on Artificial Intelligence. Toronto: AAAI Press.
Shepherdson, J. C. 1984. Negation as failure: A comparison of Clarks completed data base and Reiters closed world assumption. Journal of Logic Programming 1:5179.
Shirazi, A., and Amir, E. 2011. First-order logical filtering.Artificial Intelligence 175(1):193219.
Silver, D., and Veness, J. 2010. Monte-Carlo planning in large POMDPs. In Lafferty, J.; Williams, C.; Shawe-Taylor, 
J.; Zemel, R.; and Culotta, A., eds., Advances in Neural Information Processing (NIPS), 21642172.
Thielscher, M. 2010. A general game description language for incomplete information games. In Fox, M., and Poole, D., eds., Proceedings of the AAAI Conference on Artificial Intelligence, 994999.
Thielscher, M. 2011. The general game playing description language is universal. In Proceedings of the International Joint Conference on Artificial Intelligence (IJCAI), 1107 1112.
Waugh, K. 2009. Faster state manipulation in general games using generated code. In Proceedings of the IJCAI Workshop on General Intelligence in Game-Playing Agents (GIGA), 9197.
-----0
Bareinboim, E., and Pearl, J. 2012a. Causal inference by surrogate experiments: z-identifiability. In Proceedings of the Twenty-Eighth Conference on Uncertainty in Artificial Intelligence, 113120. AUAI Press.
Bareinboim, E., and Pearl, J. 2012b. Transportability of causal effects: Completeness results. In Proceedings of the Twenty-Sixth AAAI Conference on Artificial Intelligence, 698704. AAAI Press.
Bareinboim, E., and Pearl, J. 2013. Meta-transportability of causal effects: A formal approach. In Proceedings of the Sixteenth International Conference on Artificial Intelligence and Statistics. To appear.
Galles, D., and Pearl, J. 1995. Testing identifiability of causal effects. In Proceedings of the Eleventh Annual Conference on Uncertainty in Artificial Intelligence, 185195.Morgan Kaufmann.
Huang, Y., and Valtorta, M. 2006. Pearls calculus of intervention is complete. In Proceedings of the Twenty-Second Conference on Uncertainty in Artificial Intelligence, 217 224. AUAI Press.
Jaynes, E., and Bretthorst, G. 2003. Probability Theory: The Logic of Science. Cambridge University Press.
Pearl, J., and Bareinboim, E. 2011. Transportability of causal and statistical relations: A formal approach. In Proceedings of the Twenty-Fifth AAAI Conference on Artificial Intelligence, 247254. AAAI Press.
Pearl, J. 1988. Probabilistic Reasoning in Intelligent Systems: Networks of Plausible Inference. San Francisco, CA, USA: Morgan Kaufmann Publishers Inc.
Pearl, J. 1995. Causal diagrams for empirical research.Biometrika 82(4):669688.
Pearl, J. 2000. Causality: models, reasoning, and inference.New York, NY, USA: Cambridge University Press.
Pearl, J. 2012. The do-calculus revisited. In Proceedings of the Twenty-Eighth Conference on Uncertainty in Artificial Intelligence, 411. AUAI Press.
Shpitser, I., and Pearl, J. 2006a. Identification of conditional interventional distributions. In Proceedings of the TwentySecond Conference on Uncertainty in Artificial Intelligence, 437444. AUAI Press.
Shpitser, I., and Pearl, J. 2006b. Identification of joint interventional distributions in recursive semi-markovian causal models. In Proceedings of the Twenty-First National Conference on Artificial Intelligence, 12191226. AAAI Press.
Tian, J., and Pearl, J. 2002. A general identification condition for causal effects. In Proceedings of the Eighteenth National Conference on Artificial Intelligence, 567573. AAAI Press / The MIT Press.
Tian, J. 2004. Identifying conditional causal effects. In Proceedings of the Twentieth Conference in Uncertainty in Artificial Intelligence, 561568. AUAI Press.
-----0
Baluja, S.; Seth, R.; Sivakumar, D.; Jing, Y.; Yagnik, J.; 
Kumar, S.; Ravichandran, D.; and Aly, M. 2008. Video suggestion and discovery for youtube: taking random walks through the view graph. In Proceedings of the 17th international conference on World Wide Web, WWW 08, 895904.New York, NY, USA: ACM.
Collins, M., and Singer, Y. 1999. Unsupervised models for named entity classification. In In Proceedings of the Joint SIGDAT Conference on Empirical Methods in Natural Language Processing and Very Large Corpora, 100110.
Deane, P. 2005. A nonparametric method for extraction of candidate phrasal terms. In Proceedings of the 43rd Annual Meeting on Association for Computational Linguistics, ACL 05, 605613. Stroudsburg, PA, USA: Association for Computational Linguistics.
Kim, D. S.; Barker, K.; and Porter, B. 2010. Improving the quality of text understanding by delaying ambiguity resolution. In Proceedings of the 23rd International Conference on Computational Linguistics, COLING 10, 581589.Stroudsburg, PA, USA: Association for Computational Linguistics.
Kim, D. S.; Verma, K.; and Yeh, P. Z. 2012. Building a lightweight semantic model for unsupervised information extraction on short listings. In Proceedings of the 2012 Joint Conference on Empirical Methods in Natural Language Processing and Computational Natural Language Learning, EMNLP-CoNLL 12, 10811092. Stroudsburg, PA, USA: Association for Computational Linguistics.
Poon, H., and Domingos, P. 2007. Joint inference in information extraction. In Proceedings of the 22nd national conference on Artificial intelligence Volume 1, AAAI07, 913918. AAAI Press.
Putthividhya, D. P., and Hu, J. 2011. Bootstrapped named entity recognition for product attribute extraction. In Proceedings of the Conference on Empirical Methods in Natural Language Processing, EMNLP 11, 15571567. Stroudsburg, PA, USA: Association for Computational Linguistics.
Riloff, E., and Jones, R. 1999. Learning dictionaries for information extraction by multi-level bootstrapping. In Proceedings of the sixteenth national conference on Artificial intelligence and the eleventh Innovative applications of artificial intelligence conference innovative applications of artificial intelligence, AAAI 99/IAAI 99, 474479. Menlo Park, CA, USA: American Association for Artificial Intelligence.
Subramanya, A.; Petrov, S.; and Pereira, F. 2010. Efficient graph-based semi-supervised learning of structured tagging models. In Proceedings of the 2010 Conference on Empirical Methods in Natural Language Processing, EMNLP 10, 167176. Stroudsburg, PA, USA: Association for Computational Linguistics.
Sutton, C., and McCallum, A. 2005. Joint parsing and semantic role labeling. In Proceedings of the Ninth Conference on Computational Natural Language Learning, CONLL 05, 225228. Stroudsburg, PA, USA: Association for Computational Linguistics.
Talukdar, P. P.; Brants, T.; Liberman, M.; and Pereira, F.2006. A context pattern induction method for named entity extraction. In Proceedings of the Tenth Conference on Computational Natural Language Learning, CoNLL-X 06, 141148. Stroudsburg, PA, USA: Association for Computational Linguistics.
Toutanova, K.; Klein, D.; Manning, C. D.; and Singer, Y.2003. Feature-rich part-of-speech tagging with a cyclic dependency network. In Proceedings of the 2003 Conference of the North American Chapter of the Association for Computational Linguistics on Human Language Technology Volume 1, NAACL 03, 173180. Stroudsburg, PA, USA: Association for Computational Linguistics.
Turney, P. D., and Pantel, P. 2010. From frequency to meaning: vector space models of semantics. J. Artif. Int. Res.37(1):141188.
Whitney, M., and Sarkar, A. 2012. Bootstrapping via graph propagation. In Proceedings of the 50th Annual Meeting of the Association for Computational Linguistics, ACL 12. Stroudsburg, PA, USA: Association for Computational Linguistics.
Yarowsky, D. 1995. Unsupervised word sense disambiguation rivaling supervised methods. In Proceedings of the 33rd annual meeting on Association for Computational Linguistics, ACL 95, 189196. Stroudsburg, PA, USA: Association for Computational Linguistics.
-----0
Agarwal, A.; Triggs, B.; Rhone-Alpes, I.; and Montbonnot, F.2010. The fg-net aging database, http://www.fgnet.rsunit.com.
Bottou, L., C. O. D. D., and Weston, J. 2007. Training a support vector machine in the primal. Neural Computation 19(5):1155 1178.
Chang, C. C., and Lin, C. J. 2011. LIBSVM: A library for support vector machines, http://www.csie.ntu.edu.tw/ cjlin/libsvm. ACM Transactions on Intelligent Systems and Technology 2:27:127:27.
Cherkassky, V. 1997. The Nature Of Statistical Learning Theory, volume 8.
Das Gupta, M., and Xiao, J. 2011. Non-negative matrix factorization as a feature selection tool for maximum margin classifiers.In Computer Vision and Pattern Recognition (CVPR), 2011 IEEE Conference on, 28412848.
Fawcett, T. 2006. An introduction to roc analysis. Pattern Recognition Letters 27(8):861874.
Friedlander, M., and Hatz, K. 2008. Computing non-negative tensor factorizations. Optimisation Methods and Software 23(4):631 647.
Guo, W.; Kotsia, I.; and Patras, I. 2012. Tensor learning for regression. Image Processing, IEEE Transactions on 21(2):816827.
Harshman, R., and Lundy, M. 1996. Uniqueness proof for a family of models sharing features of tuckers three-mode factor analysis and parafac/candecomp. Psychometrika 61(1):133154.
Harshman, R.; Hong, S.; and Lundy, M. 2003. Shifted factor analysis?part i: Models and properties. Journal of chemometrics 17(7):363378.
Hoyer, P. 2004. Non-negative matrix factorization with sparseness constraints. The Journal of Machine Learning Research 5:1457 1469.
Kiers, H. 2000. Towards a standardized notation and terminology in multiway analysis. Journal of Chemometrics 14(3):105122.
Kim, H., and Park, H. 2007. Sparse non-negative matrix factorizations via alternating non-negativity-constrained least squares for microarray data analysis. Bioinformatics 23(12):14951502.
Kim, J., and Park, H. 2012. Fast nonnegative tensor factorization with an active-set-like method. High-Performance Scientific Computing 311326.
Kimeldorf, G., and Wahba, G. 1970. A correspondence between bayesian estimation on stochastic processes and smoothing by splines. The Annals of Mathematical Statistics 495502.
Kolda, T., and Bader, B. 2009. Tensor decompositions and applications. SIAM review 51(3):455500.
Kotsia, I., and Patras, I. 2011. Support tucker machines. In Computer Vision and Pattern Recognition (CVPR), 2011 IEEE Conference on, 633640. IEEE.
Kumar, B. G. V.; Kotsia, I.; and Patras, I. 2012. Max-margin nonnegative matrix factorization. Image Vision Comput. 279291.
Liu, J.; Wonka, P.; and Ye, J. 2012. Sparse non-negative tensor factorization using columnwise coordinate descent. Pattern Recognition 45(1):649656.
Mart?nez-Montes, E.; Valdes-Sosa, P.; Miwakeichi, F.; Goldman, R.; and Cohen, M. 2004. Concurrent eeg/fmri analysis by multiway partial least squares. NeuroImage 22(3):10231034.
Mrup, M.; Hansen, L.; Parnas, J.; and Arnfred, S. 2006. Decomposing the time-frequency representation of eeg using non-negative matrix and multi-way factorization. Technical University of Denmark Technical Report.
Mrup, M.; Hansen, L.; and Arnfred, S. 2008. Algorithms for sparse nonnegative tucker decompositions. Neural computation 20(8):21122131.
Murakami, T., and Kroonenberg, P. 2003. Three-mode models and individual differences in semantic differential data. Multivariate Behavioral Research 38(2):247283.
Piazza, T.; Lundstrom, J.; Kunz, A.; and Fjeld, M. 2009. Predicting missing markers in real-time optical motion capture. Modelling the Physiological Human 125136.
Roller, B. 2004. Max-margin markov networks. In Advances in Neural Information Processing Systems 16: Proceedings of the 2003 Conference, volume 16, 25. MIT Press.
Scholkopf, B., and Smola, A. J. 2002. A Short Introduction to Learning with Kernels.
Shashua, A., and Hazan, T. 2005. Non-negative tensor factorization with applications to statistics and computer vision. In Proceedings of the 22nd international conference on Machine learning, 792 799. ACM.
Tao, D.; Li, X.; Maybank, S.; and Wu, X. 2006. Human carrying status in visual surveillance. In Computer Vision and Pattern Recognition, 2006 IEEE Computer Society Conference on, volume 2, 16701677. IEEE.
Tao, D.; Li, X.; Wu, X.; and Maybank, S. 2007. General tensor discriminant analysis and gabor features for gait recognition.Pattern Analysis and Machine Intelligence, IEEE Transactions on 29(10):17001715.
Wang, Y.; Yunde, J.; Hu, C.; and Turk, M. 2005. Non-negative matrix factorization framework for face recognition. International Journal of Pattern Recognition and Artificial Intelligence 19(04):495511.
Wu, F.; Liu, Y.; and Zhuang, Y. 2009. Tensor-based transductive learning for multimodality video semantic concept detection. Multimedia, IEEE Transactions on 11(5):868878.
Zafeiriou, S. 2009. Discriminant nonnegative tensor factorization algorithms. Neural Networks, IEEE Transactions on 20(2):217 235.
-----0
Basilico, N.; Gatti, N.; and Amigoni, F. 2009. Leaderfollower strategies for robotic patrolling in environments with arbitrary topologies. In AAMAS, 5764.
Camerer, C. 2011. Behavioral game theory: Experiments in strategic interaction. Princeton University Press.Choi, S.; Gale, D.; and Kariv, S. 2012. Social learning in networks: a quantal response equilibrium analysis of experimental data. Review of Economic Design 123.
Conitzer, V., and Sandholm, T. 2006. Computing the optimal strategy to commit to. In EC, 8290.Conlisk, J. 1996. Why bounded rationality? Journal of economic literature 669700.
Dawes, R. M. 1979. The robust beauty of improper linear models in decision making. American psychologist 34(7):571582.
Fischhoff, B.; Goitein, B.; and Shapira, Z. 1981. Subjective utility function: A model of decision-making. American Society of Information Science 32(5):391399.
Greenwood, P., and Nikulin, M. 1996. A guard to chisquared testing.
Haile, P. A.; Hortacsu, A.; and Kosenok, G. 2008. On the empirical content of quantal response equilibrium. The American Economic Review 98(1):180200.
Hastie, T.; Tibshirani, R.; and Friedman, J. 2009. The elements of statistical learning 2nd edition.
Johnson, M.; Fang, F.; and Tambe, M. 2012. Patrol strategies to maximize pristine forest area. In AAAI.
Korzhyk, D.; Conitzer, V.; and Parr, R. 2010. Complexity of computing optimal stackelberg strategies in security resource allocation games. In AAAI, 805810.
Letchford, J., and Vorobeychik, Y. 2011. Computing randomized security strategies in networked domains. In AARM Workshop In AAAI.
March, J. 1978. Bounded rationality, ambiguity, and the engineering of choice. The Bell Journal of Economics 587 608.
McKelvey, R., and Palfrey, T. 1995. Quantal response equilibria for normal form games. Games and economic behavior 10(1):638.
Meehl, P. E. 1963. Clinical versus statistical prediction: A theoretical analysis and a review of the evidence. University of Minnesota Press.
Nudelman, E.; Wortman, J.; Shoham, Y.; and LeytonBrown, K. 2004. Run the gamut: A comprehensive approach to evaluating game-theoretic algorithms. In AAMAS, 880887.
Paruchuri, P.; Pearce, J.; Marecki, J.; Tambe, M.; Ordonez, F.; and Kraus, S. 2008. Playing games for security: an efficient exact algorithm for solving bayesian stackelberg games. In AAMAS, 895902.
Pita, J.; Jain, M.; Tambe, M.; Ordonez, F.; and Kraus, S.2010. Robust solutions to stackelberg games: Addressing bounded rationality and limited observations in human cognition. Artificial Intelligence 174(15):11421171.
Pita, J.; John, R.; Maheswaran, R.; Tambe, M.; and Kraus, S. 2012. A robust approach to addressing human adversaries in security games. In ECAI, 660665.
Savage, L. J. 1972. The Foundations of Statistics. Dover Publications.
Tambe, M. 2011. Security and Game Theory: Algorithms, Deployed Systems, Lessons Learned. Cambridge University Press.
Wilcox, R. 2002. Applying contemporary statistical techniques. Academic Press.
Yang, R.; Kiekintveld, C.; Ordonez, F.; Tambe, M.; and John, R. 2011. Improving resource allocation strategy against human adversaries in security games. In IJCAI, 458 464.
Yin, Z.; Jiang, A.; Johnson, M.; Tambe, M.; Kiekintveld, C.; Leyton-Brown, K.; Sandholm, T.; and Sullivan, J. 2012.Trusts: Scheduling randomized patrols for fare inspection in transit systems. In IAAI.
-----0
Arrowsmith, D., and Place, C. 1992. Dynamical Systems.London: Chapman & Hall.
Cai, K.; Niu, J.; and Parsons, S. 2007. Using evolutionary gametheory to analyse the performance of trading strategies in a continuous double auction market. In ALAMAS, 4459.
Cressman, R. 2003. Evolutionary dynamics and extensive form games. Cambridge, Mass.: MIT Press.
Fudenberg, D., and Tirole, J. 1991. Game Theory.Gatti, N., and Iuliano, C. 2011. Computing an extensive form perfect equilibrium in twoplayer games. In AAAI, 669674.
Gatti, N.; Panozzo, F.; and Restelli, M. 2013. Efficient evolutionary dynamics with extensiveform games: extended version. http://arxiv.org/abs/1304.1456.
Kiekintveld, C.; Marecki, J.; and Tambe, M. 2011. Approximation methods for infinite bayesian stackelberg games: modeling distributional payoff uncertainty. In AAMAS, 10051012.
Koller, D.; Megiddo, N.; and von Stengel, B. 1996. Efficient computation of equilibria for extensive twoperson games.GAME ECON BEHAV 14(2):220246.
Kuhn, H. 1950. Extensive games. Proc. Natl. Acad. Sci. U.S. A. 36:570576.
Lemke, C. E., and Howson, J. J. T. 1964. Equilibrium points of bimatrix games. SIAM J APPL MATH 12(2):413423.
Lemke, C. 1978. Some pivot schemes for the linear complementarity problem. Mathematical Programming Study 7:1535.
Miltersen, P., and Srensen, T. 2010. Computing a quasi perfect equilibrium of a twoplayer game. ECON THEOR 42(1):175192.
Panait, L.; Tuyls, K.; and Luke, S. 2008. Theoretical advantages of lenient learners: An evolutionary game theoretic perspective. J MACH LEARN RES 9:423457.
Selten, R. 1975. Reexamination of the perfectness concept for equilibrium points in extensive games. INT J GAME THEORY 4(1):2555.
Shoham, Y., and Leyton-Brown, K. 2008. Multiagent Systems: Algorithmic, Game Theoretic and Logical Foundations.
Tuyls, K., and Parsons, S. 2007. What evolutionary game theory tells us about multiagent learning. ARTIF INTELL 171(7):406416.
Tuyls, K.; Hoen, P. J.; and Vanschoenwinkel, B. 2006. An evolutionary dynamical analysis of multiagent learning in iterated games. AUTON AGENT MULTIAG 12(1):115 153.
Vermeulen, D., and Jansen, M. 1998. The reduced form of a game. EUR J OPER RES 106(1):204211.von Neumann, J., and Morgenstern, O. 1944. Theory of games and economic behavior. Princeton University Press.von Stengel, B. 1996. Efficient computation of behavior strategies. GAME ECON BEHAV 14(2):220246.
-----0
Allen, J. F. 1983. Maintaining knowledge about temporal intervals.Communication of the ACM 26(11):832843.
Angelsmark, O., and Jonsson, P. 2000. Some observations on durations, scheduling and allens algebra. In CP, 484488.
Barreiro, J.; Boyce, M.; Do, M.; Frank, J.; Iatauro, M.; Kichkaylo, T.; Morris, P.; Ong, J.; Remolina, E.; Smith, T.; and Smith, D. 2012. EUROPA: A Platform for AI Planning, Scheduling, Constraint Programming, and Optimization. In Proc. of 4th International Competition on Knowledge Engineering for Planning and Scheduling (ICKEPS).
Barrett, C. W.; Sebastiani, R.; Seshia, S. A.; and Tinelli, C. 2009.Satisfiability modulo theories. In Handbook of Satisfiability. IOS Press. 825885.
Bernardini, S. 2008. Constraint-based Temporal Planning: Issues in Domain Modelling and Search Control. Ph.D. Dissertation, Faculty of Computer Science  University of Trento (Italy).
Cesta, A.; Fratini, S.; Oddi, A.; and Pecora, F. 2008. APSI Case#1: Pre-planning Science Operations in Mars Express. In Proceedings of i-SAIRAS-08, the 9th International Symposium in Artificial Intelligence, Robotics and Automation in Space.
Cesta, A.; Cortellessa, G.; Fratini, S.; Oddi, A.; and Rasconi, R.2009a. The APSI Framework: a Planning and Scheduling Software Development Environment. In Working Notes of the ICAPS-09 Application Showcase Program.
Cesta, A.; Cortellessa, G.; Fratini, S.; and Oddi, A. 2009b. Developing an end-to-end planning application from a timeline representation framework. In Haigh, K. Z., and Rychtyckyj, N., eds., IAAI.AAAI.
Cesta, A.; Finzi, A.; Fratini, S.; Orlandini, A.; and Tronci, E.2010a. Analyzing flexible timeline-based plans. In Coelho, H.; Studer, R.; and Wooldridge, M., eds., ECAI, volume 215 of Frontiers in Artificial Intelligence and Applications, 471476. IOS Press.
Cesta, A.; Finzi, A.; Fratini, S.; Orlandini, A.; and Tronci, E.2010b. Validation and verification issues in a timeline-based planning system. Knowledge Eng. Review 25(3):299318.
Cesta, A.; Cortellessa, G.; Fratini, S.; and Oddi, A. 2011. Mrspock steps in developing an end-to-end space application. Computational Intelligence 27(1):83102.
Cesta, A.; Fratini, S.; and Pecora, F. 2008. Planning with multiplecomponents in omps. In Nguyen, N. T.; Borzemski, L.; Grzech, 
A.; and Ali, M., eds., IEA/AIE, volume 5027 of Lecture Notes in Computer Science, 435445. Springer.
Cheng, C.-C., and Smith, S. F. 1994. Generating feasible schedules under complex metric constraints. In Hayes-Roth, B., and Korf, R. E., eds., AAAI, 10861091. AAAI Press / The MIT Press.
Cimatti, A.; Griggio, A.; Sebastiani, R.; and Schaafsma, B. 2012. The MathSAT5 SMT solver. http://mathsat.fbk.eu.
Cimatti, A.; Micheli, A.; and Roveri, M. 2012a. Solving temporal problems using smt: Strong controllability. In CP, 248264.
Cimatti, A.; Micheli, A.; and Roveri, M. 2012b. Solving temporal problems using smt: Weak controllability. In AAAI.
Coles, A.; Fox, M.; Halsey, K.; Long, D.; and Smith, A.2009. Managing concurrency in temporal planning using plannerscheduler interaction. Artif. Intell. 173(1):144.
Coles, A. J.; Coles, A.; Fox, M.; and Long, D. 2012. Colin: Planning with continuous linear numeric change. J. Artif. Intell. Res.(JAIR) 44:196.
Donati, A.; Policella, N.; Cesta, A.; Fratini, S.; Oddi, A.; Cortellessa, G.; Pecora, F.; Schulster, J.; Rabenau, E.; Niezette, M.; and Steel, R. 2008. Science Operations Pre-Planning & Optimization using AI constraint-resolution the APSI Case Study 1. In Proceedings of SpaceOps-08, the 10th International Conference on Space Operations.
Drakengren, T., and Jonsson, P. 1997. Eight maximal tractable subclasses of allens algebra with metric time. J. Artif. Intell. Res.(JAIR) 7:2545.
Frank, J., and Jonsson, A. 2003. Constraint-based Attribute and Interval Planning. Constraints 8(4):339364.
Ghallab, M., and Laruelle, H. 1994. Representation and control in ixtet, a temporal planner. In AIPS, 6167.
Loos, R., and Weispfenning, V. 1993. Applying linear quantifier elimination. Computer Journal 36(5):450462.
Monniaux, D. 2008. A Quantifier Elimination Algorithm for Linear Real Arithmetic. In Logic for Programming, Artificial Intelligence, and Reasoning LPAR, 243257.
Morris, P. H.; Muscettola, N.; and Vidal, T. 2001. Dynamic control of plans with temporal uncertainty. In International Joint Conference on Artificial Intelligence IJCAI, 494502.
Muscettola, N. 1993. Hsts: Integrating planning and scheduling.Technical report, DTIC Document.
Peintner, B.; Venable, K. B.; and Yorke-Smith, N. 2007. Strong controllability of disjunctive temporal problems with uncertainty. In Bessiere, C., ed., Principles and Practice of Constraint Programming CP, volume 4741 of LNCS, 856863. Springer.
Schrijver, A. 1998. Theory of Linear and Integer Programming. J.Wiley & Sons.
Venable, K. B.; Volpato, M.; Peintner, B.; and Yorke-Smith, N.2010. Weak and dynamic controllability of temporal problems with disjunctions and uncertainty. In Workshop on Constraint Satisfaction Techniques for Planning & Scheduling, 5059.
Verfaillie, G.; Pralet, C.; and Lema?tre, M. 2010. How to model planning and scheduling problems using constraint networks on timelines. Knowledge Eng. Review 25(3):319336.
Vidal, T., and Fargier, H. 1999. Handling contingency in temporal constraint networks: from consistency to controllabilities. Journal of Experimental Theoretical Artificial Intelligence 11(1):2345.
Wetprasit, R., and Sattar, A. 1998. Temporal reasoning with qualitative and quantitative information about points and durations. In 
Mostow, J., and Rich, C., eds., AAAI/IAAI, 656663. AAAI Press / The MIT Press.
-----0
Anfinsen, C. B. 1973. Principles that govern the folding of protein chains. Science 181(4096):223230.
Berrera, M.; Molinari, H.; and Fogolari, F. 2003. Amino acid empirical contact energy definitions for fold recognition in the space of contact maps. BMC Bioinformatics 4:8.Cipra, B. 1998. Packing challenge mastered at last. Science 281(5381):1267.
Dotu, I.; Cebrian, M.; Van Hentenryck, P.; and Clote, P.2011. On lattice protein structure prediction revisited. Computational Biology and Bioinformatics, IEEE/ACM Transactions on 8(6):16201632.
Kapsokalivas, L.; Gan, X.; Albrecht, A. A.; and Steinhofel, K. 2009. Population-based local search for protein folding simulation in the MJ energy model and cubic lattices. Computational Biology and Chemistry 33(4):283294.
Landau, D., and Binder, K. 2005. A Guide to Monte Carlo Simulations in Statistical Physics. Cambridge: Cambridge University Press.
Lau, K. F., and Dill, K. A. 1989. A lattice statistical mechanics model of the conformational and sequence spaces of proteins. Macromolecules 22(10):39863997.
Lesh, N.; Mitzenmacher, M.; and Whitesides, S. 2003. A complete and effective move set for simplified protein folding. In Proceedings of the seventh annual international conference on research in computational molecular biology, 
RECOMB 03, 188195. New York, NY, USA: ACM.Miyazawa, S., and Jernigan, R. L. 1985. Estimation of effective interresidue contact energies from protein crystal structures: quasi-chemical approximation. Macromolecules 18(3):534552.
Newton, M.; Pham, D. N.; Sattar, A.; and Maher, M. J. 2011.Kangaroo: An efficient constraint-based local search system using lazy propagation. In CP, 645659.
Palu`, A. D.; Will, S.; Backofen, R.; and Dovier, A. 2004.Constraint based protein structure prediction exploiting secondary structure information. In Proceedings of Italian Conference on Computational Logic, CLIC04.
Palu`, A. D.; Dovier, A.; Fogolari, F.; and Pontelli, E. 2011.Exploring protein fragment assembly using CLP. In IJCAI, 25902595.
Palu`, A. D.; Dovier, A.; and Pontelli, E. 2005. Heuristics, optimizations, and parallelism for protein structure prediction in CLP(FD). In PPDP, 230241.
Palu`, A. D.; Dovier, A.; and Pontelli, E. 2007. A constraint solver for discrete lattices, its parallelization, and application to protein structure prediction. Softw. Pract. Exper.37:14051449.
Rashid, M. A.; Hoque, M. T.; Newton, M.; Pham, D. N.; and Sattar, A. 2012. A new genetic algorithm for simplified protein structure prediction. In Proceedings of the 25th Australian Joint Conference on Artificial Intelligence, AI12.
Rotkiewicz, P., and Skolnick, J. 2008. Fast procedure for reconstruction of full-atom protein models from reduced representations. Journal of Computational Chemistry 29(9):14601465.
Shatabda, S.; Newton, M.; Rashid, M. A.; Pham, D. N.; and Sattar, A. 2013. The road not taken: retreat and diverge in local search for simplified protein structure prediction. BMC Bioinformatics 14(2):19.
Steinhofel, K.; Skaliotis, A.; and Albrecht, A. A. 2007.Stochastic protein folding simulation in the d-dimensional HP-model. In Proceedings of the 1st international conference on Bioinformatics research and development, BIRD07, 381394. Berlin, Heidelberg: Springer-Verlag.
Torres, S. R. D.; Romero, D. C. B.; Vasquez, L. F. N.; and Ardila, Y. J. P. 2007. A novel ab-initio genetic-based approach for protein folding prediction. In Proceedings of the 9th annual conference on Genetic and evolutionary computation, GECCO 07, 393400. New York, NY, USA: ACM.
Ullah, A. D., and Steinhofel, K. 2010. A hybrid approach to protein folding problem integrating constraint programming with local search. BMC Bioinformatics 11(S-1):39.
-----0
Bengio, S.; Pereira, F.; Singer, Y.; and Strelow, D. 2009.
Group sparse coding. Advances in Neural Information Processing Systems 22:8289.
Blei, D., and Jordan, M. 2003. Modeling annotated data.In Proceedings of the 26th annual international ACM SIGIR conference on Research and development in information retrieval, 127134. ACM.
Blei, D.; Ng, A.; and Jordan, M. 2003. Latent dirichlet allocation. the Journal of machine Learning research 3:993 1022.
Fei-Fei, L.; Fergus, R.; and Perona, P. 2004. Learning generative visual models from few training examples: an incremental bayesian approach tested on 101 object categories. In Computer Vision and Pattern Recognition Workshop, 2004.CVPRW04. Conference on, 178178. IEEE.
Friedman, J.; Hastie, T.; and Tibshirani, R. 2010. A note on the group lasso and a sparse group lasso. arXiv preprint arXiv:1001.0736.
Hotelling, H. 1936. Relations between two sets of variates.Biometrika 28(3/4):321377.
Jia, Y.; Salzmann, M.; and Darrell, T. 2010. Factorized latent spaces with structured sparsity. Advances in Neural Information Processing Systems 23:982990.
Jia, Y.; Salzmann, M.; and Darrell, T. 2011. Learning cross-modality similarity for multinomial data. In Computer Vision (ICCV), 2011 IEEE International Conference on, 24072414. IEEE.
Jia, K.; Tang, X.; and Wang, X. 2012. Image transformation based on learning dictionaries across image spaces. IEEE Transactions on Pattern Analysis and Machine Intelligence.
Kang, Z.; Grauman, K.; and Sha, F. 2011. Learning with whom to share in multi-task feature learning. In Proceedings of the 28th International Conference on Machine Learning, 521528.
Lowe, D. G. 1999. Object recognition from local scaleinvariant features. In Computer vision, 1999. The proceedings of the seventh IEEE international conference on, volume 2, 11501157. Ieee.
Mairal, J.; Bach, F.; Ponce, J.; Sapiro, G.; and Zisserman, A. 2008. Supervised dictionary learning. arXiv preprint arXiv:0809.3083.
Mairal, J.; Bach, F.; Ponce, J.; and Sapiro, G. 2010. Online learning for matrix factorization and sparse coding. The Journal of Machine Learning Research 11:1960.
Monaci, G.; Jost, P.; Vandergheynst, P.; Mailhe, B.; Lesage, S.; and Gribonval, R. 2007. Learning multimodal dictionaries. Image Processing, IEEE Transactions on 16(9):2272 2283.
Olshausen, B.; Field, D.; et al. 1997. Sparse coding with an overcomplete basis set: A strategy employed by vi? Vision research 37(23):33113326.
Putthividhy, D.; Attias, H.; and Nagarajan, S. 2010. Topic regression multi-modal latent dirichlet allocation for image annotation. In Computer Vision and Pattern Recognition (CVPR), 2010 IEEE Conference on, 34083415. IEEE.
Qin, Z.; Scheinberg, K.; and Goldfarb, D. 2010. Efficient block-coordinate descent algorithms for the group lasso.Preprint.
Rasiwasia, N.; Costa Pereira, J.; Coviello, E.; Doyle, G.; Lanckriet, G.; Levy, R.; and Vasconcelos, N. 2010. A new approach to cross-modal multimedia retrieval. In Proceedings of the international conference on Multimedia, 251 260. ACM.
Salomatin, K.; Yang, Y.; and Lad, A. 2009. Multi-field correlated topic modeling. SDM09 628637.
Sharma, A.; Kumar, A.; Daume, H.; and Jacobs, D. 2012.Generalized multiview analysis: A discriminative latent space. In Computer Vision and Pattern Recognition (CVPR), 2012 IEEE Conference on, 21602167. IEEE.
Tibshirani, R. 1996. Regression shrinkage and selection via the lasso. Journal of the Royal Statistical Society. Series B (Methodological) 267288.
Todorovic, S., and Nechyba, M. 2004. Detection of artificial structures in natural-scene images using dynamic trees. In Pattern Recognition, 2004. ICPR 2004. Proceedings of the 17th International Conference on, volume 1, 3539. IEEE.
Virtanen, S.; Jia, Y.; Klami, A.; and Darrell, T. 2012.Factorized multi-modal topic model. arXiv preprint arXiv:1210.4920.
Wang, S.; Zhang, L.; Liang, Y.; and Pan, Q. 2012.Semi-coupled dictionary learning with applications to image super-resolution and photo-sketch synthesis. In Computer Vision and Pattern Recognition (CVPR), 2012 IEEE Conference on, 22162223. IEEE.
Wright, J.; Yang, A.; Ganesh, A.; Sastry, S.; and Ma, Y.2009. Robust face recognition via sparse representation.Pattern Analysis and Machine Intelligence, IEEE Transactions on 31(2):210227.
Wu, F.; Zhang, H.; and Zhuang, Y. 2006. Learning semantic correlations for cross-media retrieval. In Image Processing, 2006 IEEE International Conference on, 14651468. IEEE.
Yang, M.; Zhang, L.; Yang, J.; and Zhang, D. 2010.Metaface learning for sparse representation based face recognition. In Image Processing (ICIP), 2010 17th IEEE International Conference on, 16011604. IEEE.
Zhen, Y., and Yeung, D.-Y. 2012. A probabilistic model for multimodal hash function learning. In Proceedings of the 18th ACM SIGKDD international conference on Knowledge discovery and data mining, 940948. ACM.
Zhuang, Y.-T.; Yang, Y.; and Wu, F. 2008. Mining semantic correlation of heterogeneous multimedia data for cross-media retrieval. Multimedia, IEEE Transactions on 10(2):221229.
-----0
Chan, Y. S., and Ng, H. T. 2008. Maxsim: A maximum similarity metric for machine translation evaluation. Proceedings of ACL-08: HLT 5562.
Cong, G.; Wang, L.; Lin, C.-Y.; Song, Y.-I.; and Sun, Y.2008. Finding question-answer pairs from online forums. In Proceedings of ACM SIGIR conference on Research and development in information retrieval.
Esuli, A., and Sebastiani, F. 2006. Sentiwordnet: A publicly available lexical resource for opinion mining. In Proceedings of LREC, volume 6, 417422.
Han, J.; Pei, J.; Mortazavi-Asl, B.; Pinto, H.; Chen, Q.; Dayal, U.; and Hsu, M. 2001. Prefixspan: Mining sequential patterns efficiently by prefix-projected pattern growth. In Proceedings of the 17th International Conference on Data Engineering, 215224.
Islam, A., and Inkpen, D. 2008. Semantic text similarity using corpus-based word similarity and string similarity. ACM Trans. Knowl. Discov. Data 2(2):10:110:25.
Jindal, N., and Liu, B. 2006a. Identifying comparative sentences in text documents. In Proceedings of the 29th annual international ACM SIGIR conference on Research and development in information retrieval, 244251. ACM.
Jindal, N., and Liu, B. 2006b. Mining comparative sentences and relations. In Proceedings of the National Conference on Artificial Intelligence, volume 21, 1331. Menlo Park, CA; Cambridge, MA; London; AAAI Press; MIT Press; 1999.
Ku, L.-W.; Liang, Y.-T.; and Chen, H.-H. 2007. Question analysis and answer passage retrieval for opinion question answering systems. ROCLING.
Kuhn, H. W. 1955. The hungarian method for the assignment problem. Naval research logistics quarterly 2(1-2):83 97.
Li, B.; Liu, Y.; Ram, A.; Garcia, E. V.; and Agichtein, E.2008. Exploring question subjectivity prediction in community qa. In Proceedings of the 31st annual international ACM SIGIR conference on Research and development in information retrieval.
Li, B.; Liu, Y.; and Agichtein, E. 2008. Cocqa: co-training over questions and answers with an application to predicting question subjectivity orientation. In Proceedings of the conference on empirical methods in natural language processing.
Liu, B. 2010. Sentiment analysis and subjectivity. In Handbook of Natural Language Processing, Second Edition. Taylor and Francis Group, Boca.
Matsumoto, S.; Takamura, H.; and Okumura, M. 2005. Sentiment classification using word sub-sequences and dependency sub-trees. In Advances in Knowledge Discovery and Data Mining. Springer. 301311.
Munkres, J. 1957. Algorithms for the assignment and transportation problems. Journal of the Society for Industrial & Applied Mathematics 5(1):3238.
Ng, V.; Dasgupta, S.; and Arifin, S. 2006. Examining the role of linguistic knowledge sources in the automatic identification and classification of reviews. In Proceedings of the COLING/ACL on Main conference poster sessions.
Pang, B., and Lee, L. 2008. Opinion mining and sentiment analysis. Foundations and trends in information retrieval 2(1-2):1135.
Riloff, E.; Wiebe, J.; and Phillips, W. 2005. Exploiting subjectivity classification to improve information extraction. In Proceedings of the National Conference On Artificial Intelligence, volume 20, 1106.
Stoyanov, V.; Cardie, C.; Litman, D.; and Wiebe, J. 2006.Evaluating an opinion annotation scheme using a new multiperspective question and answer corpus. In Computing Attitude and Affect in Text: Theory and Applications. Springer.7791.
Stoyanov, V.; Cardie, C.; and Wiebe, J. 2005. Multiperspective question answering using the opqa corpus. In Proceedings of the conference on Human Language Technology and Empirical Methods in Natural Language Processing.
Surdeanu, M.; Ciaramita, M.; and Zaragoza, H. 2008.Learning to rank answers on large online qa collections. In Proceedings of the 46th Annual Meeting of the Association for Computational Linguistics (ACL 2008), 719727.
Taskar, B.; Lacoste-Julien, S.; and Klein, D. 2005. A discriminative matching approach to word alignment. In Proceedings of the conference on Human Language Technology and Empirical Methods in Natural Language Processing.
Wang, K., and Chua, T.-S. 2010. Exploiting salient patterns for question detection and question retrieval in communitybased question answering. In Proceedings of the 23rd International Conference on Computational Linguistics.
Wiebe, J., and Riloff, E. 2005. Creating subjective and objective sentence classifiers from unannotated texts. In Computational Linguistics and Intelligent Text Processing.Springer. 486497.
Wiebe, J.; Wilson, T.; Bruce, R.; Bell, M.; and Martin, M.2004. Learning subjective language. Computational linguistics 30(3):277308.
Wilson, T.; Wiebe, J.; and Hoffmann, P. 2005. Recognizing contextual polarity in phrase-level sentiment analysis. In Proceedings of the conference on Human Language Technology and Empirical Methods in Natural Language Processing.
Wilson, T.; Wiebe, J.; and Hoffmann, P. 2009. Recognizing contextual polarity: An exploration of features for phrase-level sentiment analysis. Computational linguistics 35(3):399433.
Yan, X., and Han, J. 2002. gspan: Graph-based substructure pattern mining. In Proceedings of the 2002 IEEE International Conference on Data Mining, ICDM 02. Washington, DC, USA: IEEE Computer Society.
Yu, H., and Hatzivassiloglou, V. 2003. Towards answering opinion questions: Separating facts from opinions and identifying the polarity of opinion sentences. In Proceedings of the 2003 conference on Empirical methods in natural language processing.
-----0
An, L. T. H., and Tao, P. D. 2001. Dc programming approach and solution algorithm to multidimensional scaling problem.Nonconvex optimization and its application 231276.
Borwein, J. M., and Lewis, A. S. 2000. Convex analysis and nonlinear optimization. New York: Springer.
Boyd, S., and Vandenberghe, L. 2004. Convex Optimization.Cambridge, UK: Cambridge University Press.
Breheny, P., and Huang, J. 2011. Coordinate descent algorithms for nonconvex penalized regression, with applications to biological feature selection. Annals of Applied Statistics 2:232253.
Cande`s, E. J.; Wakin, M. B.; and Boyd, S. P. 2008. Enhancing sparsity by reweighted 1 minimization. The Journal of Fourier Analysis and Applications 14(5):877905.
Censor, Y., and Zenios, S. A. 1997. Parallel Optimization: Theory, Algorithms, and Applications. Oxford, UK: Oxford University Press.
Chartrand, R., and Yin, W. 2008. Iteratively reweighted algorithms for compressive sensing. In The 33rd IEEE International Conference on Acoustics, Speech, and Signal Processing (ICASSP).
Daubechies, I.; Devore, R.; Fornasier, M.; and Gunturk, C. S. 2010. Iteratively reweighted least squares minimization for sparse recovery. Communications on Pure and Applied Mathematics 63(1):138.
Dempster, A. P.; Laird, N. M.; and Rubin, D. B. 1977. Maximum likelihood from incomplete data via the EM algorithm.Journal of the Royal Statistical Society Series B 39(1):138.
Fan, J., and Li, R. 2001. Variable selection via nonconcave penalized likelihood and its oracle properties. Journal of the American Statistical Association 96(456):13481360.
Friedman, J. H.; Hastie, T.; Hoefling, H.; and Tibshirani, R.2007. Pathwise coordinate optimization. The Annals of Applied Statistics 2(1):302332.
Gao, C.; Wang, N.; Yu, Q.; and Zhang, Z. 2011. A feasible nonconvex relaxation approach to feature selection. In Proceedings of the Twenty-Fifth AAAI Conference on Artificial Intelligence.
Gasso, G.; Rakotomamonjy, A.; and Canu, S. 2009. Recovering sparse signals with a certain family of non-convex penalties and dc programming. In IEEE Transactions on Signal Proessing, volume 57, 46864698.
Hastie, T. J.; Tibshirani, R. J.; and Friedman, J. 2009. The Elements of Statistical Learning: Data Mining, Inference, and Prediction. Springer-Verlag, second edition.
Hunter, D., and Li, R. 2005. Variable selection using MM algorithms. The Annals of Statistics 33(4):16171642.
Mazumder, R.; Friedman, J.; and Hastie, T. 2011.SparseNet: Coordinate descent with nonconvex penalties. Journal of the American Statistical Association 106(495):11251138.
Shi, J.; Ren, X.; Dai, G.; Wang, J.; and Zhang, Z. 2011. A non-convex relaxation approach to sparse dictionary learning. In Proceedings of the International Conference on Computer Vision and Pattern Recognition (CVPR).
Sriperumbudur, B. K., and Lanckriet, G. R. G. 2009. On the convergence of the concave-convex procedure. In Advances in Neural Information Processing Systems 22.
Tibshirani, R. 1996. Regression shrinkage and selection via the lasso. Journal of the Royal Statistical Society, Series B 58:267288.
Wipf, D., and Nagarajan, S. 2010. Iterative reweighted 1 and 2 methods for finding sparse solutions. IEEE Journal of Selected Topics in Signal Processing 4(2):317329.
Wu, C. F. J. 1983. On the convergence properties of the EM algorithm. The Annals of Statistics 11:95103.
Zhang, Z., and Tu, B. 2012. Nonconvex penalization using laplace exponents and concave conjugates. In Advances in Neural Information Processing Systems, 611619.
Zhang, C.-H. 2010a. Nearly unbiased variable selection under minimax concave penalty. The Annals of Statistics 38:894942.
Zhang, T. 2010b. Analysis of multi-stage convex relaxation for sparse regularization. Journal of Machine Learning Research 11:10811107.
Zou, H., and Li, R. 2008. One-step sparse estimates in nonconcave penalized likelihood models. The Annals of Statistics 36(4):15091533.
Zou, H. 2006. The adaptive lasso and its oracle properties. Journal of the American Statistical Association 101(476):14181429.
-----0
Barutcuoglu, Z.; Schapire, R.; and Troyanskaya, O. 2006.Hierarchical multi-label prediction of gene function. Bioinformatics 22(7):830836.
Blum, A., and Dunagan, J. 2002. Smoothed analysis of the perceptron algorithm for linear programming. In Proc. of the 13th Annual ACM-SIAM Symp. on Discrete Algorithms, 905914.
Cai, L., and Hofmann, T. 2004. Hierarchical document categorization with support vector machines. In Proceedings of the ACM Thirteenth Conference on Information and Knowledge Management.
Cesa-Bianchi, N.; Gentile, C.; and Zaniboni, L. 2006. Incremental algorithms for hierarchical classification. Journal of Machine Learning Research 7:3154.
Clare, A., and King, R. D. 2003. Learning quickly when irrelevant attributes abound: A new linearthreshold algorithm.Bioinformatics 19:ii42ii49.
Clarkson, K. L.; Hazan, E.; and Woodruff, D. P. 2010. Sublinear optimization for machine learning. In IEEE 51st Annual Symposium on Foundations of Computer Science.
Collins, M. 2002. Discriminative training methods for hidden markov models: Theory and experiments with perceptron algorithms. In EMNLP.
Crammer, K.; Dekel, O.; Keshet, J.; Shalev-Shwartz, S.; and Singer, Y. 2006. Online passive-aggressive algorithms.Journal of Machine Learning Research 7:551585.
Dekel, O.; Keshet, J.; and Singer, Y. 2004. Large margin hierarchical classification. In ICML.
Dumais, S., and Chen, H. 2000. Hierarchical classification of web content. In Research and Development in Information Retrieval.
D?ez, J.; del Coz, J. J.; and Bahamonde, A. 2010. A semi-dependent decomposition approach to learn hierarchical classifiers. Pattern Recognition 43(11):37953804.
Freund, Y., and Schapire, R. 1999. Large margin classification using the perceptron algorithm. Machine Learning 37(3):277296.
Gopal, S.; Yang, Y.; Bai, B.; and Niculescu-Mizil, A. 2012.Bayesian models for large-scale hierarchical classification.In NIPS.
Gyftodimos, G., and Flach, P. 2003. Hierarchical bayesian networks: an approach to classification and learning for structured data. In Proceedings of the ECML/PKDD 2003 Workshop on Probablistic Graphical Models for Classification.
Koller, D., and Sahami, M. 1997. Hierarchically classifying documents using very few words. In ICML.
Lafferty, J.; McCallum, A.; and Pereira, F. 2001. Conditional random fields: Probabilistic models for segmenting and labeling sequence data. In ICML.
Lewis, D. D.; Yang, Y.; Rose, T. G.; and Li, F. 2004. Rcv1: A new benchmark collection for text categorization research.Journal of Machine Learning Research 5:361397.
Littlestone, N. 1987. Learning quickly when irrelevant attributes abound: A new linear threshold algorithm. Machine Learning 2(4):285318.
Ratliff, N. D.; Bagnell, J. A.; and Zinkevich, M. A. 2007.(online) subgradient methods for structured prediction. In AISTATS.
Rousu, J.; Saunders, C.; Szedmak, S.; and Shawe-Taylor, J.2006. Kernel-based learning of hierarchical multilabel classification models. Journal of Machine Learning Research 7:16011626.
Sarawagi, S., and Gupta, R. 2008. Accurate max-margin training for structured output spaces. In ICML.
Shalev-Shwartz, S.; Singer, Y.; and Srebro, N. 2007. Pegasos: Primal estimated sub-gradient solver for svm. In ICML.
Shawe-Taylor, J., and Cristianini, N. 2004. Kernel Methods for Pattern Analysis. Cambridge University Press.
Silla, C. N., and Freitas, A. A. 2010. A survey of hierarchical classification across different application domains. Data Mining and Knowledge Discovery 22(1-2):3172.
Taskar, B.; Chatalbashev, V.; and Guestrin, C. 2005. Learning structured prediction models: A large margin approach.In ICML.
Taskar, B.; Guestrin, C.; and Koller, D. 2003. Max margin markov networks. In NIPS.
Tsochantaridis, I.; Joachims, T.; Hofmann, T.; and Altun, Y. 2005. Large margin methods for structured and interdependent output variables. Journal of Machine Learning Research 6:14531484.
Wang, Z.; Crammer, K.; and Vucetic, S. 2010. Multi-class pegasos on a budget. In ICML.Wu, F.; Zhang, J.; and Honavar, V. 2005. Learning classifiers using hierarchically structured class taxonomies. In Proceedings of symposium on abstraction reformulation, and approximation.
Zhou, D.; Xiao, L.; and Wu, M. 2011. Hierarchical classification via orthogonal transfer. In ICML.
Zinkevich, M. 2003. Online convex programming and generalized infinitesimal gradient ascent. In ICML, 928936.
-----0
Azaria, A.; Rabinovich, Z.; Kraus, S.; Goldman, C.; and Gal, Y.2012. Strategic advice provision in repeated human-agent interactions. In Proc. of National Conference on Artificial Intelligence (AAAI).
Bakos, J. 1997. Reducing buyer search costs: Implications for electronic marketplaces. Mng. Sci. 43(12):16761692.
Baumeister, R. 2003. The psychology of irrationality: Why people make foolish, self-defeating choices. In Brocas, I., and Carrillo, J., eds., The Psychology of Economic Decisions: Rationality and Well-Being. Oxford University Press.
Baye, M. R., and Morgan, J. 2006. Persistent price dispersion in online markets. In Jansen, D., ed., The New Economy and Beyond.Edward Elgar Press.
Baye, M. R.; Morgan, J.; and Scholten, P. 2004. Temporal price dispersion: Evidence from an online consumer electronics market.Journal of Interactive Marketing 18(4):101115.
Bikhchandani, S., and Sharma, S. 1996. Optimal search with learning. Journal of Economic Dynamics and Control 20(1):333359.
Brynjolfsson, E.; Hu, Y. J.; and Smith, M. D. 2003. Consumer surplus in the digital economy: Estimating the value of increased product variety at online bookseller. Management Science 49(11):15801596.
Clay, K.; Krishnan, R.; Wolff, E.; and Fernandes, D. 2002. Retail strategies on the web: Price and non-price competition in the online book industry. Journal of Industrial Economics 50:351367.
Decker, K.; Sycara, K.; and Williamson, M. 1997. Middle-agents for the internet. In Proc. of IJCAI, 578583.
Diehl, K. 2005. When two rights make a wrong: Searching too much in ordered environments. Journal of marketing resaerch.
Ellison, G., and Ellison, S. 2009. Search, obfuscation, and price elasticities on the internet. Econometrica 77(2):427452.
Gorman, M. F.; Salisbury, D.; and Brannon, I. 2009. Who wins when price information is more ubiquitous? an experiment to assess how infomediaries influence price. Electronic Markets 19(23):151162.
He, M.; Jennings, N. R.; and Leung, H. 2003. On agent-mediated electronic commerce. IEEE Transaction on Knowledge and Data Engineering 15(4):9851003.
Ipeirotis, P. 2010. Analyzing the amazon mechanical turk marketplace. XRDS: Crossroads, The ACM Magazine for Students 17(2):1621.
Janssen, M. C. W., and Moraga-Gonzalez, J. L. 2004. Strategic pricing, consumer search and the number of firms. Review of Economic Studies 71(4):10891118.
Janssen, M. C. W.; Moraga-Gonzalez, J. L.; and Wildenbeest, M. R.2005. Truly costly sequential search and oligopolistic pricing. International Journal of Industrial Organization 23(5-6):451466.
Johnson, E. J.; Moe, W. W.; Fader, P. S.; Bellman, S.; and Lohse, G. L. 2004. On the depth and dynamics of online search behavior.Management Science 50(3):299308.
Karat, C. M.; Blom, J. O.; and Karat, J. 2004. Designing personalized user experiences in eCommerce. Human-Computer Interaction Series. Kluwer Academic.
Kephart, J. O., and Greenwald, A. R. 2002. Shopbot economics.JAAMAS 5(3):255287.
Kephart, J. O.; Hanson, J. E.; and Greenwald, A. R. 2000. Dynamic pricing by software agents. Computer Networks 32:731752.
Knight, E. 2010. The Use of Price Comparison Sites in the UK General Insurance Market.
Krulwich, B. 1996. The bargainfinder agent: Comparison price shopping on the internet. In Williams, J., ed., Bots and Other Internet Beasties. Sams Publishing. chapter 13, 257263.
Markopoulos, P., and Kephart, J. 2002. How valuable are shopbots? In Proc. of AAMAS, 10091016. ACM.
Markopoulos, P., and Ungar, L. 2001. Pricing price information in e-commerce. In Proc. of ACM-EC, 260263.
Markopoulos, P., and Ungar, L. 2002. Shopbots and pricebots in electronic service markets. Game Theory and Decision Theory in Agent-Based Systems 177195.
Moraga-Gonzalez, J. L., and Wildenbeest, M. 2012. Comparison sites. In Peitz, M., and Waldfogel, J., eds., The Oxford Handbook of the Digital Economy. Oxford University Press.
Nermuth, M.; Pasini, G.; Pin, P.; and Weidenholzer, S. 2009. Price dispersion, search externalities, and the digital divide. Vienna Economics Papers 0916, Department of Economics.
Parzen, E. 1962. On estimation of a probability density function and mode. The annals of mathematical statistics 33(3):10651076.
Pathak, B. 2010. A survey of the comparison shopping agentbased decisions support systems. Journal of Electronic Commerce Research 11(3):177192.
Pereira, P. 2005. Do lower search costs reduce prices and price dispersion? Information Economics and Policy 17(1):6172.
Rao, A., and Monroe, K. 1989. The effect of price, brand name, and store name on buyers perceptions of product quality: An integrative review. Journal of marketing Research 351357.
Sarne, D.; Elmalech, A.; Grosz, B. J.; and Geva, M. 2011. Less is more: restructuring decisions to improve agent search. In Proc.of AAMAS, 431438. International Foundation for Autonomous Agents and Multiagent Systems.
Sarne, D.; Kraus, S.; and Ito, T. 2007. Scaling-up shopbots: a dynamic allocation-based approach. In Proc. of AAMAS, 256263.
Schwarz, G. 1978. Estimating the dimension of a model. The annals of statistics 6(2):461464.
Serenko, A., and Hayes, J. 2010. Investigating the functionality and performance of online shopping bots for electronic commerce: a follow-up study. International Journal of Electronic Business 8(1):115.
Stahl, D. O. 1989. Oligopolistic pricing with sequential consumer search. American Economic Review 79(4):700712.
Tan, C. H.; Goh, K. Y.; and Teo, H. H. 2010. Effects of comparison shopping websites on market performance: Does market structure matter? Journal of Electronic Commerce Research 11(3):193219.
Tang, Z.; Smith, M. D.; and Montgomery, A. 2010. The impact of shopbot use on prices and price dispersion: Evidence from online book retailing. International Journal of Industrial Organization 28(6):579590.
Varian, H. R. 1980. A model of sales. American Economic Review 70(4):65159.
Waldeck, R. 2008. Search and price competition. Journal of Economic Behavior and Organization 66(2):347357.
Wan, Y., and Peng, G. 2010. Whats next for shopbots? IEEE Computer 43:2026.
Wan, Y.; Menon, S.; and Ramaprasad, A. 2009. The paradoxical nature of electronic decision aids on comparison-shopping: The experiments and analysis. Journal of Theoretical and Applied Electronic Commerce Research 8096.
Xiao, B., and Benbasat, I. 2007. E-commerce product recommendation agents: Use, characteristics, and impact. MIS Quarterly 31(1):137209.
-----0
Ballester, M. A., and Haeringer, G. 2011. A characterization of the single-peaked domain. Social Choice and Welfare 36(2):305322.
Bartholdi, J.; Tovey, C.; and Trick, M. 1989. The computational difficulty of manipulating an election. Social Choice and Welfare 6(3):227241.
Bartholdi, J.; Tovey, C.; and Trick, M. 1992. How hard is it to control an election? Mathematical and Computer Modeling 16(8/9):2740.
Baumeister, D.; Erdelyi, G.; Hemaspaandra, E.; Hemaspaandra, L.; and Rothe, J. 2010. Computational aspects of approval voting. In Laslier, J., and Sanver, R., eds., Handbook on Approval Voting. Springer. chapter 10, 199251.
Black, D. 1948. On the rationale of group decision making.Journal of Political Economy 56(1):2334.
Brandt, F.; Brill, M.; Hemaspaandra, E.; and Hemaspaandra, L. A. 2010. Bypassing combinatorial protections: Polynomial-time algorithms for single-peaked electorates.
In Proceedings of the 24th AAAI Conference on Artificial Intelligence (AAAI-10), 715722. AAAI Press.
Brandt, F.; Conitzer, V.; and Endriss, U. 2012. Computational social choice. In Weiss, G., ed., Multiagent Systems.MIT Press.
Bredereck, R. 2012. Personal communication.Conitzer, V. 2009. Eliciting single-peaked preferences using comparison queries. Journal of Artificial Intelligence Research 35:161191.
Cornaz, D.; Galand, L.; and Spanjaard, O. 2012. Bounded single-peaked width and proportional representation. In Proceedings of the 20th European Conference on Artificial Intelligence (ECAI 2012), volume 242 of Frontiers in Artificial Intelligence and Applications, 270275. IOS Press.
Dwork, C.; Kumar, R.; Naor, M.; and Sivakumar, D. 2001.Rank aggregation methods for the web. In Proceedings of the 10th International World Wide Web Conference, 613 622. ACM Press.
Elkind, E.; Faliszewski, P.; and Slinko, A. M. 2012. Clone structures in voters preferences. In Proceedings of the 13th ACM Conference on Electronic Commerce (EC-12), 496 513. ACM.
Ephrati, E., and Rosenschein, J. 1997. A heuristic technique for multi-agent planning. Annals of Mathematics and Artificial Intelligence 20(14):1367.
Escoffier, B.; Lang, J.; and Ozturk, M. 2008. Singlepeaked consistency and its complexity. In Proceedings of the 18th European Conference on Artificial Intelligence (ECAI 2008), volume 178 of Frontiers in Artificial Intelligence and Applications, 366370. IOS Press.
Faliszewski, P., and Procaccia, A. D. 2010. AIs war on manipulation: Are we winning? AI Magazine 31(4):5364.
Faliszewski, P.; Hemaspaandra, E.; Hemaspaandra, L. A.; and Rothe, J. 2011a. The shield that never was: Societies with single-peaked preferences are more open to manipulation and control. Information and Computation 209(2):89 107.
Faliszewski, P.; Hemaspaandra, E.; and Hemaspaandra, L. A. 2009. How hard is bribery in elections? Journal of Artificial Intelligence Research 35:485532.
Faliszewski, P.; Hemaspaandra, E.; and Hemaspaandra, L. A. 2010. Using complexity to protect elections. Communications of the ACM 53(11):7482.
Faliszewski, P.; Hemaspaandra, E.; and Hemaspaandra, L. A. 2011b. The complexity of manipulative attacks in nearly single-peaked electorates. In Proceedings of the 13th Conference on Theoretical Aspects of Rationality and Knowledge (TARK-2011), 228237. Full version available as technical report arXiv:1105.5032v2 [cs.GT], ACM Computing Research Repository (CoRR), July 2012.
Frances, M., and Litman, A. 1997. On covering problems of codes. Theory of Computing Systems 30:113119.
Ghosh, S.; Mundhe, M.; Hernandez, K.; and Sen, S. 1999.Voting for movies: The anatomy of recommender systems. In Proceedings of the 3rd Annual Conference on Autonomous Agents, 434435. ACM Press.
Kendall, M. G. 1938. A new measure of rank correlation.Biometrika 30(1/2):pp. 8193.
Walsh, T. 2007. Uncertainty in preference elicitation and aggregation. In Proceedings of the 22nd AAAI Conference on Artificial Intelligence (AAAI-07), 38. AAAI Press.
-----0
Alber, J., Fernau, H., and Niedermeier, R. 2004. Parameterized complexity: exponential speed-up for planar graph problems. J. Algorithms 52(1):2656.
Amir, E. 2010. Approximation Algorithms for Treewidth.Algorithmica 56(4):448479.
Beigel, R., and Eppstein, D. 2005. 3-coloring in time O(1.3289n). J. Algorithms 54(2):168204.
Benhamou, B.; Paris, L.; and Siegel, P. 2012. Dealing with satisfiability and n-ary csps in a logical framework. Journal of Automated Reasoning 48(3):391417.
Bennaceur, H. 2004. A comparison between SAT and CSP techniques. Constraints 9(2):123138.
Bodlaender, H. L. 1996. A linear-time algorithm for finding tree-decompositions of small treewidth. SIAM J. Comput.25(6):13051317.
Bodlaender, H. L. 1998. A partial k-arboretum of graphs with bounded treewidth. Theoretical Computer Science 209(12):145.
Calabro, C.; Impagliazzo, R.; and Paturi, R. 2006. A duality between clause width and clause density for SAT. In 21st Annual IEEE Conference on Computational Complexity, CCC 2006, 252260. IEEE Computer Society.
Chen, J.; Chor, B.; Fellows, M.; Huang, X.; Juedes, D.; Kanj, I. A.; and Xia, G. 2005. Tight lower bounds for certain parameterized NP-hard problems. Information and Computation 201(2):216231.
Chen, J.; Kanj, I. A.; and Jia, W. 2001. Vertex cover: further observations and further improvements. J. Algorithms 41(2):280301.
Chen, J.; Kanj, I. A.; and Xia, G. 2009. On parameterized exponential time complexity. Theoretical Computer Science 410(27-29):26412648.
Dimopoulos, Y., and Stergiou, K. 2006. Propagation in CSP and SAT. In Benhamou, F., ed., Principles and Practice of Constraint Programming CP 2006, Proceedings, volume 4204 of Lecture Notes in Computer Science, 137151.Springer Verlag.
Feder, T., and Motwani, R. 2002. Worst-case time bounds for coloring and satisfiability problems. J. Algorithms 45(2):192 201.
Fellows, M. R.; Fomin, F. V.; Lokshtanov, D.; Rosamond, F.; Saurabh, S.; Szeider, S.; and Thomassen, C. 2011. On the complexity of some colorful problems parameterized by treewidth. Information and Computation 209(2):143153.
Flum, J., and Grohe, M. 2006. Parameterized Complexity Theory, volume XIV of Texts in Theoretical Computer Science. An EATCS Series. Berlin: Springer Verlag.
Freuder, E. C. 1990. Complexity of k-tree structured constraint satisfaction problems. In Shrobe, H. E.; Dietterich, 
T. G.; and Swartout, W. R., eds., Proceedings of the 8th National Conference on Artificial Intelligence., 49.
Gottlob, G.; Leone, N.; and Scarcello, F. 2000. A comparison of structural CSP decomposition methods. Artificial Intelligence 124(2):243282.
Gottlob, G.; Leone, N.; and Scarcello, F. 2002. Hypertree decompositions and tractable queries. J. of Computer and System Sciences 64(3):579627.
Grandoni, F., and Italiano, G. F. 2006. Algorithms and constraint programming. In Benhamou, F., ed., Principles and Practice of Constraint Programming CP 2006, Proceedings, volume 4204 of Lecture Notes in Computer Science, 214.Springer Verlag.
Grohe, M. 2006. The structure of tractable constraint satisfaction problems. In Kralovic, R., and Urzyczyn, P., eds., Mathematical Foundations of Computer Science 2006, MFCS 2006, Proceedings, volume 4162 of Lecture Notes in Computer Science, 5872. Springer Verlag.
Impagliazzo, R., and Paturi, R. 2001. On the complexity of k-SAT. J. of Computer and System Sciences 62(2):367375.
Impagliazzo, R.; Paturi, R.; and Zane, F. 2001. Which problems have strongly exponential complexity? J. of Computer and System Sciences 63(4):512530.
Jeavons, P., and Petke, J. 2012. Local consistency and satsolvers. J. Artif. Intell. Res. 43:329351.
Lokshtanov, D.; Marx, D.; and Saurabh, S. 2011. Lower bounds based on the exponential time hypothesis. Bulletin of the European Association for Theoretical Computer Science 105:4172.
Marx, D. 2010a. Can you beat treewidth? Theory of Computing 6:85112.
Marx, D. 2010b. Tractable hypergraph properties for constraint satisfaction and conjunctive queries. In Schulman, L. J., ed., Proceedings of the 42nd ACM Symposium on Theory of Computing, STOC 2010, Cambridge, Massachusetts, USA, 5-8 June 2010, 735744. ACM.
Papadimitriou, C. H., and Yannakakis, M. 1991. Optimization, approximation, and complexity classes. J. of Computer and System Sciences 43(3):425440.
Papadimitriou, C. H., and Yannakakis, M. 1999. On the complexity of database queries. J. of Computer and System Sciences 58(3):407427.
Razgon, I. 2006. Complexity analysis of heuristic CSP search algorithms. In Hnich, B.; Carlsson, M.; Fages, F.; and 
Rossi, F., eds., Recent Advances in Constraints, CSCLP 2005, Revised Selected and Invited Papers, volume 3978 of Lecture Notes in Computer Science, 8899. Springer Verlag.
Rossi, F.; van Beek, P.; and Walsh, T., eds. 2006. Handbook of Constraint Programming. Elsevier.
Schuler, R. 2005. An algorithm for the satisfiability problem of formulas in conjunctive normal form. J. Algorithms 54(1):4044.
Traxler, P. 2008. The time complexity of constraint satisfaction. In Grohe, M., and Niedermeier, R., eds., Proceedings of the Third International Workshop on Parameterized and Exact Computation 2008, volume 5018 of Lecture Notes in Computer Science, 190201. Springer Verlag.
-----0
Bassi, A. 2008. Voting systems and strategic manipulation: an experimental study. Technical report, mimeo.
Conitzer, V.; Davenport, A.; and Kalagnanam, J. 2006. Improved bounds for computing kemeny rankings. In Proc. of AAAI.
Conitzer, V. 2006. Computing slater rankings using similarities among candidates. In Proc. of AAAI.
Cox, G. 1997. Making votes count: strategic coordination in the worlds electoral systems, volume 7. Cambridge Univ Press.
Dhillon, A., and Lockwood, B. 2004. When are plurality rule voting games dominance-solvable? Games and Economic Behavior 46(1):5575.
Dokow, E., and Holzman, R. 2010. Aggregation of binary evaluations. Journal of Economic Theory 145(2):495511.
Dwork, C.; Kumar, R.; Naor, M.; and Sivakumar, D. 2001.Rank aggregation methods for the web. In Proceedings of the 10th international conference on World Wide Web.
Ephrati, E.; Rosenschein, J.; et al. 1993. Multi-agent planning as a dynamic search for social consensus. In Proc. of IJCAI.
Forsythe, R.; Rietz, T.; Myerson, R.; and Weber, R. 1996.An experimental study of voting rules and polls in threecandidate elections. International Journal of Game Theory 25(3):355383.
Gibbard, A. 1977. Manipulation of schemes that mix voting with chance. Econometrica: Journal of the Econometric Society 665681.
Gohar, N. 2012. Manipulative Voting Dynamics. Ph.D.Dissertation, University of Liverpool.
Kemeny, J. 1959. Mathematics without numbers. Daedalus 88(4):577591.
Lin, R., and Kraus, S. 2010. Can automated agents proficiently negotiate with humans? Communications of the ACM 53(1):7888.
Mao, A.; Procaccia, A.; and Chen, Y. 2012. Social choice for human computation. In HCOMP-12: Proc. 4th Human Computation Workshop.
May, K. 1952. A set of independent necessary and sufficient conditions for simple majority decision. Econometrica: Journal of the Econometric Society 680684.
Meir, R.; Polukarov, M.; Rosenschein, J.; and Jennings, N.2010. Convergence to equilibria in plurality voting. In Proceedings of AAAI.
Palfrey, T. 2009. Laboratory experiments in political economy. Annual Review of Political Science 12:379388.
Pennock, D.; Horvitz, E.; Giles, C.; et al. 2000. Social choice theory and recommender systems: Analysis of the axiomatic foundations of collaborative filtering. In Proc. of AAAI.
Regenwetter, M., and Rykhlevskaia, E. 2007. A general concept of scoring rules: general definitions, statistical inference, and empirical illustrations. Social Choice and Welfare 29(2):211228.
Reijngoud, A., and Endriss, U. 2012. Voter response to iterated poll information. In Proceedings of the 11th International Conference on Autonomous Agents and Multiagent Systems.
Riker, W., and Ordeshook, P. 1968. A theory of the calculus of voting. The American Political Science Review 62(1):25 42.
Satterthwaite, M. 1975. Strategy-proofness and arrows conditions: Existence and correspondence theorems for voting procedures and social welfare functions. Journal of economic theory 10(2):187217.
Wilson, R. 1975. On the theory of aggregation. Journal of Economic Theory 10(1):8999.
Young, H., and Levenglick, A. 1978. A consistent extension of condorcets election principle. SIAM Journal on Applied Mathematics 35(2):285300.
-----0
Alon, N.; Bredereck, R.; Chen, J.; Kratsch, S.; Niedermeier, R.; and Woeginger, G. J. 2013. How to (ab)use a multiple referendum for your hidden agenda. manuscript.
Bartholdi, J.; Tovey, C.; and Trick, M. 1992. How hard is it to control an election? Mathematical and Computer Modelling 16(8):2740.
Baumeister, D.; Erdelyi, G.; Erdelyi, O.; and Rothe, J. 2012.Control in judgment aggregation. In STAIRS12. 2334.
Christian, R.; Fellows, M.; Rosamond, F.; and Slinko, A.2007. On complexity of lobbying in multiple referenda. Review of Economic Design 11:217224.
Conitzer, V.; Lang, J.; and Xia, L. 2009. How hard is it to control sequential elections via the agenda. In IJCAI09, 103108.
Endriss, U.; Grandi, U.; and Porello, D. 2010a. Complexity of judgment aggregation: Safety of the agenda. In AAMAS10, 359366.
Endriss, U.; Grandi, U.; and Porello, D. 2010b. Complexity of winner determination and strategic manipulation in judgment aggregation. In Conitzer, V., and Rothe, J., eds., COMSOC10.
Farquharson, R. 1969. Theory of Voting. Yale Uni. Press.Hemaspaandra, E.; Hemaspaandra, L.; and Rothe, J. 2007.Hybrid elections broaden complexity-theoretic resistance to control. In IJCAI07, 13081314.
Karp, R. M. 1972. Reducibility among combinatorial problems. Springer.
Lacy, D., and Niou, E. 2000. A problem with referendums.Journal of Theoretical Politics 12(1):531.
Levmore, S. 1999. Voting paradoxes and interest groups.The Journal of Legal Studies 28(2):259281.
Lublin, D. 1999. The paradox of representation: Racial gerrymandering and minority interests in Congress. Princeton University Press.
Nehama, I. 2013. Complexity of optimal lobbying in threshold aggregation (extended abstract). In AAMAS13. to appear.
Palfrey, T. 1983. Bundling decisions by a multiproduct monopolist with incomplete information. Econometrica: Journal of the Econometric Society 463483.
Tasnadi, A. 2011. The political districting problem: A survey. Society and Economy 33(3):543554.
Xia, L.; Lang, J.; and Ying, M. 2007. Sequential voting rules and multiple elections paradoxes. In TARK07, 279 288. ACM.
-----0
Amir, E. 2000. (De)composition of situation calculus theories. In Kautz, H. A., and Porter, B. W., eds., AAAI/IAAI, 456463. AAAI Press / The MIT Press.
Amir, E. 2002. Projection in decomposed situation calculus. In Fensel, D.; Giunchiglia, F.; McGuinness, D. L.; and 
Williams, M.-A., eds., KR, 315326. Morgan Kaufmann.Cook, S. A., and Liu, Y. 2003. A complete axiomatization for blocks world. J. Log. Comput. 13(4):581594.
Craig, W. 1957. Three uses of the herbrand-gentzen theorem in relating model theory and proof theory. J. Symb. Log.22(3):269285.
Craig, W. 2008. The road to two theorems of logic. Synthese 164(3):333339.
Fox, D., and Gomes, C. P., eds. 2008. Proceedings of the Twenty-Third AAAI Conference on Artificial Intelligence, 
AAAI 2008, Chicago, Illinois, USA, July 13-17, 2008. AAAI Press.
Gruninger, M.; Hahmann, T.; Hashemi, A.; Ong, D.; and Ozgovde, A. 2012. Modular first-order ontologies via repositories. Applied Ontology 7(2):169209.
Gu, Y., and Soutchanski, M. 2008. Reasoning about large taxonomies of actions. In Fox and Gomes (2008), 931937.
Gu, Y., and Soutchanski, M. 2010. A description logic based situation calculus. Ann. Math. Artif. Intell. 58(1-2):383.
Inclezan, D., and Gelfond, M. 2011. Representing biological processes in modular action language ALM . In AAAI Spring Symposium: Logical Formalizations of Commonsense Reasoning. AAAI.
Kakas, A. C.; Michael, L.; and Miller, R. 2011. Modular-E and the role of elaboration tolerance in solving the qualification problem. Artif. Intell. 175(1):4978.
Konev, B.; Lutz, C.; Walther, D.; and Wolter, F. 2009.Formal properties of modularisation. In Stuckenschmidt, 
H.; Parent, C.; and Spaccapietra, S., eds., Modular Ontologies, volume 5445 of Lecture Notes in Computer Science.Springer. 2566.
Konev, B.; Lutz, C.; Ponomaryov, D.; and Wolter, F. 2010.Decomposing description logic ontologies. In Lin, F.; Sattler, U.; and Truszczynski, M., eds., KR. AAAI Press.
Kourousias, G., and Makinson, D. 2007. Parallel interpolation, splitting, and relevance in belief change. J. Symb. Log.72(3):9941002.
Lin, F., and Reiter, R. 1994. Forget it! In Proceedings of the AAAI Fall Symposium on Relevance, 154159.
Lin, F., and Reiter, R. 1997. How to progress a database.Artificial Intelligence 92:131167.
Liu, Y., and Lakemeyer, G. 2009. On first-order definability and computability of progression for local-effect actions and beyond. In Boutilier, C., ed., IJCAI, 860866.
Lutz, C., and Wolter, F. 2009. Mathematical logic for life science ontologies. In Ono, H.; Kanazawa, M.; and de Queiroz, R. J. G. B., eds., WoLLIC, volume 5514 of Lecture Notes in Computer Science, 3747. Springer.
Lutz, C., and Wolter, F. 2010. Deciding inseparability and conservative extensions in the description logic el. J. Symb.Comput. 45(2):194228.
McCarthy, J., and Hayes, P. 1969. Some philosophical problems from the standpoint of artificial intelligence. In Meltzer, B., and Michie, D., eds., Machine Intelligence, volume 4. Edinburgh University Press, Reprinted in (McCarthy 1990). 463502.
McCarthy, J. 1990. Formalization of common sense: papers by John McCarthy edited by V. Lifschitz. Norwood, N.J.: Ablex.
Pirri, F., and Reiter, R. 1999. Some contributions to the metatheory of the situation calculus. Journal of the ACM 46(3):325364.
Ponomaryov, D. 2008. On decomposibility in logical calculi. Bulletin of the Novosibirsk Computing Center 28:111 120.Reiter, R. 2001. Knowledge in Action: Logical Foundations for Describing and Implementing Dynamical Systems. The MIT Press.
Soutchanski, M., and Yehia, W. 2012. Towards an expressive practical logical action theory. In Voronkov, A., ed., Turing-100, volume 10 of EPiC Series, 307325. EasyChair.
Vassos, S., and Levesque, H. J. 2008. On the progression of situation calculus basic action theories: Resolving a 10year-old conjecture. In Fox and Gomes (2008), 10041009.
-----0
Aumann, R., and Dre`ze, J. H. 1974. Cooperative games with coalition structures. International Journal of Game Theory 3:217237.
Aziz, H.; Lachish, O.; Paterson, M.; and Savani, R. 2009.Power indices in spanning connectivity games. In AAIM09, 5567.
Aziz, H.; Brandt, F.; and Harrenstein, P. 2010. Monotone cooperative games and their threshold versions. In AAMAS10, 10171024.
Bachrach, Y.; Elkind, E.; Meir, R.; Pasechnik, D.; Zuckerman, M.; Rothe, J.; and Rosenschein, J. S. 2009. The cost of stability in coalitional games. In SAGT09, 122134.
Bachrach, Y.; Meir, R.; Jung, K.; and Kohli, P. 2010. Coalitional structure generation in skill games. In AAAI10, 703 708.
Bilbao, J. M. 2000. Cooperative Games on Combinatorial Structures. Kluwer Publishers.
Bodlaender, H. L. 2005. Discovering treewidth. In SOFSEM05, 116.
Branzei, S., and Larson, K. 2011. Social distance games. In IJCAI11, 9196.
Breton, M.; Owen, G.; and Weber, S. 1992. Strongly balanced cooperative games. International Journal of Game Theory 20:419427.
Chalkiadakis, G.; Markakis, E.; and Jennings, N. R. 2012.Coalitional stability in structured environments. In AAMAS12, 779786.
Conitzer, V., and Sandholm, T. 2006. Complexity of constructing solutions in the core based on synergies among coalitions. Artificial Intelligence 170(67):607619.
Courcelle, B. 1990. Graph rewriting: An algebraic and logic approach. In Handbook of Theoretical Computer Science, volume B. 193242.
Demange, G. 2004. On group stability in hierarchies and networks. Journal of Political Economy 112(4):754778.
Deng, X., and Papadimitriou, C. H. 1994. On the complexity of cooperative solution concepts. Mathematics of Operations Research 19(2):257266.
Deng, X.; Ibaraki, T.; and Nagamochi, H. 1997. Algorithms and complexity in combinatorial optimization games.In SODA97, 720729.
Devanur, N. R.; Mihail, M.; and Vazirani, V. V. 2005. Strategyproof cost-sharing mechanisms for set cover and facility location games. Decision Support Systems 39:1122.
Gottlob, G.; Leone, N.; and Scarcello, F. 2001. Hypertree decompositions: A survey. In MFCS01, 3757.
Greco, G.; Malizia, E.; Palopoli, L.; and Scarcello, F. 2011a.On the complexity of core, kernel, and bargaining set. Artificial Intelligence 175(1213):18771910.
Greco, G.; Malizia, E.; Palopoli, L.; and Scarcello, F. 2011b.On the complexity of the core over coalition structures. In IJCAI11, 216221.
Ieong, S., and Shoham, Y. 2005. Marginal contribution nets: a compact representation scheme for coalitional games. In EC05, 193202.
Jain, K., and Vazirani, V. 2001. Applications of approximation algorithms to cooperative games. In STOC01, 364 372.
Maschler, M.; Peleg, B.; and Shapley, L. S. 1979. Geometric properties of the kernel, nucleolus, and related solution concepts. Mathematics of Operations Research 4(4):303338.
Meir, R.; Bachrach, Y.; and Rosenschein, J. S. 2010. Minimal subsidies in expense sharing games. In SAGT10, 347 358.
Meir, R.; Rosenschein, J. S.; and Malizia, E. 2011. Subsidies, stability, and restricted cooperation in coalitional games. In IJCAI11, 301306.
Myerson, R. 1977. Graphs and cooperation in games. Mathematics of Operations Research 2(3):225229.
Potters, J., and Reijnierse, H. 1995. ?-component additive games. International Journal of Game Theory 24(1):4956.
Resnick, E.; Bachrach, Y.; Meir, R.; and Rosenschein, J. S.2009. The cost of stability in network flow games. In MFCS09, 636650.
Voice, T.; Polukarov, M.; and Jennings, N. R. 2012. Coalition structure generation over graphs. Journal of Artificial Intelligence Research 45:165196.
-----0
Alam, M.; Ramchurn, S. D.; and Rogers, A. 2013. Cooperative energy exchange for the efficient use of energy and resources in remote communities. In International Conference on Autonomous Agents and Multiagent Systems (AAMAS).
Alam, M.; Rogers, A.; and Ramchurn, S. D. 2011. A negotiation protocol for multiple interdependent issues negotiation over energy exchange. In Proceedings of the AI for an Intelligent Planet, AIIP Workshop, 1:11:6. New York, USA: ACM.
Fujita, K.; Ito, T.; and Klein, M. 2010. Representative-based protocol for multiple interdependent issue negotiation problems. InTech 347363.
Hattori, H.; Klein, M.; and Ito, T. 2007. A multi-phase protocol for negotiation with interdependent issues. In Proceedings of IEEE/WIC/ACM International Conference on Intelligent Agent Technology., 153 159.
Hindriks, K.; Jonker, C.; and Tykhonov, D. 2006. Reducing complexity of an agents utility space for negotiating interdependent issues. InterJournal for Complex Systems.
IEA. 2010. World energy outlook. Technical report, International Energy Agency.
Ito, T.; Hattori, H.; and Klein, M. 2007. Multi-issue negotiation protocol for agents: exploring nonlinear utility spaces.
In Proceedings of the 20th International Joint Conference on Artifical Intelligence, 13471352.
Nash, J. 1950. The bargaining problem. Econometrica 18(2):155162.
Nash, J. A. 1953. Two-person cooperative games. Econometrica 21(1):128140.
Rosenschein, J. S., and Zlotkin, G. 1994. Rules of encounter: designing conventions for automated negotiation among computers. In Rules of encounter. Cambridge, MA, USA: MIT Press.United Nations. 2012. What will it take to acheive the millennium development goals. Technical report, United Nations Development Programme.
Vytelingum, P.; Voice, T. D.; Ramchurn, S. D.; Rogers, A.; and Jennings, N. R. 2011. Theoretical and practical foundations of large-scale agent-based micro-storage in the smart grid. J. Artif. Int. Res. 42(1):765813.
-----0
Alkhazraj, Y.; Wehrle, M.; Mattmuller, R.; and Helmert, M.
2012. A stubborn set algorithm for optimal planning. In Proc. ECAI.
Borchers, B. 1999. Csdp, ac library for semidefinite programming. Optimization Methods and Software 11(14):613623.
Boyd, S., and Vandenberghe, L. 2004. Convex Optimization.New York, NY, USA: Cambridge University Press.
Chen, Y., and Yao, G. 2009. Completeness and Optimality Preserving Reduction for Planning. In Proc. IJCAI.
Chen, W.; Weinberger, K.; and Chen, Y. 2013. Maximum variance correction with application to A? search. In Proc.ICML.
Chen, Y.; Xu, Y.; and Yao, G. 2009. Stratified Planning. In Proc. IJCAI.
Geisberger, R.; Sanders, P.; Schultes, D.; and Delling, D.2008. Contraction hierarchies: faster and simpler hierarchical routing in road networks. In Proc. ICEA, 319333.
Gupta, N., and Nau, D. 1992. On the complexity of blocksworld planning. Artificial Intelligence 56(2):223254.
Helmert, M., and Roger, G. 2008. How good is almost perfect? In Proceedings of the 23rd national conference on Artificial intelligence Volume 2, AAAI08, 944949. AAAI Press.
Jones, M. 2008. Artificial Intelligence: A Systems Approach: A Systems Approach. Jones & Bartlett Learning.
Mero, L. 1984. A heuristic search algorithm with modifiable estimate. JAIR 23:1327.
Ng, T., and Zhang, H. 2002. Predicting internet network distance with coordinates-based approaches. In Proc. INFOCOM, 170179.
Rayner, C.; Bowling, M.; and Sturtevant, N. 2011. Euclidean Heuristic Optimization. In Proc. AAAI, 8186.
Sturtevant, N. R.; Felner, A.; Barrer, M.; Schaeffer, J.; and Burch, N. 2009. Memory-based heuristics for explicit state spaces. In Proc. IJCAI, 609614.
Sturtevant, N. R. 2007. Memory-efficient abstractions for pathfinding. In Schaeffer, J., and Mateas, M., eds., Proc.AIIDE, 3136.
Tenenbaum, J. B.; Silva, V.; and Langford, J. C. 2000. A Global Geometric Framework for Nonlinear Dimensionality Reduction. Science 290(5500):23192323.
Wehrle, M., and Helmert, M. 2012. About partial order reduction in planning and computer aided verification. In Proc. ICAPS.Weinberger, K., and Saul, L. 2006. Unsupervised learning of image manifolds by semidefinite programming. International Journal of Computer Vision 70:7790.
Weinberger, K.; Sha, F.; Zhu, Q.; and Saul, L. 2007.Graph laplacian regularization for large-scale semidefinite programming. In Proc. NIPS.
Weinberger, K.; Packer, B.; and Saul, L. 2005. Nonlinear dimensionality reduction by semidefinite programming and kernel matrix factorization. In Proc. Intl Workshop on Artificial Intelligence and Statistics.
Wolfe, J., and Russell, S. 2011. Bounded intention planning.In Proc. IJCAI.
Zahavi, U.; Felner, A.; Schaeffer, J.; and Sturtevant, N. 2007.Inconsistent heuristics. In Proc. AAAI, 12111216.
-----0
Castillo, L. A.; Fernandez-Olivares, J.; Garc?a-Perez, O.; and Palao, F. 2006. Efficiently handling temporal knowledge in an HTN planner. In Proceedings of the Sixteenth International Conference on Automated Planning and Scheduling, ICAPS 2006, 6372.
Cesta, A., and Oddi, A. 1996. Gaining efficiency and flexibility in the simple temporal problem. In Proceedings of the 3rd Workshop on Temporal Representation and Reasoning (TIME96), TIME 96, 45. IEEE Computer Society.
Dechter, R.; Meiri, I.; and Pearl, J. 1991. Temporal constraint networks. Artificial Intelligence 49:6195.
Erol, K.; Hendler, J.; and Nau, D. S. 1994. Semantics for hierarchical task-network planning. Technical report, University of Maryland at College Park, College Park, MD, USA.
Floyd, R. W. 1962. Algorithm 97: Shortest path. Commun.ACM 5(6):345.
Laborie, P., and Ghallab, M. 1995. Planning with sharable resource constraints. In Proceedings of the 14th international joint conference on Artificial intelligence Volume 2, IJCAI95, 16431649.
Mohr, R., and Henderson, T. 1986. Arc and path consistency revisited. Artificial Intelligence 28(2):225233.
Mulvehill, A.; Rager, D.; and Bostwick, R. 2012. Collaborative incremental model development for an adaptive modeldriven planning system. In Cognitive Methods in Situation Awareness and Decision Support (CogSIMA), 1 6.
Myers, K. L.; Tyson, W. M.; Wolverton, M. J.; Jarvis, P. A.; Lee, T. J.; and desJardins, M. 2002. Passat: A user-centric planning framework. In Proceedings of the Third International NASA Workshop on Planning and Scheduling for Space.
Planken, L. 2008. Incrementally solving the stp by enforcing partial path consistency. In Proceedings of the 27th Workshop of the UK Planning and Scheduling Special Interest Group (PlanSIG 2008), 8794. IEEE Computer Society.
Tate, A.; Drabble, B.; and Kirby, R. 1994. O-plan2: an open architecture for command, planning and control. In Intelligent Scheduling, 213239. Morgan Kaufmann.
Wilkins, D. E. 1997. Using the sipe-2 planning system a manual for sipe-2, version 4.14.
Yaman, F., and Nau, D. S. 2002. Timeline: An HTN planner that can reason about time. In AIPS Workshop on Planning for Temporal Domains, 7581.
Yorke-Smith, N. 2005. Exploiting the structure of hierarchical plans in temporal constraint propagation. In Proceedings of the 20th national conference on Artificial intelligence Volume 3, AAAI05. AAAI Press.
-----0
Ando, R. K., and Zhang, T. 2005. A high-performance semi-supervised learning method for text chunking. In Proceedings of ACL.
Blum, A., and Mitchell, T. 1998. Combining labeled and unlabeled data with co-training. In Proceedings of COLT.
Bunescu, R., and Mooney, R. J. 2004. Collective information extraction with relational markov networks. In Proceedings of ACL.
Burkett, D.; Petrov, S.; Blitzer, J.; and Klein, D. 2010.Learning better monolingual models with unannotated bilingual text. In Proceedings of CoNLL.
Collins, M., and Singer, Y. 1999. Unsupervised models for named entity classification. In Proceedings of EMNLP.
Das, D., and Petrov, S. 2011. Unsupervised part-of-speech tagging with bilingual graph-based projections. In Proceedings of ACL.
Efron, B., and Tibshirani, R. J. 1993. An Introduction to the Bootstrap. New York: Chapman & Hall.
Finkel, J. R.; Grenager, T.; and Manning, C. 2005. Incorporating non-local information into information extraction systems by gibbs sampling. In Proceedings of ACL.
Fu, R.; Qin, B.; and Liu, T. 2011. Generating chinese named entity data from a parallel corpus. In Proceedings of IJCNLP.
Ganchev, K.; Graca, J.; Blitzer, J.; and Taskar, B. 2008.Multi-view learning over structured and non-identical outputs. In Proceedings of UAI.
Geman, S., and Geman, D. 1984. Stochastic relaxation, Gibbs distributions, and the Bayesian restoration of images.IEEE Transitions on Pattern Analysis and Machine Intelligence 6:721741.
Hovy, E.; Marcus, M.; Palmer, M.; Ramshaw, L.; and Weischedel, R. 2006. Ontonotes: the 90% solution. In Proceedings of NAACL-HLT.
Kim, S.; Toutanova, K.; and Yu, H. 2012. Multilingual named entity recognition using parallel data and metadata from wikipedia. In Proceedings of ACL.
Kirkpatrick, S.; Gelatt, C. D.; and Vecchi, M. P. 1983. Optimization by simulated annealing. Science 220:671680.
Lafferty, J. D.; McCallum, A.; and Pereira, F. C. N. 2001.Conditional random fields: Probabilistic models for segmenting and labeling sequence data. In Proceedings of ICML.
Li, Q.; Li, H.; Ji, H.; Wang, W.; Zheng, J.; and Huang, F.2012. Joint bilingual name tagging for parallel corpora. In Proceedings of CIKM.
Liang, P.; Taskar, B.; and Klein, D. 2006. Alignment by agreement. In Proceedings of HLT-NAACL.
Petrov, S.; Chang, P.-C.; Ringgaard, M.; and Alshawi, H.2010. Uptraining for accurate deterministic question parsing. In Proceedings of EMNLP.Riloff, E., and Jones, R. 1999. Learning dictionaries for information extraction by multi-level bootstrapping. In Proceedings of AAAI.
Rush, A. M.; Reichert, R.; Collins, M.; and Globerson, A. 2012. Improved parsing and POS tagging using inter-sentence consistency constraints. In Proceedings of EMNLP.
Sutton, C., and McCallum, A. 2004. Collective segmentation and labeling of distant entities in information extraction.
In Proceedings of ICML Workshop on Statistical Relational Learning and Its connections to Other Fields.
Yarowsky, D., and Ngai, G. 2001. Inducing multilingual POS taggers and NP brackets via robust projection across aligned corpora. In Proceedings of NAACL.
Yarowsky, D. 1995. Unsupervised word sense disambiguation rivaling supervised methods. In Proceedings of ACL.
-----0
Alechina, N.; Behrens, T.; Hindriks, K.; and Logan, B. 2012. Query caching in agent programming languages. In Dastani, M.; Logan, B.; and Hubner, J. F., eds., Proceedings of the Tenth International Workshop on Programming Multi-Agent Systems (ProMAS 2012), 117131.
Behrens, T. M.; Dix, J.; Hubner, J.; and Koster, M. 2011.Special issue: The multi-agent programming contest: Environment interface and contestants in 2010, editorial. Annals of Mathematics and Artificial Intelligence 61(4):257260.
Bordini, R. H.; Hubner, J. F.; and Wooldridge, M. 2007. Programming Multi-Agent Systems in AgentSpeak using Jason.Wiley.
Software Technology Branch, Lyndon B. Johnson Space Center, Houston. 2003. CLIPS Reference Manual: Version 6.21.
Dastani, M.; de Boer, F.; Dignum, F.; and Meyer, J.-J. 2003.Programming agent deliberation: an approach illustrated using the 3APL language. In Proceedings of the Second International Joint Conference on Autonomous Agents and Multiagent Systems (AAMAS03), 97104. New York, NY, USA: ACM Press.
Dastani, M.; Dix, J.; and Novak, P. 2006. The first contest on multi-agent systems based on computational logic. In Toni, F., and Torroni, P., eds., Computational Logic in Multi-Agent Systems, 6th International Workshop, CLIMA VI, London, UK, June 27-29, 2005, Revised Selected and Invited Papers, 373384. Springer.
Dastani, M. 2008. 2APL: a practical agent programming language. Journal of Autonomous Agents and Multi-Agent Systems 16(3):214248.
De Giacomo, G.; Lesperance, Y.; Levesque, H. J.; and Sardina, S. 2009. IndiGolog: A high-level programming language for embedded reasoning agents. In Bordini, R. H.; 
Dastani, M.; Dix, J.; and Fallah-Seghrouchni, A. E., eds., Multi-Agent Programming: Languages, Platforms and Applications. Springer. 3172.
Dennis, L. 2012. Plan indexing for state-based plans. In Sakama, C.; Sardina, S.; Vasconcelos, W.; and Winikoff, M., eds., Declarative Agent Languages and Technologies IX 9th International Workshop, DALT 2011, Taipei, Taiwan, May 3, 2011, Revised Selected and Invited Papers, volume 7169 of LNCS, 315. Springer.
Forgy, C. 1982. Rete: a fast algorithm for the many pattern/many object pattern match problem. Artificial Intelligence 19(1):1737.
Hindriks, K. V. 2009. Programming rational agents in goal. In El Fallah Seghrouchni, A.; Dix, J.; Dastani, M.; and 
Bordini, R. H., eds., Multi-Agent Programming: Languages, Tools and Applications. Springer US. 119157.
Jena. 2011. http://jena.sourceforge.net/.
Koch, F., and Dignum, F. 2010. Enhanced deliberation in BDI-modelled agents. In Demazeau, Y.; Dignum, F.; Corchado, J.; and Bajo-Perez, J., eds., Advances in Practical Applications of Agents and Multiagent Systems (PAAMS 2010), volume 70 of Advances in Soft Computing, 5968. Springer.
Laird, J. E.; Newell, A.; and Rosenbloom, P. S. 1987.SOAR: An architecture for general intelligence. Artificial Intelligence 33:164.
Miranker, D. P. 1987. TREAT: A better match algorithm for AI production systems. In Proceedings of the Sixth National Conference on Artificial Intelligence (AAAI87), 42 47. AAAI Press.
Singh, D.; Sardina, S.; Padgham, L.; and James, G. 2011.Integrating Learning into a BDI Agent for Environments with Changing Dynamics. In Walsh, T., ed., Proceedings of the 22nd International Joint Conference on Artificial Intelligence (IJCAI 2011), 25252530.
Swift, T., and Warren, D. S. 2010. XSB: Extending Prolog with tabled logic programming. CoRR abs/1012.5123.
Thielscher, M. 2002. Pushing the envelope: Programming reasoning agents. In AAAI Workshop Technical Report WS02-05: Cognitive Robotics. AAAI Press.
-----0
Bench-Capon, T.; Atkinson, K.; and McBurney, P. 2009.Altruism and agents: an argumentation based approach to designing agent decision mechanisms. In Proceedings of AAMAS.
Coehoorn, R. M., and Jennings, N. R. 2004. Learning on opponents preferences to make effective multi-issue negotiation trade-offs. In Proceedings of EC.
Gal, Y.; Grosz, B.; Kraus, S.; Pfeffer, A.; and Shieber, S.2010. Agent Decision-Making in Open-Mixed networks.Artificial Intelligence.
Gal, Y.; Kraus, S.; Gelfand, M.; Khashan, H.; and Salmon, E. 2011. An adaptive agent for negotiating with people in different cultures. ACM Transactions on Intelligent Systems and Technology (TIST) 3(1):8.
Haim, G.; Gal, Y. K.; Gelfand, M.; and Kraus, S. 2012.A cultural sensitive agent for human-computer negotiation.
In Proceedings of the 11th International Conference on Autonomous Agents and Multiagent Systems-Volume 1, 451 458. International Foundation for Autonomous Agents and Multiagent Systems.
Hindriks, K., and Tykhonov, D. 2008. Opponent modelling in automated multi-issue negotiation using bayesian learning. In Proc. of AAMAS, 331338.
Jonker, C. M.; Robu, V.; and Treur, J. 2007. An agent architecture for multi-attribute negotiation using incomplete preference information. Autonomous Agents and Multi-Agent Systems 15(2):221252.
Kittur, A.; Chi, E. H.; and Suh, B. 2008. Crowdsourcing user studies with Mechanical Turk. 453. ACM Press.
Oshrat, Y.; Lin, R.; and Kraus, S. 2009. Facing the challenge of human-agent negotiations via effective general opponent modeling. In Proc. of AAMAS.
Peled, N.; Kraus, S.; and Gal, K. 2011. A study of computational and human strategies in revelation games. In Proc.of AAMAS.
Sarne, D., and Grosz, B. J. 2007. Estimating information value in collaborative multi-agent planning systems. In Proceedings of the Sixth International Joint Conference on Autonomous Agents and Multiagent Systems (AAMAS 2007), 4855.
Sarne, D., and Kraus, S. 2003. The search for coalition formation in costly environments. In Proceedings of the Seventh International Workshop on Cooperative Information Agents (CIA03), 117136.
-----0
Casella, G., and Robert, C. P. 1996. Rao-Blackwellisation of Sampling Schemes. Biometrika 83(1):8194.Chib, S. 1995. Marginal likelihood from the Gibbs output. Journal of the American Statistical Association. 90:13131321.
Darwiche, A. 2009. Modeling and Reasoning with Bayesian Networks. Cambridge University Press.
Domingos, P., and Lowd, D. 2009. Markov Logic: An Interface Layer for Artificial Intelligence. San Rafael, CA: Morgan & Claypool.
Een, N., and Sorensson, N. 2003. An Extensible SAT-solver. In SAT Competition 2003, volume 2919 of Lecture Notes in Computer Science, 502518. Springer.
Fishelson, M., and Geiger, D. 2004. Optimizing Exact Genetic Linkage Computations. Journal of Computational Biology 11(2/3):263275.
Geman, S., and Geman, D. 1984. Stochastic Relaxation, Gibbs Distributions, and the Bayesian Restoration of Images. IEEE Transactions on Pattern Analysis and Machine Intelligence 6:721 741.
Getoor, L., and Taskar, B., eds. 2007. Introduction to Statistical Relational Learning. MIT Press.
Geweke, J. 1989. Bayesian inference in econometric models using Monte Carlo integration. Econometrica 57(6):131739.
Gilks, W. R.; Richardson, S.; and Spiegelhalter, D. J., eds. 1996.Markov Chain Monte Carlo in Practice. London, UK: Chapman and Hall.
Gogate, V., and Dechter, R. 2007. SampleSearch: A scheme that Searches for Consistent Samples. Proceedings of the 11th Conference on Artificial Intelligence and Statistics (AISTATS) 147154.
Gogate, V., and Dechter, R. 2011. SampleSearch: Importance sampling in presence of determinism. Artificial Intelligence 175(2):694729.
Gogate, V., and Domingos, P. 2010. Formula-Based Probabilistic Inference. In Proceedings of the Twenty-Sixth Conference on Uncertainty in Artificial Intelligence, 210219.
Gries, O. 2011. Gibbs sampling with deterministic dependencies. In Proceedings of the 5th international conference on MultiDisciplinary Trends in Artificial Intelligence, 418427.
Hajishirzi, H., and Amir, E. 2008. Sampling first order logical particles. In UAI, 248255.
Jensen, C. S.; Kjaerulff, U.; and Kong, A. 1993. Blocking Gibbs Sampling in Very Large Probabilistic Expert Systems. International Journal of Human Computer Studies. Special Issue on RealWorld Applications of Uncertain Reasoning 42:647666.
Jerrum, M.; Valiant, L.; and Vazirani, V. 1986. Random generation of combinatorial structures from a uniform. Theoretical Computer Science. 43:169188.
Kok, S.; Sumner, M.; Richardson, M.; Singla, P.; Poon, H.; and Domingos, P. 2006. The Alchemy System for Statistical Relational AI. Technical report, Department of Computer Science and Engineering, University of Washington, Seattle, WA.http://alchemy.cs.washington.edu.
Kokolakis, G., and Nanopoulos, P. 2001. Bayesian multivariate micro-aggregation under the Hellinger distance criterion. Research in official statistics. 4:117125.
Koller, D., and Friedman, N. 2009. Probabilistic Graphical Models: Principles and Techniques. MIT Press.
Liu, J. S. 2001. Monte Carlo Strategies in Scientific Computing.Springer Publishing Company, Incorporated.
McCallum, A., and Wellner, B. 2004. Conditional models of identity uncertainty with application to noun coreference. In Proceedings of the 18th Annual Conference on Neural Information Processing Systems (NIPS).
Murphy, K. P.; Weiss, Y.; and Jordan, M. I. 1999. Loopy Belief Propagation for Approximate Inference: An Empirical Study. In Proceedings of the Fifteenth Conference on Uncertainty in Artificial Intelligence, 467475.
Neal, R. M. 1993. Probabilistic Inference Using Markov chain Monte Carlo Methods. Technical Report CRG-TR-93-1, Department of Computer Science, University of Toronto, Toronto, Canada.
Neal, R. 2000. Slice Sampling. Annals of Statistics 31:705767.Neal, R. 2008. The harmonic mean of the likelihood: Worst monte carlo method ever. Available online at http://radfordneal.wordpress.com/2008/08/17/the-harmonicmean-of-the-likelihood-worst-monte-carlo-method-ever/.
Newton, M., and Raftery, A. 1994. Approximate Bayesian inference with the weighted likelihood bootstrap. Journal of the Royal Statistical Society. 56:348.
Pearl, J. 1988. Probabilistic Reasoning in Intelligent Systems: Networks of Plausible Inference. San Francisco, CA: Morgan Kaufmann.
Poon, H., and Domingos, P. 2006. Sound and Efficient Inference with Probabilistic and Deterministic Dependencies. In Proceedings of the Twenty-First National Conference on Artificial Intelligence.Boston, MA: AAAI Press. This volume.
Roth, D. 1996. On the Hardness of Approximate Reasoning. Artificial Intelligence 82:273302.
Sang, T.; Beame, P.; and Kautz, H. 2005. Solving Bayesian networks by weighted model counting. In Proceedings of the Twentieth National Conference on Artificial Intelligence, 475482.
Shwe, M.; Middleton, B.; Heckerman, D.; Henrion, M.; Horvitz, E.; Lehmann, H.; and Cooper, G. 1991. Probabilistic diagnosis using a reformulation of the internist-1/qmr knowledge base. i. the probabilistic model and inference algorithms. Methods of Information in Medicine 30(4):24155.
Wei, W.; Erenrich, J.; and Selman, B. 2004. Towards efficient sampling: exploiting random walk strategies. In Proceedings of the Nineteenth National Conference on Artificial Intelligence, 670 676. AAAI Press.
Wemmenhove, B.; Mooij, J.; Wiegerinck, W.; Leisink, M.; and Kappen, H. J. 2008. Inference in the promedas medical expert system. In Proceedings of the 11th Conference on Artificial Intelligence in Medicine (AIME 2007). Springer.
Yedidia, J. S.; Freeman, W. T.; and Weiss, Y. 2005. Constructing free-energy approximations and generalized Belief propagation algorithms. IEEE Transactions on Information Theory 51(7):2282 2312.
Yu, H., and van Engelen, R. 2011. Measuring the hardness of stochastic sampling on Bayesian networks with deterministic causalities: the k-test. In Proceedings of the Twenty-Seventh Conference on Uncertainty in Artificial Intelligence, 786795.
-----0
Bengio, Y., and LeCun, Y. 2007. Scaling learning algorithms towards AI. In Large Scale Kernel Machines. MIT Press.
Bidyuk, B., and Dechter, R. 2007. Cutset sampling for bayesian networks. J. Artif. Intell. Res. 28:148.
Boyd, S. P.; Diaconis, P.; Parrilo, P. A.; and Xiao, L. 2005.Symmetry analysis of reversible markov chains. Internet Mathematics 2(1):3171.
Brooks, S. P., and Gelman, A. 1998. General Methods for Monitoring Convergence of Iterative Simulations. Journal of Computational and Graphical Statistics 7(4):434455.
Buchholz, P. 1994. Exact and ordinary lumpability in finite markov chains. Journal of Applied Probability 31(1):5975.
Bui, H. H.; Huynh, T. N.; and Riedel, S. 2012. Automorphism groups of graphical models and lifted variational inference. CoRR abs/1207.4814.
Bui, H. H.; Venkatesh, S.; and West, G. 2002. Policy recognition in the abstract hidden markov model. J. Artif. Int. Res.17(1):451499.
Casella, G., and Robert, C. P. 1996. Rao-blackwellisation of sampling schemes. Biometrika 83(1):8194.
Choi, J., and Amir, E. 2012. Lifted relational variational inference. In Proceedings of the 28th Conference on Uncertainty in Artificial Intelligence, 196206.
Darga, P. T.; Sakallah, K. A.; and Markov, I. L. 2008. Faster symmetry discovery using sparsity of symmetries. In Proceedings of the 45th annual Design Automation Conference, 149154.
de Finetti, B. 1938. Sur la condition dequivalence partielle. In Colloque consacre a la theorie des probabilites, volume VI. Hermann, Paris. 518. English translation in R.Jeffrey (ed.), pp. 193205.
de Salvo Braz, R.; Amir, E.; and Roth, D. 2005. Lifted firstorder probabilistic inference. In Proceedings of the International Joint Conference on Artificial Intelligence, 1319 1325.
Derisavi, S.; Hermanns, H.; and Sanders, W. H. 2003. Optimal state-space lumping in markov chains. Inf. Process.Lett. 87(6):309315.
Diaconis, P., and Freedman, D. 1980. De finettis generalizations of exchangeability. In Studies in Inductive Logic and Probability, volume II.
Doucet, A.; Freitas, N. d.; Murphy, K. P.; and Russell, S. J. 2000. Rao-blackwellised particle filtering for dynamic bayesian networks. In Proceedings of the 16th Conference on Uncertainty in Artificial Intelligence, 176183.
The GAP Group. 2012. GAP  Groups, Algorithms, and Programming, Version 4.5.7.
Gelfand, A. E., and Smith, A. F. M. 1990. Sampling-based approaches to calculating marginal densities. Journal of the American Statistical Association 85(410):398409.
Goldberg, L. A. 2001. Computation in permutation groups: counting and randomly sampling orbits. In Surveys in Combinatorics. Cambridge University Press. 109143.
Hinton, G. E.; Osindero, S.; and Teh, Y. W. 2006. A fast learning algorithm for deep belief nets. Neural Computation 18(7):15271554.
Kersting, K.; Ahmadi, B.; and Natarajan, S. 2009. Counting belief propagation. In Proceedings of the 25th Conference on Uncertainty in Artificial Intelligence, 277284.
Kersting, K. 2012. Lifted probabilistic inference. In Proceedings of the 20th European Conference on Artificial Intelligence, 3338.
Lafferty, J. D.; McCallum, A.; and Pereira, F. C. N. 2001.Conditional random fields: Probabilistic models for segmenting and labeling sequence data. In Proceedings of the Eighteenth International Conference on Machine Learning, 282289.
Neal, R. M. 2004. Improving asymptotic variance of mcmc estimators: Non-reversible chains are better. Technical Report 0406, University of Toronto.
Niepert, M. 2012. Markov chains on orbits of permutation groups. In Proceedings of the 28th Confernence on Uncertainty in Artificial Intelligence, 624633.
Poole, D. 2003. First-order probabilistic inference. In Proceedings of the 18th Joint Conference on Artificial Intelligence, 985991.
Poon, H., and Domingos, P. 2006. Sound and efficient inference with probabilistic and deterministic dependencies. In Proceedings of the 21st AAAI Conference on Artificial intelligence, 458463.
Poon, H., and Domingos, P. 2011. Sum-product networks: A new deep architecture. In Proceedings of the 27th Conference on Uncertainty in Artificial Intelligence, 337346.
Richardson, M., and Domingos, P. 2006. Markov logic networks. Machine Learning 62(1-2).
Singla, P., and Domingos, P. 2008. Lifted first-order belief propagation. In Proceedings of the 23rd national conference on Artificial intelligence, 10941099.
Stachniss, C.; Grisetti, G.; and Burgard, W. 2005. Proceedings of the international conference on robotics and automation. In ICRA, 655660.
Teh, Y. W.; Newman, D.; and Welling, M. 2006. A collapsed variational bayesian inference algorithm for latent dirichlet allocation. In Proceedings of the 20th Annual Conference on Neural Information Processing Systems, 13531360.
Van den Broeck, G. 2011. On the completeness of first-order knowledge compilation for lifted probabilistic inference. In Neural Information Processing Systems, 13861394.
Venugopal, D., and Gogate, V. 2012. On lifting the gibbs sampling algorithm. In Advances in Neural Information Processing Systems 25. 16641672.
-----0
Bessiere, C., and Regin, J. 1997. Arc consistency for general constraint networks: preliminary results. In Proceedings of IJCAI97, 398404.
Bessiere, C.; Hebrard, E.; Hnich, B.; Kiziltan, Z.; and Walsh, T. 2008. SLIDE: A useful special case of the CARDPATH constraint. In Proceedings of ECAI08, 475479.
Bessiere, C.; Stergiou, K.; and Walsh, T. 2008. Domain filtering consistencies for non-binary constraints. Artificial Intelligence 172(6-7):800822.
Briggs, P., and Torczon, L. 1993. An efficient representation for sparse sets. ACM Letters on Programming Languages and Systems 2(1-4):5969.
Cheng, K., and Yap, R. 2010. An MDD-based generalized arc consistency algorithm for positive and negative table constraints and some global constraints. Constraints 15(2):265304.
Debruyne, R., and Bessiere, C. 2001. Domain filtering consistencies. Journal of Artificial Intelligence Research 14:205230.
Gent, I.; Jefferson, C.; Miguel, I.; and Nightingale, P. 2007.Data structures for generalised arc consistency for extensional constraints. In Proceedings of AAAI07, 191197.
Hoda, S.; van Hoeve, W.; and Hooker, J. 2010. A systematic approach to MDD-based constraint programming. In Proceedings of CP10, 266280.
Janssen, P.; Jegou, P.; Nouguier, B.; and Vilarem, M. 1989.A filtering process for general constraint-satisfaction problems: achieving pairwise-consistency using an associated binary representation. In Proceedings of IEEE Workshop on Tools for Artificial Intelligence, 420427.
Jegou, P. 1993. On the consistency of general constraint satisfaction problems. In Proceedings of AAAI93, 114119.
Karakashian, S.; Woodward, R.; Reeson, C.; Choueiry, B.; and Bessiere, C. 2010. A first practical algorithm for high levels of relational consistency. In Proceedings of AAAI10, 101107.
Lecoutre, C., and Szymanek, R. 2006. Generalized arc consistency for positive table constraints. In Proceedings of CP06, 284298.
Lecoutre, C.; Cardon, S.; and Vion, J. 2011. Second-order consistencies. Journal of Artificial Intelligence Research (JAIR) 40:175219.
Lecoutre, C.; Likitvivatanavong, C.; and Yap, R. 2012. A path-optimal GAC algorithm for table constraints. In Proceedings of ECAI12, 510515.
Lecoutre, C. 2011. STR2: optimized simple tabular reduction for table constraints. Constraints 16(4):341371.
Lhomme, O., and Regin, J. 2005. A fast arc consistency algorithm for n-ary constraints. In Proceedings of AAAI05, 405410.
Mairy, J.; Van Hentenryck, P.; and Deville, Y. 2012. An optimal filtering algorithm for table constraints. In Proceedings of CP12, 496511.
Mohr, R., and Henderson, T. 1986. Arc and path consistency revisited. Artificial Intelligence 28:225233.
Mohr, R., and Masini, G. 1988. Good old discrete relaxation. In Proceedings of ECAI88, 651656.
Montanari, U. 1974. Network of constraints : Fundamental properties and applications to picture processing. Information Science 7:95132.
Paparrizou, A., and Stergiou, K. 2012. An efficient higherorder consistency algorithm for table constraints. In Proceedings of AAAI12, 535541.
Samaras, N., and Stergiou, K. 2005. Binary encodings of non-binary CSPs: algorithms and experimental results. JAIR 24:641684.
Ullmann, J. 2007. Partition search for non-binary constraint satisfaction. Information Science 177(18):36393678.
-----0
Andrews, R., Diederich, J., and Tickle, A.B. Survey and Critique  of Techniques for Extracting Rules from Trained Artificial Neural  Networks. Knowledge Based Systems. 8(6) 373-389. (1995).  
Bengio, Y., Louradour, J., Collobert, R., and Weston, J. Curriculum Learning. In Proceedings of ICML 2009 (2009).  
Castro, R., Kalish, C., Nowak, R., Qian, R., Rogers, T., and Zhu,  X. Human Active Learning. In Proceedings of NIPS 2008 (2008). 
Freund, Y. and Schapire, R. E. A Short Introduction to Boosting.  Journal of the Japanese Society for Artificial Intelligence 14, 5  (1999), 771-780.  
Khan, F., Zhu, X., and Mutlu, B. How Do Humans Teach: On  Curriculum Learning and Teaching Dimension. In Proceedings of  NIPS 2011 (2011).  
Kreuger, K.A., and Dayan, P. Flexible Shaping: How Learning in  Small Steps Helps. Cognition 110, 3 (2009), 380-94.  
Kumar, M.P., Packer, B., and Koller, D. Self-Paced Learning for  Latent Variable Models. In Proceedings of NIPS 2010 (2010).   
Markman, E. M. Categorization and Naming in Children: Problems of Induction. MIT Press, (1989).  
Mozer, M.C., Pashler, H., Cepeda, N., Lindsey, R., and Vul, E..  Predicting the optimal spacing of study: A multiscale context  model of memory. In Proceedings of NIPS 2009 (2009).  
Nocedal, J. Updating Quasi-Newton Matrices with Limited Storage. Mathematics of Comp. 35 (1980), 773-782.   
Peterson, G.B. A Day of Great Illumination: B.F. Skinners Discovery of Shaping. Journal of Experimental Analysis of Behavior  82 (2004), 317-28.  
Settles, B. Active Learning Literature Survey. University of Wisconsin-Madison Computer Science Technical Report 1648,  (2010).  
Woolf, B.P. Building Intelligent Interactive Tutors. Morgan  Kaufmann. (2008).     
-----0
Ayari, A.; Basin, D. Bounded model construction for monadic second-order logics. 2000. In Computer Aided Verification, LNCS 1855. 99112. Springer.
Ben-Eliyahu, R., and Dechter, R. 1994. Propositional semantics for disjunctive logic programs. Annals of Mathematics and Artificial Intelligence 12(1):5387. Springer.
Bido?t, N., and Froidevaux, C. 1991. Negation by default and unstratifiable logic programs. Th. Comp. Sci. 78(1):85112. Elsevier.
Biere, A.; Heule, M.; van Maaren, H.; and Walsh, T., eds. 2009.Handbook of Satisfiability, vol. 185 of Frontiers in Artificial Intelligence and Applications 185. IOS Press.
Brass, S., and Dix, J. 1998. Characterizations of the disjunctive wellfounded semantics: Confluent calculi and iterated GCWA. Journal of Automated Reasoning 20:143165. Springer.
Brewka, G.; Eiter, T.; and Truszczynski, M. 2011. Answer set programming at a glance. Communications of the ACM 54(12):92 103. ACM.
Calimeri, F.; et.al. 2011. The third answer set programming competition: Preliminary report of the system competition track. LPNMR11 388403. Springer 
Chen, J.; Kanj, I.; and Xia, G. 2006. Improved parameterized upper bounds for vertex cover. MFCS06. 238249. Springer.
Chen, H.; Interian, Y. 2005 A model for generating random quantified boolean formulas. IJCAI05. 6671. Morgan Kaufmann.
Clark, K. L. 1978. Negation as failure. Logic and data bases 1:293322. Plenum Publishing Corporation.
Dowling, W. F., and Gallier, J. H. 1984. Linear-time algorithms for testing the satisfiability of propositional horn formulae. Journal on Logic Programming 1(3):267284. Elsevier.
Downey, R. G., and Fellows, M. R. 1999. Parameterized Complexity.Monographs in Computer Science. Springer.
Drescher, C.; Gebser, M.; Grote, T.; Kaufmann, B.; Konig, A.; Ostrowski, M.; and Schaub, T. 2008. Conflict-driven disjunctive answer set solving. KR08. 422432. AAAI Press.
Eiter, T., and Gottlob, G. 1995. On the computational cost of disjunctive logic programming: Propositional case. Annals of Mathematics and Artificial Intelligence 15(34):289323. Springer.
Fages, F. 1994. Consistency of Clarks completion and existence of stable models. Journal of Methods of Logic in Computer Science 1(1):5160.
Fichte, J. K., and Szeider, S. 2012. Backdoors to tractable answerset programming. Updated IJCAI11 paper. arXiv:1104.2788.
Fichte, J. K. 2012. The good, the bad, and the odd: Cycles in answer-set programs. In New Directions in Logic, Language and Computation, LNCS 7415. 7890. Springer.
Flum, J., and Grohe, M. 2006. Parameterized Complexity Theory, vol. XIV of Th. Comp. Sci. Springer.
Gaspers, S., and Szeider, S. 2012. Backdoors to satisfaction. In The Multivariate Algorithmic Revolution and Beyond, LNCS 7370.287317. Springer.
Gebser, M., and Kaminski, R. 2012. Personal Communication.Gebser, M.; Kaufmann, B.; Neumann, A.; and Schaub, T. 2007.Conflict-driven answer set solving. IJCAI07. 386392. Morgan Kaufmann.
Gebser, M.; Liu, L.; Namasivayam, G.; Neumann, A.; Schaub, T.; Truszczynski, M. 2007, The first answer set programming system competition. LPNMR07. 317. Springer.
Gebser, M.; Schaub, T.; Thiele, S.; Usadel, B.; and Veber, P. 2008.Detecting inconsistencies in large biological networks with answer set programming. In Logic Programming, LNCS 5366. 130144.Springer.
Gelfond, M., and Lifschitz, V. 1988. The stable model semantics for logic programming. ICLP/SLP88. 10701080. MIT Press.
Gelfond, M., and Lifschitz, V. 1991. Classical negation in logic programs and disjunctive databases. New Generation Computing 9(3/4):365386. Springer.
Giunchiglia, E.; Lierler, Y.; and Maratea, M. 2006. Answer set programming based on propositional satisfiability. Journal of Automated Reasoning 36(4):345377. Springer.
Maratea, M.; Ricca, F.; Faber, W.; Leone, N. 2007 Look-back techniques and heuristics in DLV: Implementation, evaluation, and comparison to QBF solvers. Journal of Algorithms. 63(1-3):7089.Elsevier.
Gomes, C. P.; Kautz, H.; Sabharwal, A.; and Selman, B. 2008.Chapter 2 satisfiability solvers. In Handbook of Knowledge Representation, vol. 3 of Foundations of Artificial Intelligence. 89134.Elsevier.
Janhunen, T.; Niemela, I.; Seipel, D.; Simons, P.; and You, J. 2006.Unfolding partiality and disjunctions in stable model semantics.ACM Trans. Comput. Logic 7(1):137. ACM.
Janhunen, T.; Oikarinen, E.; Tompits, H.; and Woltran, S. 2007.Modularity aspects of disjunctive stable models. LPNMR07. 175 187. Springer.
Janhunen, T.; Niemela, I.; and Sevalnev, M. 2009. Computing stable models via reductions to difference logic. LPNMR09. 142154.Springer.
Janhunen, T. 2004. Representing normal programs with clauses.ECAI04. 358362. IOS Press.
Janhunen, T. 2006. Some (in)translatability results for normal logic programs and propositional theories. Journal of Applied NonClassical Logics 16(1-2):3586. Taylor & Francis.
Janota, M., and Marques-Silva, J. 2011. A tool for circumscriptionbased mus membership testing. LPNMR11. 266271. Springer 
Kleine Buning, H., and Lettman, T. 1999. Propositional logic: deduction and algorithms. Cambridge University Press.
Lee, J., and Lifschitz, V. 2003. Loop formulas for disjunctive logic programs. In Logic Programming, LNCS 2916 451465. Springer.
Lee, J. 2005. A model-theoretic counterpart of loop formulas.IJCAI05. 503508. Professional Book Center.
Lifschitz, V., and Razborov, A. 2006. Why are there so many loop formulas? ACM Trans. on Comput. Logic 7(2):261268. ACM.
Lin, F., and Zhao, Y. 2004. ASSAT: Computing answer sets of a logic program by SAT solvers. Artificial Intelligence Journal 157(1-2):115137. Elsevier.
Marek, W., and Truszczynski, M. 1991a. Computing intersection of autoepistemic expansions. LPNMR91. 3750. MIT Press.
Marek, W., and Truszczynski, M. 1991b. Autoepistemic logic.Journal of the ACM 38(3):588619. ACM.
Marek, V. W., and Truszczynski, M. 1999. Stable models and an alternative logic programming paradigm. In The Logic Programming Paradigm: a 25-Year Perspective. 375398. Springer.
Niemela, I. 1999. Logic programs with stable model semantics as a constraint programming paradigm. Annals of Mathematics and Artificial Intelligence 25(3):241273. Springer.
Nishimura, N.; Ragde, P.; and Szeider, S. 2004. Detecting backdoor sets with respect to Horn and binary clauses. SAT04. 96103.Springer.
Pfandler, A.; Rummele, S.; Szeider, S. 2013. Backdoors to Abduction. IJCAI13. To appear.
To, S.; Pontelli, E.; and Son, T. 2009. A conformant planner with explicit disjunctive representation of belief states. ICAPS09.305312. AAAI Press.
Tseitin, G. S. 1968. Complexity of a derivation in the propositional calculus. Zap. Nauchn. Sem. Leningrad Otd. Mat. Inst. Akad. Nauk SSSR 8:2341. Russian.
Van Emden, M. H., and Kowalski, R. A. 1976. The semantics of predicate logic as a programming language. Journal of the ACM 23:733742. ACM.
Williams, R.; Gomes, C.; and Selman, B. 2003. Backdoors to typical case complexity. IJCAI03. 11731178. Morgan Kaufmann.
-----0
Bansal, N.; Blum, A.; and Chawla, S. 2004. Correlation clustering. Machine Learning 56:89113.
Blei, D. M.; Griffiths, T. L.; and Jordan, M. I. 2010. The nested chinese restaurant process and bayesian nonparametric inference of topic hierarchies. J. ACM 57(2).
Blei, D. M.; Ng, A. Y.; and Jordan, M. I. 2003. Latent dirichlet allocation. Journal of Machine Learning Research 3:9931022.
Collins, A. M., and Quillian, M. R. 1969. Retrieval time from semantic memory. Journal of Verbal Learning and Verbal Behavior 8(2):240  247.
Deerwester, S. C.; Dumais, S. T.; Landauer, T. K.; Furnas, G. W.; and Harshman, R. A. 1990. Indexing by latent semantic analysis. JASIS 41(6):391407.
Dhillon, I. S. 2001. Co-clustering documents and words using bipartite spectral graph partitioning. In KDD, 269 274.
Fernandez, A., and Gomez, S. 2008. Solving nonuniqueness in agglomerative hierarchical clustering using multidendrograms. J. Classification 25(1):4365.
Griffiths, T., and Ghahramani, Z. 2005. Infinite latent feature models and the indian buffet process. In NIPS.
Ho, Q.; Eisenstein, J.; and Xing, E. P. 2012. Document hierarchies from text and links. In WWW, 739748.
Hofmann, T., and Buhmann, J. M. 1996. Inferring hierarchical clustering structures by deterministic annealing. In KDD, 363366.
Li, W., and McCallum, A. 2006. Pachinko allocation: Dagstructured mixture models of topic correlations. In ICML, 577584.
MacQueen, J. B. 1967. Some methods for classification and analysis of multivariate observations. In Berkeley Symposium on Mathematical Statistics and Probability, 281297.
Meeds, E.; Ghahramani, Z.; Neal, R. M.; and Roweis, S. T.2006. Modeling dyadic data with binary latent factors. In NIPS, 977984.
Paatero, P., and Tapper, U. 1994. Positive matrix factorization: A non-negative factor model with optimal utilization of error estimates of data values. Environmetrics 5(2).
Roy, D. M.; Kemp, C.; Mansinghka, V. K.; and Tenenbaum, J. B. 2006. Learning annotated hierarchies from relational data. In NIPS, 11851192.
Shan, H., and Banerjee, A. 2008. Bayesian co-clustering. In ICDM, 530539.
Willett, P. 1988. Recent trends in hierarchic document clustering: A critical review. Information Processing and Management 24(5):577597.
-----0
Altschul, S. F. 1989. Gap costs for multiple sequence alignment. Journal of Theoretical Biology 138(3):297309.
Bjornsson, Y.; Enzenberger, M.; Holte, R. C.; and Schaeffer, J. 2005. Fringe search: beating A* at pathfinding on game maps. In In Proceedings of IEEE Symposium on Computational Intelligence and Games, 125132.
Burns, E.; Hatem, M.; Leighton, M. J.; and Ruml, W. 2012.Implementing fast heuristic search code. In Proceedings of the Symposium on Combinatorial Search (SoCS-12).
Carrillo, H., and Lipman, D. 1988. The multiple sequence alignment problem in biology. SIAM J. on Applied Mathematics 48(5):10731082.
Dayhoff, M. O.; Schwartz, R. M.; and Orcutt, B. C. 1978.A model of evolutionary change in proteins. Atlas of protein sequence and structure 5(suppl 3):345351.
Edelkamp, S., and Kissmann, P. 2007. Externalizing the multiple sequence alignment problem with affine gap costs.
In KI 2007: Advances in Artificial Intelligence. Springer Berlin / Heidelberg. 444447.
Felner, A.; Goldenberg, M.; Sharon, G.; Stern, R.; Beja, T.; Sturtevant, N. R.; Schaeffer, J.; and Holte, R. 2012. PartialExpansion A* with selective node generation. In Proceedings of AAAI-2012.
Hart, P. E.; Nilsson, N. J.; and Raphael, B. 1968. A formal basis for the heuristic determination of minimum cost paths. IEEE Transactions of Systems Science and Cybernetics SSC-4(2):100107.
Hatem, M.; Burns, E.; and Ruml, W. 2011. Heuristic search for large problems with real costs. In Proceedings of AAAI2011.
Hatem, M.; Burns, E.; and Ruml, W. in press. Implementing fast heuristic search code in Java. IBM developerWorks.
Ikeda, T., and Imai, H. 1999. Enhanced A* algorithms for multiple alignments: optimal alignments for several sequences and k-opt approximate alignments for large cases.Theoretical Computer Science 210(2):341374.
Kobayashi, H., and Imai, H. 1998. Improvement of the A* algorithm for multiple sequence alignment. 120130.
Korf, R. E.; Zhang, W.; Thayer, I.; and Hohwald, H. 2005.Frontier search. Journal of the ACM 52(5):715748.
Korf, R. E. 1985. Iterative-deepening-A*: An optimal admissible tree search. In Proceedings of the International Joint Conference on Artificial Intelligence (IJCAI-85), 10341036.
Korf, R. E. 2003. Delayed duplicate detection: extended abstract. In Proceedings of the Eighteenth International Joint Conference on Articial Intelligence (IJCAI-03), 15391541.
Korf, R. E. 2008. Linear-time disk-based implicit graph search. Journal of the ACM 55(6).
Korf, R. 2012. Research challenges in combinatorial search.In Proceedings of AAAI-2012.
Lermen, M., and Reinert, K. 2000. The practical use of the A* algorithm for exact multiple sequence alignment. Journal of Computational Biology 7(5):655671.
Needleman, S. B., and Wunsch, C. D. 1970. A general method applicable to the search for similarities in the amino acid sequences of two proteins. Journal of Molecular Biology 48:443453.
Niewiadomski, R.; Amaral, J. N.; and Holte, R. C. 2006.Sequential and parallel algorithms for Frontier A* with delayed duplicate detection. In Proceedings of AAAI-2006, 10391044. AAAI Press.
Sarkar, U.; Chakrabarti, P.; Ghose, S.; and Sarkar, S. D.1991. Reducing reexpansions in iterative-deepening search by controlling cutoff bounds. Artificial Intelligence 50:207 221.
Schroedl, S. 2005. An improved search algorithm for optimal multiple-sequence alignment. Journal of Artificial Intelligence Research 23:587623.
Thompson; Plewniak; and Poch. 1999. BAliBASE: a benchmark alignment database for the evaluation of multiple alignment programs. Bioinformatics.
Yoshizumi, T.; Miura, T.; and Ishida, T. 2000. A* with partial expansion for large branching factor problems. In Proceedings of AAAI-2000, 923929.
Zhou, R., and Hansen, E. A. 2003. Sweep A*: Spaceefficient heuristic search in partially ordered graphs. In Proceedings of the 15th IEEE International Conference on Tools with Artificial Intelligence (ICTAI-03).
Zhou, R., and Hansen, E. A. 2004. Structured duplicate detection in external-memory graph search. In Proceedings of AAAI-2004.
-----0
Bollen, J.; Rodriquez, M.; and de Sompel, H. V. 2006. Journal status. Scientometrics 69(3):669687.
Chen, P.; Xie, H.; Maslov, S.; and Redner, S. 2007. Finding scientific gems with google. Journal of Informetrics 1 815.
Das, S.; Mitra, P.; and Giles, C. L. 2011. Ranking authors in digital libraries. In Proceedings of the 11th annual international ACM/IEEE Joint Conference on Digital Libraries (JCDL11), 251254.Garfield, E. 1972. Citation analysis as a tool in journal evaluation. Science 178:471479.
Garfield, E. 1983. How to use citatiuon analysis for faculty evaluations and when is it relevant? (part 1). Current Contents 513.
Hwang, W.-S.; chae, S.-M.; and Kim, S.-W. 2010. Yet another paper ranking algorithm advocating recent publications. In Proceedings of the 19th international conference on World Wide Web (WWW10), 11171118.
Kleinberg, J. M. 1999. Authoritative sources in a hyperlinked environment. Journal of the ACM 46(5):604632.
Liu, X.; Bollen, J.; Nelson, M. L.; and de Sompel, H. V.2005. Co-authorship networks in the digital library research community. Information Processing and Management 41(6):14621480.
Ma, N.; Guan, J.; and Zhao, Y. 2008. Bringing pagerank to the citation analysis. Information Processing and Management 44(2):800810.
Maslov, S., and Redner, S. 2008. Promise and pitfalls of extending googles pagerank algorithm to citation networks.The Journal of Neuroscience 28(44):1110311105.
Myers, J. L., and Well, A. D. 2003. Research Design and Statistical Analysis. Lawrence Erlbaum. pp.508.
Page, L.; Brin, S.; Motwani, R.; and Winograd, T. 1998.The pagerank citation ranking: Bringing order to the web.
Technical Report, Stanford University Database Group.Pinski, G., and Narin, F. 1976. Citation influence for journal aggregates of scientific publications: Theory, with application to the literature of physics. Information Processing and Management 297312.
Sayyadi, H., and Getoor, L. 2009. Futurerank: Ranking scientific articles by predicting their future pagerank. In Proceedings of the Ninth SIAM International Conference on Data Mining (SDM09), 533544.
Walker, D.; Xie, H.; Yan, K.-K.; and Maslov, S. 2007. Ranking scientific publications using a simple model of network traffic. Journal of Statistical Mechanics.
Yan, E.; Ding, Y.; and Sugimoto, C. R. 2011. An indicator measuring prestige in heterogeneous scholarly networks.Journal of the American Society for Information Science and Technology 62(3):467477.
Zhou, D., and Orshanskiy, S. A. 2007. Co-ranking authors and documents in a heterogeneous network. In Proceedings of the Seventh IEEE International Conference on Data Mining (ICDM07).
Zhou, Y.-B.; Lu, L.; and Li, M. 2012. Quantifying the influence of scientists and their publications: distinguishing between prestige and popularity. New Journal of Physics.
-----0
Arandjelovic, O.; Hammoud, R. I.; and Cipolla, R. 2006. Multisensory face biometric fusion (for personal identification). In Proc. IEEE International Workshop on Object Tracking and Classification Beyond the Visible Spectrum 128135.
Arandjelovic, O.; Hammoud, R. I.; and Cipolla, R. 2010. Thermal and reflectance based personal identification methodology in challenging variable illuminations. Pattern Recognition 43(5):1801 1813.
Buddharaju, P.; Pavlidis, I. T.; Tsiamyrtzis, P.; and Bazakos, M.2007. Physiology-based face recognition in the thermal infrared spectrum. IEEE Transactions on Pattern Analysis and Machine Intelligence 29(4):613626.
Buddharaju, P.; Pavlidis, I. T.; and Tsiamyrtzis, P. 2005.Physiology-based face recognition. In Proc. IEEE Conference on Advanced Video and Singal Based Surveillance 354359.
Buddharaju, P.; Pavlidis, I.; and Tsiamyrtzis, P. 2006. Poseinvariant physiological face recognition in the thermal infrared spectrum. In Proc. IEEE Conference on Computer Vision and Pattern Recognition Workshops 5360.
Chang, H.; Koschan, A.; Abidi, M.; Kong, S. G.; and Won, C. 2008.Multispectral visible and infrared imaging for face recognition. In Proc. IEEE Conference on Computer Vision and Pattern Recognition Workshops 16.
Chen, L.; Ju, Y.; Ding, S.; and Liu, X. 2011. Topological vascular tree segmentation for retinal images using shortest path connection. In Proc. IEEE International Conference on Image Processing 21372140.
Chen, X.; Flynn, P.; and Bowyer, K. 2003. Visible-light and infrared face recognition. In Proc. Workshop on Multimodal User Authentication 4855.
Chen, X.; Flynn, P.; and Bowyer, K. 2005. IR and visible light face recognition. Computer Vision and Image Understanding 99(3):332358.
Cootes, T. F.; Edwards, G. J.; and Taylor, C. J. 1998. Active appearance models. In Proc. European Conference on Computer Vision 2:484498.
Cootes, T. F.; Edwards, G. J.; and Taylor, C. J. 2001. Active appearance models. IEEE Transactions on Pattern Analysis and Machine Intelligence 23(6):681685.
Cutler, R. 1996. Face recognition using infrared images and eigenfaces. Technical Report, University of Maryland.
Elguebaly, T., and Bouguila, N. 2011. A Bayesian method for infrared face recognition. Machine Vision Beyond Visible Spectrum 1:123138.
Feng, X.; Shen, X.; Zhou, M.; Zhang, H.; and Kim, J. 2011. Robust facial expression tracking based on composite constraints AAM. In Proc. IEEE International Conference on Image Processing 3045 3048.
Frangi, A. F.; Niessen, W. J.; Vincken, K. L.; and Viergever, M. A.1998. Multiscale vessel enhancement filtering. Medical Image Computing and Computer-Assisted Intervention 130137.
Friedrich, G., and Yeshurun, Y. 2003. Seeing people in the dark: Face recognition in infrared images. In Proc. British Machine Vision Conference 348359.
Ghiass, R. S.; Arandjelovic, O.; Bendada, A.; and Maldague, X.2013a. Illumination-invariant face recognition from a single image across extreme pose using a dual dimension AAM ensemble in the thermal infrared spectrum. International Joint Conference on Neural Networks.
Ghiass, R. S.; Arandjelovic, O.; Bendada, A.; and Maldague, X.2013b. Infrared face recognition: a literature review. International Joint Conference on Neural Networks.
Goswami, D.; Chan, C. H.; Windridge, D.; and Kittler, J. 2011.Evaluation of face recognition system in heterogeneous environments (visible vs NIR). In Proc. IEEE Conference on Computer Vision and Pattern Recognition Workshops 21602167.
Heo, J.; Kong, S. G.; Abidi, B. R.; and Abidi, M. A. 2004. Fusion of visual and thermal signatures with eyeglass removal for robust face recognition. In Proc. IEEE Conference on Computer Vision and Pattern Recognition Workshops 122.
Li, S.; Chu, R.; Liao, S.; and Zhang, L. 2007a. Illumination invariant face recognition using near-infrared images. IEEE Transactions on Pattern Analysis and Machine Intelligence 29(4):627639.
Li, S. Z.; Chu, R.; Liao, S.; and Zhang, L. 2007b. Illumination invariant face recognition using near-infrared images. IEEE Transactions on Pattern Analysis and Machine Intelligence 29(4):627 639.
Lin, Z.; Wenrui, Z.; Li, S.; and Zhijun, F. 2011. Infrared face recognition based on compressive sensing and PCA. In Proc. International Conference on Computer Science and Automation Engineering 2:5154.
Lucas, B., and Kanade, T. 1981. An iterative image registration technique with an application to stereo vision. In Proc. International Joint Conference on Artificial Intelligence I:674679.
Maeng, H.; Choi, H.-C.; Park, U.; Lee, S.-W.; and Jain, A. K. 2011.NFRAD: Near-infrared face recognition at a distance. In Proc.
International Joint Conference on Biometrics 17.Maldague, X. 2001. Theory and Practice of Infrared Technology for Non Destructive Testing. John-Wiley & Sons.
Matthews, I., and Baker, S. 2004. Active appearance models revisited. International Journal of Computer Vision 60(2):135164.
Nicolo, F., and Schmid, N. A. 2011. A method for robust multispectral face recognition. In Proc. IEEE International Conference on Image Analysis and Recognition 2:180190.
Pan, Z.; Healey, G.; Prasad, M.; and Tromberg, B. 2005. Multiband and spectral eigenfaces for face recognition in hyperspectral images. In Proc. SPIE 5779:144151.
Pavlidis, I., and Buddharaju, P. 2009. The imaging issue in an automatic face/disguise detection system. In Proc. IEEE Conference on Computer Vision and Pattern Recognition 128135.
Pavlidis, I., and Symosek, P. 2000. The imaging issue in an automatic face/disguise detection system. In Proc. IEEE Workshop on Computer Vision Beyond the Visible Spectrum 1524.
Persson, A. B., and Buschmann, I. R. 2011. Vascular growth in health and disease. Frontiers of Molecular Neuroscience 4(14).
Prokoski, F. J.; Riedel, R. B.; and Coffin, J. S. 1992. Identification of individuals by means of facial thermography. In Proc. IEEE International Carnahan Conference on Security Technology (ICCST): Crime Countermeasures 120125.
Sauer, P.; Cootes, T.; and Taylor, C. 2011. Accurate regression procedures for active appearance models. In Proc. British Machine Vision Conference.
Sclaroff, S., and Isidoro, J. 1998. Active blobs. In Proc. IEEE International Conference on Computer Vision 11461153.
Selinger, A., and Socolinsky, D. 2004. Face recognition in the dark. In Proc. IEEE Conference on Computer Vision and Pattern Recognition Workshops 8:129.
Socolinsky, D. A.; Wolff, L. B.; Neuheisel, J. D.; and Eveland, C. K. 2001. Illumination invariant face recognition using thermal infrared imagery. In Proc. IEEE Conference on Computer Vision and Pattern Recognition 1:527.
Srivastana, A., and Liu, X. 2003. Statistical hypothesis pruning for recognizing faces from infrared images. Image and Vision Computing 21(7):651661.
Tasman, W., and Jaeger, E. A. 2009. Duanes Ophthalmology.Lippincott Williams & Wilkins.
Wu, S.; Song, W.; Jiang, L.; Xie, S.; Pan, F.; Yau, W.; and Ranganath, S. 2005. Infrared face recognition by using blood perfusion data. In Proc. International Conference on Audioand Video-Based Biometric Person Authentication 320328.
Wu, S. Q.; Wei, L. Z.; Fang, Z. J.; Li, R. W.; and Ye, X. Q. 2007.Infrared face recognition based on blood perfusion and sub-block DCT in wavelet domain. In Proc. International Conference on Wavelet Analysis and Pattern Recognition 3:12521256.
Xie, Z.; Wu, S.; Liu, G.; and Fang, Z. 2009. Infrared face recognition based on radiant energy and curvelet transformation. In Proc.
International Conference on Information Assurance and Security 2:215218.
-----0
Arzi, O.; Aumann, Y.; and Dombb, Y. 2011. Throw ones cake  and eat it too. In Proceedings of the 4th International Symposium on Algorithmic Game Theory (SAGT), 6980.
Bei, X.; Chen, N.; Hua, X.; Tao, B.; and Yang, E. 2012.Optimal proportional cake cutting with connected pieces. In Proceedings of the 26th AAAI Conference on Artificial Intelligence (AAAI), 12631269.
Brams, S. J., and Taylor, A. D. 1995. An envy-free cake division protocol. The American Mathematical Monthly 102(1):918.
Brams, S. J.; Feldman, M.; Morgenstern, J.; Lai, J. K.; and Procaccia, A. D. 2012. On maxsum fair cake divisions.
In Proceedings of the 26th AAAI Conference on Artificial Intelligence (AAAI), 12851291.
Busch, C.; Krishnamoorthy, M. S.; and Magdon-Ismail, M.2005. Hardness results for cake cutting. Bulletin of the EATCS 86:85106.
Caragiannis, I.; Lai, J. K.; and Procaccia, A. D. 2011.Towards more expressive cake cutting. In Proceedings of the 22nd International Joint Conference on Artificial Intelligence (IJCAI), 127132.
Chen, Y.; Lai, J. K.; Parkes, D. C.; and Procaccia, A. D.2013. Truth, justice, and cake cutting. Games and Economic Behavior 77:284297. Preliminary version in AAAI10.
Chevaleyre, Y.; Dunne, P. E.; Endriss, U.; Lang, J.; Lema?tre, M.; Maudet, N.; Padget, J.; Phelps, S.; Rodr?guezAguilar, J. A.; and Sousa, P. 2006. Issues in multiagent resource allocation. Informatica 30:331.
Cohler, Y. J.; Lai, J. K.; Parkes, D. C.; and Procaccia, A. D.2011. Optimal envy-free cake cutting. In Proceedings of the 25th AAAI Conference on Artificial Intelligence (AAAI), 626631.
Deng, X.; Qi, Q.; and Saberi, A. 2009. On the complexity of envy-free cake cutting. CoRR abs/0907.1334.
Edmonds, J., and Pruhs, K. 2006. Cake cutting really is not a piece of cake. In Proceedings of the 17th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), 271278.
Gutman, A., and Nisan, N. 2012. Fair allocation without trade. In Proceedings of the 11th International Joint Conference on Autonomous Agents and Multi-Agent Systems (AAMAS), 719728.
Lipton, R. J.; Markakis, E.; Mossel, E.; and Saberi, A. 2004.On approximately fair allocations of indivisible goods. In Proceedings of the 6th ACM Conference on Electronic Commerce (EC), 125131.
Procaccia, A. D. 2009. Thou shalt covet thy neighbors cake.In Proceedings of the 21st International Joint Conference on Artificial Intelligence (IJCAI), 239244.
Procaccia, A. D. 2013. Cake cutting: Not just childs play.Communications of the ACM. Forthcoming.
Robertson, J. M., and Webb, W. A. 1998. Cake Cutting Algorithms: Be Fair If You Can. A. K. Peters.
Saberi, A., and Wang, Y. 2009. Cutting a cake for five people. In Proceedings of the 5th International Conference on Algorithmic Aspects in Information and Management (AAIM), 292300.
Steinhaus, H. 1948. The problem of fair division. Econometrica 16:101104.
Stromquist, W. 2008. Envy-free cake divisions cannot be found by finite protocols. The Electronic Journal of Combinatorics 15:#R11.
Su, F. E. 1999. Rental harmony: Sperners lemma in fair division. American Mathematical Monthly 106(10):930942.
Woeginger, G. J., and Sgall, J. 2007. On the complexity of cake cutting. Discrete Optimization 4:213220.
-----0
Akbani, R.; Kwek, S.; and Japkowicz, N. 2004. Applying support vector machines to imbalanced datasets. In In Proceedings of the 15th European Conference on Machine Learning (ECML), 3950.
Caragea, C.; Silvescu, A.; and Mitra, P. 2012. Combining hashing and abstraction in sparse high dimensional feature spaces. In Proceedings of the Twenty-Sixth AAAI Conference on Artificial Intelligence, 39.
Chang, C.-C., and Lin, C.-J. 2011. Libsvm: A library for support vector machines. ACM Trans. Intell. Syst. Technol.2(3):27:127:27.
Cortes, C., and Vapnik, V. 1995. Support-vector networks.Mach. Learn. 20(3):273297.
Drummond, C., and Holte, R. C. 2003. C4.5, class imbalance, and cost sensitivity: Why under-sampling beats oversampling. 18.
Elkan, C. 2001. The foundations of cost-sensitive learning. In In Proceedings of the Seventeenth International Joint Conference on Artificial Intelligence, 973978.
Estabrooks, A.; Jo, T.; and Japkowicz, N. 2004. A multiple resampling method for learning from imbalanced data sets.Computational Intelligence 1836.
Gabrilovich, E., and Markovitch, S. 2005. Feature generation for text categorization using world knowledge. In Proceedings of the 19th international joint conference on Artificial intelligence, IJCAI05, 10481053. San Francisco, CA, USA: Morgan Kaufmann Publishers Inc.
Gabrilovich, E., and Markovitch, S. 2006. Overcoming the brittleness bottleneck using wikipedia: enhancing text categorization with encyclopedic knowledge. In proceedings of the 21st national conference on Artificial intelligence Volume 2, AAAI06, 13011306. AAAI Press.
Goldberg, A. B.; Fillmore, N.; Andrzejewski, D.; Xu, Z.; Gibson, B. R.; and Zhu, X. 2009. May all your wishes come true: A study of wishes and how to recognize them. In HLTNAACL, 263271.
Hu, X.; Sun, N.; Zhang, C.; and Chua, T.-S. 2009. Exploiting internal and external semantics for the clustering of short texts using world knowledge. In Proceedings of the 18th ACM conference on Information and knowledge management, CIKM 09, 919928. New York, NY, USA: ACM.
Jin, O.; Liu, N. N.; Zhao, K.; Yu, Y.; and Yang, Q. 2011.Transferring topical knowledge from auxiliary long texts for short text clustering. In Proceedings of the 20th ACM international conference on Information and knowledge management, CIKM 11, 775784. New York, NY, USA: ACM.
Kanayama, H., and Nasukawa, T. 2008. Textual demand analysis: detection of users wants and needs from opinions.
In Proceedings of the 22nd International Conference on Computational Linguistics Volume 1, COLING 08, 409 416. Stroudsburg, PA, USA: Association for Computational Linguistics.
Lacoste-Julien, S.; Sha, F.; and Jordan, M. I. 2008. Disclda: Discriminative learning for dimensionality reduction and classification. In NIPS.
Ling, C. X.; Yang, Q.; Wang, J.; and Zhang, S. 2004. Decision trees with minimal costs. In Proceedings of the twentyfirst international conference on Machine learning, ICML 04, 69. New York, NY, USA: ACM.
Nigam, K.; McCallum, A. K.; Thrun, S.; and Mitchell, T.2000. Text classification from labeled and unlabeled documents using em. Mach. Learn. 39(2-3):103134.
OConnor, B.; Krieger, M.; and Ahn, D. 2010. Tweetmotif: Exploratory search and topic summarization for twitter. In ICWSM10.
Pang, B., and Lee, L. 2008. Opinion Mining and Sentiment Analysis. Now Publishers Inc.
Pei, J.; Han, J.; Mortazavi-Asl, B.; Wang, J.; Pinto, H.; Chen, Q.; Dayal, U.; and Hsu, M.-C. 2004. Mining sequential patterns by pattern-growth: The prefixspan approach. IEEE Trans. on Knowl. and Data Eng. 16(11):14241440.
Phan, X.-H.; Nguyen, L.-M.; and Horiguchi, S. 2008. Learning to classify short and sparse text & web with hidden topics from large-scale data collections. In Proceedings of the 17th international conference on World Wide Web, WWW 08, 91100. New York, NY, USA: ACM.
Rendle, S. 2012. Factorization machines with libFM. ACM Trans. Intell. Syst. Technol. 3(3):57:157:22.
Saif, H.; He, Y.; and Alani, H. 2012. Alleviating data sparsity for twitter sentiment analysis. In NSM, 29.
Salakhutdinov, R., and Mnih, A. 2008. Bayesian probabilistic matrix factorization using markov chain monte carlo.In Proceedings of the 25th international conference on Machine learning, ICML 08, 880887. New York, NY, USA: ACM.
Sheng, V. S., and Ling, C. X. 2006. Thresholding for making classifiers cost-sensitive. In Proceedings of the 21st national conference on Artificial intelligence Volume 1, AAAI06, 476481. AAAI Press.
Zhou, Z.-H., and Liu, X.-Y. 2010. On multi-class costsensitive learning. Computational Intelligence 26(3):232 257.
-----0
Alperstein, H. 1988. Optimal pricing for the service facility offering a set of priority prices. Management Science 34:666671.
Ashlagi, I.; Braverman, M.; Hassidim, A.; Lavi, R.; and M.Tennenholtz. 2010. Position auctions with budgets: Existence and uniqueness. B.E. Journal of Theoretical Economics Advances 10(1)).
Ashlagi, I.; Monderer, D.; and Tennenholtz, M. 2006. Resource selection games with unknown number of players.
In Proceedings of the 5th International Joint Conference on Autonomous Agents and Multiagent Systems, 819825.
Ashlagi, I.; Monderer, D.; and Tennenholtz, M. 2009. Twoterminal routing games with unknown active players. Artificial Intelligence Journal 173(15):14411455.
Ashlagi, I.; Tennenholtz, M.; and Zohar, A. 2010. Competing schedulers. In Proceedings of the 25th National Conference on Artificial Intelligence (AAAI).
Burguet, R., and Sakovics, J. 1999. Imperfect Competition in Auction Designs. International Economic Review 40(1):231247.
Engelberg, R., and Naor, J. 2007. Equilibria in Online Games. In Proceedings of the 18th annual ACM-SIAM Symposium on Discrete Algorithms (SODA), 149158.
Feldman, J.; Muthukrishnan, S.; Nikolova, E.; and Pal, M.2008. A truthful mechanism for offline ad slot scheduling.
In Proceedings of the 1st International Symposium on Algorithmic Game Theory, SAGT 08, 182193. Berlin, Heidelberg: Springer-Verlag.
Hassin, R. 1985. On the optimality of first-come last-served queues. Econometrica 53:201202.
Hassin, R. 1986. Consumer information in markets with random products quality: The case of queues and balking.Econometrica 54:11851195.
Hassin, R. 2009. Equilibrium customers choice between FCFS and Random servers. Queueing Systems 62:243254.
Horvath, E. C.; Lam, S.; and Sethi, R. 1977. A level algorithm for preemptive scheduling. J. ACM 24(1):3243.
Immorlica, N.; Kalai, A.; Moitra, A.; Postlewaite, A.; and Tennenholtz, M. 2011. Dueling Algorithms. In Proceedings of the 43th Symposium on Theory of Computing.
Immorlica, N.; Kleinberg, R.; and Mahdian, M. 2006. Secretary problems with competing employers. In Internet and Network Economics, LNCS 4286, 389400.
McAfee, P. 1993. Mechanism Design by Competing Sellers.Econometrica 61:12811312.
Naor, P. 1969. The regulation of queue size by levying tolls.Econometrica 37:1524.
Peters, M., and Severinov, S. 1997. Competition Among Sellers Who Offer Auctions Instead of Prices. Joutnal of Ecoonimc Theory 75:141179.
-----0
Apt, K. R. 1997. From Logic Programming to Prolog. U.K.: Prentice-Hall.
Castelfranchi, C. 1995. Commitments: From individual intentions to groups and organizations. In Proceedings of the International Conference on Multiagent Systems, 4148.
Chopra, A. K., and Singh, M. P. 2006. Contextualizing commitment protocols. In Proceedings of the 5th International Joint Conference on Autonomous Agents and Multiagent Systems, 13451352. Hakodate, Japan: ACM Press.
Chopra, A. K., and Singh, M. P. 2011. Specifying and applying commitment-based business patterns. In Proceedings of the 10th International Conference on Autonomous Agents and MultiAgent Systems (AAMAS), 475482. Taipei: IFAAMAS.
Chopra, A. K.; Dalpiaz, F.; Giorgini, P.; and Mylopoulos, J. 2010a. Modeling and reasoning about service-oriented applications via goals and commitments. In Proceedings of the 22nd International Conference on Advanced Information Systems Engineering (CAiSE), 417421.
Chopra, A. K.; Dalpiaz, F.; Giorgini, P.; and Mylopoulos, J. 2010b. Reasoning about agents and protocols via goals and commitments. In Proceedings of the 9th International Conference on Autonomous Agents and Multiagent Systems (AAMAS), 457464. Toronto: IFAAMAS.
Desai, N.; Mallya, A. U.; Chopra, A. K.; and Singh, M. P.2005. Interaction protocols as design abstractions for business processes. IEEE Transactions on Software Engineering 31(12):10151027.
Desai, N.; Chopra, A. K.; and Singh, M. P. 2009.Amoeba: A methodology for modeling and evolution of cross-organizational business processes. ACM Transactions on Software Engineering and Methodology (TOSEM) 19(2):6:16:45.
Fornara, N., and Colombetti, M. 2009. Ontology and time evolution of obligations and prohibitions using semantic web technology. In Proceedings of the 7th AAMAS Workshop on Declarative Agent Languages and Technologies (DALT), 101118.
Ghallab, M.; Nau, D.; and Traverso, P. 2004. Automated Planning: Theory and Practice. Elsevier.
Hoffmann, J.; Weber, I.; and Kraft, F. M. 2010. SAP speaks PDDL. In Fox, M., and Poole, D., eds., Proceedings of the 24th AAAI Conference on Artificial Intelligence (AAAI). Atlanta: AAAI Press.
Ilghami, O., and Nau, D. S. 2003. A general approach to synthesize problem-specific planners. Technical report, University of Maryland.
Pistore, M.; Marconi, A.; Bertoli, P.; and Traverso, P. 2005.Automated composition of web services by planning at the knowledge level. In Kaelbling, L. P., and Saffiotti, A., eds., Proceedings of the Nineteenth International Joint Conference on Artificial Intelligence, 12521259.
Singh, M. P.; Chopra, A. K.; and Desai, N. 2009.Commitment-based service-oriented architecture. IEEE Computer 42(11):7279.
Singh, M. P. 1991. Social and psychological commitments in multiagent systems. In AAAI Fall Symposium on Knowledge and Action at Social and Organizational Levels, 104 106.
Singh, M. P. 2008. Semantical considerations on dialectical and practical commitments. In Proceedings of the 23rd Conference on Artificial Intelligence (AAAI), 176181. Chicago: AAAI Press.
Singh, M. P. 2012. Commitments in multiagent systems: Some history, some confusions, some controversies, some prospects. In Paglieri, F.; Tummolini, L.; Falcone, R.; and 
Miceli, M., eds., The Goals of Cognition: Essays in Honor of Cristiano Castelfranchi. London: College Publications.chapter 31, 601626.
Telang, P. R.; Meneguzzi, F.; and Singh, M. P. 2013. Hierarchical planning about goals and commitments. In Proceedings of the 12th International Joint Conference on Autonomous Agents and MultiAgent Systems (AAMAS). St.Paul, Minnesota: IFAAMAS.
Telang, P. R.; Yorke-Smith, N.; and Singh, M. P. 2012.Relating goal and commitment semantics. In Proceedings of the 9th International Workshop on Programming Multiagent Systems (ProMAS 2011), volume 7217 of LNCS, 2237.Taipei: Springer.
Thangarajah, J.; Harland, J.; Morley, D.; and Yorke-Smith, N. 2011. Operational behaviour for executing, suspending and aborting goals in BDI agent systems. In Declarative Agent Languages and Technologies VII, Revised Selected and Invited Papers, volume 6618 of LNCS, 121. Springer.
Verdicchio, M., and Colombetti, M. 2002. Commitments for agent-based supply chain management. SIGecom Exchanges 3(1):1323.
Winikoff, M.; Liu, W.; and Harland, J. 2005. Enhancing commitment machines. In Proceedings of the 2nd International Workshop on Declarative Agent Languages and Technologies (DALT), volume 3476 of LNAI, 198220. Berlin: Springer.
Winikoff, M. 2007. Implementing commitment-based interaction. In Proceedings of the 6th International Joint Conference on Autonomous Agents and MultiAgent Systems (AAMAS), 868875. Honolulu: IFAAMAS.
Yolum, P., and Singh, M. P. 2002. Commitment machines.In Proceedings of the 8th International Workshop on Agent 
Theories, Architectures, and Languages (ATAL 2001), volume 2333 of LNAI, 235247. Seattle: Springer.
Yolum, P., and Singh, M. P. 2007. Enacting protocols by commitment concession. In Proceedings of the 6th International Joint Conference on Autonomous Agents and MultiAgent Systems (AAMAS), 116123. Honolulu: IFAAMAS.
-----0
Belkin, M., and Niyogi, P. 2003. Laplacian eigenmaps for dimensionality reduction and data representation. Neural Computation 15:13731396.
Bengio, Y. 2009. Learning deep architectures for AI. Foundations and Trends in Machine Learning 2(1):1127.
Chung, F. 1997. Spectral graph theory. Regional Conference Series in Mathematics 92.
Chung, F. 2005. Laplacians and the Cheeger inequality for directed graphs. Annals of Combinatorics 9.
Coifman, R., and Maggioni, M. 2006. Diffusion wavelets.Applied and Computational Harmonic Analysis 21:5394.
Frank, A., and Asuncion, A. 2010. UCI machine learning repository. [http://archive.ics.uci.edu/ml]. Irvine, CA: University of California, School of Information and Computer Science.
He, X., and Niyogi, P. 2003. Locality preserving projections. In Proceedings of the Advances in Neural Information Processing Systems (NIPS).
Hinton, G. E., and Salakhutdinov, R. R. 2006. Reducing the dimensionality of data with neural networks. Science 313:504507.
Hinton, G. E.; Osindero, S.; and Teh, Y. W. 2006. A fast learning algorithm for deep belief nets. Neural Computation 18:15271554.
Lee, H.; Battle, A.; Raina, R.; and Ng, A. 2007. Efficient sparse coding algorithms. In Proceedings of the Advances in Neural Information Processing Systems (NIPS), 8018084.
Mallat, S. 1998. A wavelet tour in signal processing. Academic Press.
Roweis, S., and Saul, L. 2000. Nonlinear dimensionality reduction by locally linear embedding. Science 290:2323 2326.
Shin, H.; Hill, N.; and Raetsch, G. 2006. Graph-based semisupervised learning with sharper edges. In Proceedings of the European Conference on Machine Learning, 401412.
Stewart, G. W., and Sun, J. 1990. Matrix perturbation theory. Academic Press.
Turk, M., and Pentland, A. 1991. Eigenfaces for recognition.Journal of Cognitive Neuroscience 3:7186.
-----0
Arulampalam, M.; Maskell, S.; Gordon, N.; and Clapp, T.2002. A tutorial on particle filters for online nonlinear/nongaussian bayesian tracking. IEEE Transactions on Signal Processing 50(2):174188.
Dalal, N., and Triggs, B. 2005. Histograms of oriented gradients for human detection. In IEEE Conference on Computer Vision and Pattern Recognition 2005, volume 1, 886893.
El-Gaaly, T.; Zhang, H.; Torki, M.; Elgammal, A.; and Singh, M. 2012. Rgbd object pose recognition using local-global multi-kernel regression. In International Conference on Pattern Recognition 2012.
Elgammal, A., and Lee, C.-S. 2004. Separating style and content on a nonlinear manifold. In IEEE Conference on Computer Vision and Pattern Recognition 2004, volume 1, I478I485.
Felzenszwalb, P. F., and Huttenlocher, D. P. 2005. Pictorial structures for object recognition. IJCV 61(1):5579.
Ham, J. H.; Lee, D. D.; and Saul, L. K. 2005. Semisupervised alignment of manifolds. In Proceedings of the Tenth International Workshop on Artificial Intelligence and Statistics, 120127.
Jolliffe, I. T. 1986. Principal Component Analysis. SpringerVerlag.
Kimeldorf, G. S., and Wahba, G. 1970. A correspondence between bayesian estimation on stochastic processes and smoothing by splines. The Annals of Mathematical Statistics 41(2):495502.
Kimeldorf, G., and Wahba, G. 1971. Some results on tchebycheffian spline functions. Journal of Mathematical Analysis and Applications 33(1):8295.
Kinect. 2010. Microsoft kinect. www.xbox.com/enus/kinect.
Lai, K.; Bo, L.; Ren, X.; and Fox, D. 2011a. A large-scale hierarchical multi-view rgb-d object dataset. In 2011 IEEE International Conference on Robotics and Automation (ICRA), 1817 1824.
Lai, K.; Bo, L.; Ren, X.; and Fox, D. 2011b. A scalable treebased approach for joint object and pose recognition. In In Twenty-Fifth Conference on Artificial Intelligence (AAAI).
Lamdan, Y., and Wolfson, H. 1988. Geometric hashing: A general and efficient model-based recognition scheme.
Lathauwer, L. D.; de Moor, B.; and Vandewalle, J. 2000. A multilinear singular value decomposiiton. SIAM Journal On Matrix Analysis and Applications 21(4):12531278.
Lawrence, N. D. 2004. Gaussian process latent variable models for visualisation of high dimensional data. In Advances in Neural Information Processing Systems 16. Cambridge, MA: MIT Press.
Liebelt, J., and Schmid, C. 2010. Multi-view object class detection with a 3d geometric model. In IEEE Conference on Computer Vision and Pattern Recognition 2010, 16881695.Murase, H., and Nayar, S. 1995. Visual learning and recognition of 3-d objects from appearance. International Journal of Computer Vision 14:524.
Ozuysal, M.; Lepetit, V.; and Fua, P. 2009. Pose estimation for category specific multiview object localization. In IEEE Conference on Computer Vision and Pattern Recognition 2009, 778785.
Payet, N., and Todorovic, S. 2011. From contours to 3d object detection and pose estimation. In IEEE International Conference on Computer Vision 2011, 983990.
Poggio, T., and Girosi, F. 1990. Networks for approximation and learning. Proceedings of the IEEE 78(9):14811497.
Rusu, R. B., and Cousins, S. 2011. 3D is here: Point Cloud Library (PCL). In IEEE International Conference on Robotics and Automation (ICRA).
Rusu, R.; Bradski, G.; Thibaux, R.; and Hsu, J. 2010. Fast 3d recognition and pose using the viewpoint feature histogram.
In 2010 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS), 21552162.
Savarese, S., and Fei-Fei, L. 2007. 3d generic object categorization, localization and pose estimation. In IEEE International Conference on Computer Vision 2007, 18.
Seung, H. S., and Lee, D. D. 2000. The manifold ways of perception. Science 290(5500):22682269.
Sivic, J.; Russell, B. C.; Efros, A. A.; Zisserman, A.; and Freeman, W. T. 2005. Discovering objects and their location in images. In ICCV.
Sun, M.; Su, H.; Savarese, S.; and Fei-Fei, L. 2009. A multiview probabilistic model for 3d object classes. In IEEE Conference on Computer Vision and Pattern Recognition 2009, 12471254.
Tenenbaum, J. B., and Freeman, W. T. 2000. Separating style and content with bilinear models. Neural Computation 12(6):12471283.
Tenenbaum, J. B. 1998. Mapping a manifold of perceptual observations. In Advances in Neural Information Processing Systems 10. Cambridge, MA: MIT Press.
Thomas, A.; Ferrari, V.; Leibe, B.; Tuytelaars, T.; Schiel, B.; and Van Gool, L. 2006. Towards multi-view object class detection. In IEEE Conference on Computer Vision and Pattern Recognition 2006, volume 2, 15891596.
Tipping, M. E., and Bishop, C. M. 1999. Probabilistic principal component analysis. Journal of the Royal Statistical Society: Series B (Statistical Methodology) 61(3):611622.
Torki, M., and Elgammal, A. 2011. Regression from local features for viewpoint and pose estimation. In IEEE International Conference on Computer Vision 2011, 26032610.
Vasilescu, M. A. O., and Terzopoulos, D. 2002. Multilinear analysis of image ensebles: Tensorfaces. In Proc. of ECCV, Copenhagen, Danmark, 447460.
Willamowski, J.; Arregui, D.; Csurka, G.; Dance, C. R.; and Fan, L. 2004. Categorizing nine visual classes using local appearance descriptors. In IWLAVS.
-----0
Alon, U.; Barkai, N.; Notterman, D. A.; Gish, K. W.; Ybarra, S.; Mack, D.; and Levine, A. J. 1999. Broad patterns of gene expression revealed by clustering analysis of tumor and normal colon tissues probed by oligonucleotide arrays. Proceedings of The National Academy of Sciences 96:6745 6750.
Andrews, S.; Tsochantaridis, I.; and Hofmann, T. 2002. Support vector machines for multiple-instance learning. Advances in neural information processing systems 15:561 568.
Bennett, K.; Demiriz, A.; et al. 1999. Semi-supervised support vector machines. Advances in Neural Information processing systems 368374.Bishop, C. 2006. Pattern recognition and machine learning.Springer.
Boyd, S., and Vandenberghe, L. 2004. Convex optimization.Cambridge Univ Press.
Chang, C.-C., and Lin, C.-J. 2011. Libsvm: a library for support vector machines. ACM Transactions on Intelligent Systems and Technology (TIST) 2(3):27.
Chapelle, O.; Scholkopf, B.; Zien, A.; et al. 2006. Semisupervised learning, volume 2. MIT press Cambridge.
Cover, T., and Hart, P. 1967. Nearest neighbor pattern classification. Information Theory, IEEE Transactions on 13(1):2127.
CPLEX, I. I. 2009. V12. 1: Users manual for cplex. International Business Machines Corporation 46(53):157.
Cristianini, N., and Shawe-Taylor, J. 2000. An introduction to support vector machines and other kernel-based learning methods. Cambridge university press.
CVX Research, I. CVX: Matlab software for disciplined convex programming, version 2.0 beta.
Dong, M.; Yin, L.; Deng, W.; Wang, Q.; Yuan, C.; Guo, J.; Shang, L.; and Ma, L. 2012. A linear max k-min classifier. In Pattern Recognition (ICPR), 2012 21st International Conference on, 29672971. IEEE.
Grant, M., and Boyd, S. 2008. Graph implementations for nonsmooth convex programs. In Blondel, V.; Boyd, S.; and Kimura, H., eds., Recent Advances in Learning and Control, Lecture Notes in Control and Information Sciences.Springer-Verlag Limited. 95110.
Ho, T. K., and Kleinberg, E. M. 1996. Building projectable classifiers of arbitrary complexity. In International Conference on Pattern Recognition, volume 2.
Optimization, G. 2012. Gurobi optimizer reference manual.URL: http://www. gurobi. com.
Sturm, J. F. 1999. Using sedumi 1.02, a matlab toolbox for optimization over symmetric cones. Optimization methods and software 11(1-4):625653.Vapnik, V. 2000. The nature of statistical learning theory.Springer-Verlag New York Inc.
Wright, S. 1997. Primal-dual interior-point methods, volume 54. Society for Industrial Mathematics.
-----0
Andelman, N.; Feldman, M.; and Mansour, Y. 2009. Strong price of anarchy. Games and Economic Behavior 65(2):289 317.
Anshelevich, E.; Dasgupta, A.; Kleinberg, J.; Tardos, E.; Wexler, T.; and Roughgarden, T. 2004. The price of stability for network design with fair cost allocation. In Proceedings of the 45th Annual IEEE Symposium on Foundations of Computer Science, FOCS 04, 295304. Washington, DC, USA: IEEE Computer Society.
Aumann, R. 1999. Acceptable points in general cooperative n-person games. Topics in mathematical economics and game theory: essays in honor of Robert J. Aumann 23.
Bogomolnaia, A., and Jackson, M. O. 2002. The stability of hedonic coalition structures. Games and Economic Behavior 38(2):201230.
Chalkiadakis, G.; Elkind, E.; Polukarov, M.; and Jennings, N. 2009. The price of democracy in coalition formation.
In Proceedings of The 8th International Conference on Autonomous Agents and Multiagent Systems (AAMAS), 401 408.
Demange, G. 1994. Intermediate preferences and stable coalition structures. Journal of Mathematical Economics 23(1):4558.
Fabrikant, A.; Luthra, A.; Maneva, E.; Papadimitriou, C.; and Shenker, S. 2003. On a network creation game. In Proceedings of the twenty-second annual symposium on Principles of Distributed Computing (PODC).
Gusfield, D., and Irving, R. 1989. The stable marriage problem: structure and algorithms. The MIT press.
Konishi, H.; Le Breton, M.; and Weber, S. 1997. Pure strategy Nash equilibrium in a group formation game with positive externalities. Games and Economic Behavior 21:161 182.
Koutsoupias, E., and Papadimitriou, C. 1999. Worst-case equilibria. In Proceedings of the 16th annual conference on Theoretical Aspects of Computer Science (STACS).
Kutten, S.; Lavi, R.; and Trehan, A. 2013. Composition games for distributed systems: the EU grant games.http://arxiv.org/abs/1105.5255.
Myerson, R. B. 1977. Graphs and cooperation in games.Mathematics of Operations Research 225229.
Nisan, N.; Roughgarden, T.; Tardos, E.; and Vazirani, V.2007. Algorithmic game theory. Cambridge University Press.
-----0
Agrawal, R.; Hedge, M.; and Teneketzis, D. 1988. Asymptotically efficient adaptive allocation rules for the multiarmed bandit problem with switching cost. Automatic Control, IEEE Transactions on 33(10):899906.
Ardagna, D.; Panicucci, B.; and Passacantando, M. 2011.A game theoretic formulation of the service provisioning problem in cloud systems. In Proceedings of the 20th international conference on World wide web, 177186. ACM.
Audibert, J.; Bubeck, S.; et al. 2010. Best arm identification in multi-armed bandits. In Proceedings of the 23rd Annual Conference on Learning Theory.
Auer, P.; Cesa-Bianchi, N.; and Fischer, P. 2002. Finitetime analysis of the multiarmed bandit problem. Machine learning 47(2):235256.
Auer, P. 2003. Using confidence bounds for exploitationexploration trade-offs. The Journal of Machine Learning Research 3:397422.
Awerbuch, B., and Kleinberg, R. 2004. Near-optimal adaptive routing: Shortest paths and geometric generalizations. In Proceeding of the 36th Annual ACM Symposium on Theory of Computing, 4553.
Babaioff, M.; Sharma, Y.; and Slivkins, A. 2009. Characterizing truthful multi-armed bandit mechanisms. In Proceedings of the 10th ACM conference on Electronic commerce, 7988. ACM.
Ben-Yehuda, O.; Ben-Yehuda, M.; Schuster, A.; and Tsafrir, D. 2011. Deconstructing amazon ec2 spot instance pricing. In Cloud Computing Technology and Science (CloudCom), 2011 IEEE Third International Conference on, 304 311. IEEE.
Berry, D.; Chen, R.; Zame, A.; Heath, D.; and Shepp, L.1997. Bandit problems with infinitely many arms. The Annals of Statistics 25(5):21032116.
Borgs, C.; Chayes, J.; Immorlica, N.; Jain, K.; Etesami, O.; and Mahdian, M. 2007. Dynamics of bid optimization in online advertisement auctions. In Proceedings of the 16th international conference on World Wide Web, 531540. ACM.
Bubeck, S.; Munos, R.; and Stoltz, G. 2009. Pure exploration in multi-armed bandits problems. In Algorithmic Learning Theory, 2337. Springer.
Chakrabarti, D.; Kumar, R.; Radlinski, F.; and Upfal, E.2008. Mortal multi-armed bandits. Advances in Neural Information Processing Systems 30:255262.
Chakraborty, T.; Even-Dar, E.; Guha, S.; Mansour, Y.; and Muthukrishnan, S. 2010. Selective call out and real time bidding. Internet and Network Economics 145157.
Chu, W.; Li, L.; Reyzin, L.; and Schapire, R. 2011. Contextual bandits with linear payoff functions. In Conference on Artificial Intelligence and Statistics (AISTATS).
Feldman, J.; Mirrokni, V.; Muthukrishnan, S.; and Pai, M.2010. Auctions with intermediaries. In Proceedings of the 11th ACM conference on Electronic commerce, 2332.ACM.
Guha, S., and Munagala, K. 2007. Approximation algorithms for budgeted learning problems. In Proceedings of the thirty-ninth annual ACM symposium on Theory of computing, 104113. ACM.
Kleinberg, R. 2004. Nearly tight bounds for the continuumarmed bandit problem. Advances in Neural Information Processing Systems 17:697704.
Tran-Thanh, L.; Chapman, A.; Munoz De Cote Flores Luna, J.; Rogers, A.; and Jennings, N. 2010. Epsilonfirst policies for budgetlimited multi-armed bandits. In Twenty-Fourth AAAI Conference on Artificial Intelligence, 12111216.
Tran-Thanh, L.; Chapman, A.; Rogers, A.; and Jennings, N.2012. Knapsack based optimal policies for budgetlimited multiarmed bandits. 11341140.
Wei, G.; Vasilakos, A.; Zheng, Y.; and Xiong, N. 2010.A game-theoretic method of fair resource allocation for cloud computing services. The Journal of Supercomputing 54(2):252269.
Zaman, S., and Grosu, D. 2010. Combinatorial auctionbased allocation of virtual machine instances in clouds.In Cloud Computing Technology and Science (CloudCom), 2010 IEEE Second International Conference on, 127134.IEEE.
-----0
Bekkerman, R., and Jeon, J. 2007. Multi-modal clustering for multimedia collections. In Proc. CVPR, 18.
Blei, D.; Ng, A.; and Jordan, M. 2003. Latent Dirichlet allocation. Journal of Machine Learning Research 3:993 1022.
Bruno, E.; Moenne-Loccoz, N.; and Marchand-Maillet, S.2008. Design of multimodal dissimilarity spaces for retrieval of video documents. IEEE Transactions on Pattern Analysis and Machine Intelligence 30(9):15201533.
Eaton, E.; desJardins, M.; and Jacob, S. 2010. Multiview clustering with constraint propagation for learning with an incomplete mapping between views. In Proceedings of ACM International Conference on Information and Knowledge Management, 389398.
Fan, J.; Shen, Y.; Yang, C.; and Zhou, N. 2011. Structured max-margin learning for inter-related classifier training and multilabel image annotation. IEEE Transactions on Image Processing 20(3):837854.
Farhadi, A.; Hejrati, M.; Sadeghi, M.; Young, P.; Rashtchian, C.; Hockenmaier, J.; and Forsyth, D. 2010. Every picture tells a story: Generating sentences from images. In Proc.ECCV, volume 4, 1529.
Feng, S.; Manmatha, R.; and Lavrenko, V. 2004. Multiple Bernoulli relevance models for image and video annotation.In Proc. CVPR, volume 2, 10021009.
Fu, Z.; Ip, H.; Lu, H.; and Lu, Z. 2011. Multi-modal constraint propagation for heterogeneous image clustering. In Proceedings of ACM Internatial Conference on Multimedia, 143152.
Guillaumin, M.; Verbeek, J.; and Schmid, C. 2010. Multimodal semi-supervised learning for image classification. In Proc. CVPR, 902909.
Hotelling, H. 1936. Relations between two sets of variates.Biometrika 28(3-4):321377.
Kamvar, S.; Klein, D.; and Manning, C. 2003. Spectral learning. In Proceedings of International Joint Conferences on Artificial Intelligence, 561566.
Kulkarni, G.; Premraj, V.; Dhar, S.; Li, S.; Choi, Y.; Berg, A.; and Berg, T. 2011. Baby talk: Understanding and generating simple image descriptions. In Proc. CVPR, 16011608.
Li, J., and Wang, J. 2003. Automatic linguistic indexing of pictures by a statistical modeling approach. IEEE Transactions on Pattern Analysis and Machine Intelligence 25(9):10751088.
Li, D.; Dimitrova, N.; Li, M.; and Sethi, I. K. 2003. Multimedia content processing through cross-modal association. In Proceedings of ACM Internatial Conference on Multimedia, 604611.
Li, Z.; Liu, J.; and Tang, X. 2008. Pairwise constraint propagation by semidefinite programming for semi-supervised classification. In Proceedings of International Conference on Machine Learning, 576583.
Lowe, D. 2004. Distinctive image features from scaleinvariant keypoints. International Journal of Computer Vision 60(2):91110.
Lu, Z., and Carreira-Perpinan, M. 2008. Constrained spectral clustering through affinity propagation. In Proc. CVPR, 18.
Lu, Z., and Ip, H. 2010. Constrained spectral clustering via exhaustive and efficient constraint propagation. In Proc.ECCV, volume 6, 114.
Ordonez, V.; Kulkarni, G.; and Berg, T. 2012. Im2Text: Describing images using 1 million captioned photographs. In Advances in Neural Information Processing Systems 24, 11431151.
Rasiwasia, N.; Costa Pereira, J.; Coviello, E.; Doyle, G.; Lanckriet, G.; Levy, R.; and Vasconcelos, N. 2010. A new approach to cross-modal multimedia retrieval. In Proceedings of ACM Internatial Conference on Multimedia, 251 260.
Rasiwasia, N.; Moreno, P.; and Vasconcelos, N. 2007.Bridging the gap: Query by semantic example. IEEE Transactions on Multimedia 9(5):923938.
Snoek, C., and Worring, M. 2005. Multimodal video indexing: A review of the state-of-the-art. Multimedia Tools and Applications 25(1):535.
Wang, F., and Zhang, C. 2008. Label propagation through linear neighborhoods. IEEE Transactions on Knowledge and Data Engineering 20(1):5567.
Wold, H. 1985. Partial least squares. In Kotz, S., and Johnson, N., eds., Encyclopedia of Statistical Sciences. New York: Wiley. 581591.
Yu, S., and Shi, J. 2004. Segmentation given partial grouping constraints. IEEE Transactions on Pattern Analysis and Machine Intelligence 26(2):173183.
Zhou, D.; Bousquet, O.; Lal, T.; Weston, J.; and Scholkopf, B. 2004. Learning with local and global consistency. In Advances in Neural Information Processing Systems 16, 321 328.
Zhu, X.; Ghahramani, Z.; and Lafferty, J. 2003. Semisupervised learning using Gaussian fields and harmonic functions. In Proceedings of International Conference on Machine Learning, 912919.
-----0
Akutsu, T.; Hayashida, M.; Ching, W.-K.; and Ng, M. K.2007. Control of boolean networks: hardness results and algorithms for tree-structured networks. Journal of Theoretical Biology 244:670679.
Boutilier, C.; Brafman, R. I.; Domshlak, C.; Hoos, H. H.; and Poole, D. 2004. CP-nets: A tool for representing and reasoning with conditional ceteris paribus preference statements. JAIR 21:135191.
Brafman, R., and Dimopoulos, Y. 2004. Extended semantics and optimization algorithms for cp-networks. Computational Intelligence 20(2):218245.DeGroot, M. 1974. Reaching a consensus. Journal of the American Statistical Association 69:118121.
DeMarzo, P., and Vayanos, D. 2003. Persuasion bias, social influence, and unidimensional opinions. Quarterly Journal of Economics 118:909968.
Faliszewski, P.; Hemaspaandra, E.; and Hemaspaandra, L. A. 2009. How hard is bribery in elections? JAIR 35:485 532.
Grabisch, M., and Rusinowska, A. 2010a. A model of influence in a social network. Theory and Decisions 69(1):6996.
Grabisch, M., and Rusinowska, A. 2010b. A model of influence with an ordered set of possible actions. Theory and Decisions 69(4):635656.
Grabisch, M., and Rusinowska, A. 2011. Iterating influence between players in a social network. In Proc. 16th Coalition Theory Network Workshop.
Grabisch, M., and Rusinowska, A. 2012. A model of influence-based on aggregation functions. Working paper.
Hoede, C., and Bakker, R. 1982. A theory of decisional power. Journal of Mathematical Sociology 8:309322.
Jackson, M. O. 2008. Social and Economic Networks.Princeton University Press.
Krackhardt, D. 1987. Cognitive social structures. Social Networks 9:109134.
Krause, U. 2000. A discrete nonlinear and nonautonomous model of consensus formation. Communications in Difference Equations.
Lang, J., and Xia, L. 2009. Sequential composition of voting rules in multi-issue domains. Mathematical social sciences 57:304324.
Liang, Z., and Seligman, J. 2011. The dynamics of peer pressure. In Proceedings of the Third international conference on Logic, rationality, and interaction, LORI11, 390 391.
Mattei, N.; Rossi, F.; Venable, K. B.; and Pini, M. S. 2012.Bribery in voting over combinatorial domains is easy. In Proc. ISAIM 2012.
Mattei, N.; Pini, M. S.; Venable, K. B.; and Rossi, F. 2013.Bribery in voting with CP-nets. Annals of Mathematics and Artificial Intelligence.
Maudet, N.; Pini, M. S.; Rossi, F.; and Venable, K. B. 2012.Influence and aggregation of preferences over combinatorial domains. In Proc. AAMAS 2012, 13131314.
Purrington, K., and Durfee, E. H. 2007. Making social choices from individuals cp-nets. In AAMAS, 179.
Rossi, F.; Venable, K.; and Walsh, T. 2004. mCP nets: Representing and reasoning with preferences of multiple agents.In AAAI-04, 729734.
Xia, L.; Conitzer, V.; and Lang, J. 2008. Voting on multiattribute domains with cyclic preferential dependencies. In AAAI, 202207.
-----0
Ben Larbi, R.; Konieczny, S.; and Marquis, P. 2007. Extending classical planning to the multi-agent case: A gametheoretic approach. In European Conference on Symbolic and Quantitative Approaches to Reasoning with Uncertainty, ECSQARU, 731742.
Bowling, M. H.; Jensen, R. M.; and Veloso, M. M. 2003.A formalization of equilibria for multiagent planning. In IJCAI, 14601462.
Brafman, R. I., and Domshlak, C. 2008. From one to many: Planning for loosely coupled multi-agent systems. In ICAPS, 2835.
Brafman, R. I.; Domshlak, C.; Engel, Y.; and Tennenholtz, M. 2009. Planning games. In IJCAI, 7378.
Brafman, R. I.; Domshlak, C.; Engel, Y.; and Tennenholtz, M. 2010. Transferable utility planning games. In AAAI.
Chandy, K. M., and Lamport, L. 1985. Distributed snapshots: Determining global states of distributed systems.ACM Trans. Comput. Syst. 3(1):6375.
Clarke, E. H. 1971. Multipart pricing of public goods. Public Choice 2:1933.
Crosby, M., and Rovatsos, M. 2011. Heuristic multiagent planning with self-interested agents. In AAMAS, 12131214.
Dijkstra, E. W. 1959. A note on two problems in connexion with graphs. Numerische Mathematik 1:269271.
Elkind, E.; Sahai, A.; and Steiglitz, K. 2004. Frugality in path auctions. In SODA, 701709.
Ephrati, E., and Rosenschein, J. S. 1991. The Clarke Tax as a consensus mechanism among automated agents. In AAAI, 173178.
Feigenbaum, J., and Shenker, S. 2002. Distributed algorithmic mechanism design: recent results and future directions.In DIAL-M, 113. ACM.
Feigenbaum, J.; Papadimitriou, C. H.; Sami, R.; and Shenker, S. 2002. A BGP-based mechanism for lowest-cost routing. In PODC, 173182. ACM.
Groves, T. 1973. Incentives in Teams. Econometrica 41:617631.
Helmert, M., and Domshlak, C. 2009. Landmarks, critical paths and abstractions: Whats the difference anyway? In ICAPS.
Helmert, M. 2006. The Fast Downward planning system. J.Artif. Intell. Res. (JAIR) 26:191246.
ICAPS. The International Planning Competition.http://www.plg.inf.uc3m.es/ipc2011-deterministic/.
Jonsson, A., and Rovatsos, M. 2011. Scaling up multiagent planning: A best-response approach. In ICAPS.
Karlin, A. R.; Kempe, D.; and Tamir, T. 2005. Beyond VCG: Frugality of truthful mechanisms. In FOCS, 615 626.
Nisan, N., and Ronen, A. 2001. Algorithmic mechanism design. Games and Economic Behavior 35(1-2):166196.
Nissim, R., and Brafman, R. I. 2012a. Multi-agent A* for parallel and distributed systems. In AAMAS, 12651266.
Nissim, R., and Brafman, R. I. 2012b. Multi-agent A* for parallel and distributed systems. In ICAPS Workshop on Heuristics and Search for Domain-Independent Planning, 4351.
Nissim, R.; Apsel, U.; and Brafman, R. I. 2012. Tunneling and decomposition-based state reduction for optimal planning. In ECAI, 624629.
Nissim, R.; Brafman, R. I.; and Domshlak, C. 2010. A general, fully distributed multi-agent planning algorithm. In AAMAS, 13231330.
Parkes, D. C., and Shneidman, J. 2004. Distributed implementations of Vickrey-Clarke-Groves mechanism. In AAMAS, 261268. IEEE Computer Society.
Parkes, D. C.; Kalagnanam, J.; and Eso, M. 2001. Achieving budget-balance with Vickrey-based payment schemes in exchanges. In IJCAI, 11611168. Morgan Kaufmann.
Petcu, A.; Faltings, B.; and Parkes, D. C. 2008. M-DPOP: Faithful distributed implementation of efficient social choice problems. J. Artif. Intell. Res. (JAIR) 32:705755.
Singer, Y. 2010. Budget feasible mechanisms. In FOCS, 765774.
Torreno, A.; Onaindia, E.; and Sapena, O. 2012. An approach to multi-agent planning with incomplete information. In ECAI, volume 242, 762767. IOS Press.
Vickrey, W. 1961. Counterspeculation, Auctions and Competitive Sealed Tenders. Journal of Finance 837.
-----0
Anand, K., and Aron, R. 2003. Group buying on the web: A comparison of price-discovery mechanisms. Management Science 49(11):15461562.
Ashlagi, I.; Monderer, D.; and Tennenholtz, M. 2006. Resource selection games with unknown number of players. In Proceedings of the fifth international joint conference on Autonomous agents and multiagent systems, 819825. ACM.
Chen, J.; Kauffman, R.; Liu, Y.; and Song, X. 2010. Segmenting uncertain demand in group-buying auctions. Electronic Commerce Research and Applications 9(2):126147.
Chen, J.; Chen, X.; and Song, X. 2007. Comparison of the group-buying auction and the fixed pricing mechanism.Decision Support Systems 43(2):445459.
Edelman, B.; Jaffe, S.; and Kominers, S. D. 2011. To groupon or not to groupon: The profitability of deep discounts. Technical Report Working Paper Number 11-063, Harvard Business School, Cambridge, MA.
Hyafil, N., and Boutilier, C. 2004. Regret minimizing equilibria and mechanisms for games with strict type uncertainty.In Proceedings of the 20th conference on Uncertainty in artificial intelligence, 268277. AUAI Press.
Lal, R., and Staelin, R. 1984. An approach for developing an optimal discount pricing policy. Management Science 30(12):15241539.
Li, C.; Chawla, S.; Rajan, U.; and Sycara, K. 2005. Mechanism design for coalition formation and cost sharing in group-buying markets. Electronic Commerce Research and Applications 3(4):341354.
Lu, T., and Boutilier, C. 2012. Matching models for preference-sensitive group purchasing. In Proceedings of the 13th ACM Conference on Electronic Commerce, 723 740. ACM.
Matsuo, T.; Ito, T.; and Shintani, T. 2005. A volume discount-based allocation mechanism in group buying. In Proceedings of the International Workshop on Data Engineering Issues in E-commerce, 5970.
Monahan, J. 1984. A quantity discount pricing model to increase vendor profits. Management science 30(6):720726.
Prashanth, B., and Narahari, Y. 2008. Efficient algorithms for combinatorial auctions with volume discounts arising in web service composition. In Proceedings of the 4th IEEE Conference on Automation Science and Engineering, 995 1000.
Savage, L. 1972. The foundation of statistics. Dover publications.
Wang, Q. 2002. Determination of suppliers optimal quantity discount schedules with heterogeneous buyers. Naval Research Logistics (NRL) 49(1):4659.
Yamamoto, J., and Sycara, K. 2001. A stable and efficient buyer coalition formation scheme for e-marketplaces.In Proceedings of the fifth international conference on Autonomous agents, 576583. ACM.
-----0
Anderson, John R., 2004. Cognitive psychology and its implications. 6th Edition, Worth Publishers.  
Avidan, S. & Shamir, A.. 2007. Seam carving for content-aware  image resizing. In ACM Transactions on Graphics, pages 1-10. 
Black, M. J. & Anandan, P. 1996. The robust estimation of multiple motions: Parametric and piecewise-smooth flow fields. In  Computer Vision and Image Understanding, 63, pages 75104.  
Born, R.T., Groh, J., Zhao, R., and Lukasewycz, S.J.. 2000. Segregation of object and background motion in visual Area MT: effects of microstimulation on eye movements, In Neuron, 26, pages 725-734.  
Carrasco, M. & Frieder, K. 1997. Cortical magnification neutralizes the eccentricity effect in visual search. In Vision Research,  37(1), pages 6382.  
Cheng, W-H., Chu, W-T., Kuo, J-H., and Wu, J-L. 2005. Automatic video region-of-interest determination based on user attention model. In Proceedings of the IEEE International Symposium  on Circuits and Systems. (ISCAS), pages 3219-3222.  
Gibson, J.J.. 1950. The Perception of the Visual World. Houghton  Mifflin.  
Harel, J., Koch, C., and Perona, P.. 2007. Graph-based visual saliency. In Proceedings of the 20th Annual Conference on Neural  Information Processing Systems (NIPS), pages 545-552.  
Horn, B. &  Schunck, B. 1981. Determining optical flow. In Artificial Intelligence, 16, pages 185203.  
Itti, L., Koch, C. and Niebur, E.. 1998. A model of saliency-based  visual attention for rapid scene analysis. In IEEE Transactions on  Pattern Analysis and Machine Intelligence, 20(11), pages 12541259.  
Itti, L. & Baldi, P.. 2009. Bayesian surprise attracts human attention. In Vision Research, 49, pages 1295-1306.  
Jiang, J.R. & Crookes, D.. 2012. Visual saliency estimation  through manifold learning. In Proceedings of the 26th AAAI Conference on Artificial Intelligence, pages 2003-2010.  
Judd, T., Ehinger, K., Durand, F. and Torralba, A.. 2009. Learning to predict where humans look. In Proceedings of the IEEE  12th International Conference on Computer Vision (ICCV), pages  2106-2113.  
Koch, C. & Ullman, S.. 1985. Shifts in selective visual attention:  Towards the Underlying Neural Circuitry. In Human Neurobiology, pages 219-227.  
Li, B., Xiong, W.H., Hu, W.M.. 2012. Visual saliency map from  tensor analysis. In Proceedings of the 26th AAAI Conference on  Artificial Intelligence, pages 1585-1591.  
Li, Q., Chen, S.F., Zhang, B.W.. 2012. Predictive video saliency  detection. In Communications in Computer and Information Science, 321, pages 178-185.  
Li, Y. & Osher, S.. 2009. A new median formula with applications to PDE based denoising. In Communications in Mathematical Sciences, 7(3), pages 741753.  
Liu, C., Yuen, P.C., Qiu, G.P.. 2009. Object motion detection using information theoretic spatio-temporal saliency In Pattern  Recognition, 42 (11), pages 28972906  
Loy, C.C., Xiang, T., Gong S.G.. 2012. Salient motion detection  in crowded scenes, In Proceedings of the 5th International Symposium on Communications, Control and Signal Processing  (ISCCSP).  
Marat, S., Ho Phuoc, T., Granjon, L., Guyader, N., Pellerin, D.,  Gurin-Dugu A.. 2009. Modelling spatio-temporal saliency to  predict gaze direction for short videos. In International Journal of  Computer Vision, 82(3), pages 231243.  
Marszal?ek, M., Laptev, I., and Schmid, C.. 2009. Actions in Context. In Proceedings of the 2009 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR).   
Mathe, S. & Sminchisescu, C.. 2012. Dynamic Eye Movement  Datasets and Learnt Saliency Models for Visual Action Recognition, In Proceedings of the 9th European Conference on Computer Vision (ECCV), pages 842-856.  
Oikonomopoulos, I., Patras, I., Pantic, M.. 2006. Spatiotemporal  salient points for visual recognition of human actions. In IEEE Transactions on Systems, Man, and Cybernetics  Part B, 36 (3),  pages 710719.  
Parkhurst, D., Law, K., and Niebur, E.. 2002. Modeling the role  of salience in the allocation of overt visual attention. In Vision  Research, pages 107-113.  
Peters, R. J., & Itti, L. 2008. Applying computational tools to  predict gaze direction in interactive visual environments. In ACM  Transactions on Applied Perception, 5.  
Sun, D., Roth, S., Black, M. J.. 2010. Secrets of Optical Flow Estimation and Their Principles. In Proceedings of the 2010 IEEE  Computer Society Conference on Computer Vision and Pattern  Recognition (CVPR).  
Viola, P. & Jones, M.. 2001. Robust real-time object detection. In  International Journal of Computer Vision.  
Wang, T., Mei, T., Hua, X.-S., Liu, X., and Zhou, H.-Q. 2007.  Video collage: A novel presentation of video sequence. In Proceedings of the 2009 IEEE International Conference on Multimedia and Expo (ICME), pages 1479--1482.  
Vul, E., Frank, M.C., Tenenbaum, J.B., Alvarez, G.. 2010. Explaining human multiple object tracking as resource-constrained  approximate inference in a dynamic probabilistic model. In Proceedings of the 23rd Annual Conference on Neural Information  Processing Systems (NIPS), 22, pages 1955-1963.  
Warren, D.H. & Strelow, E.R.. 1985. Electronic spatial sensing  for the blind: contributions from perception. Martinus Nijhoff  Publishers, Massachusetts.  
Wedel, A., Pock, T., Zach, C., Cremers, D., and Bischof, H.. 2008.  An improved algorithm for TV-L1 optical flow. In Dagstuhl Motion Workshop, 2008.  
Xu, L., Jia,J. and Matsushita, Y.. 2010. Motion detail preserving  optical flow estimation. In Proceedings of the 2010 IEEE Computer Society Conference on Computer Vision and Pattern  Recognition (CVPR).   
Yilmaz, A., Javed, O., and Shah, M.. 2006. Object Tracking: A  Survey, In ACM Computing Surveys, 38(4), pages 13.  
Yu, H., Li, J., Tian, Y., Huang, T., 2010. Automatic interesting  object extraction from images using complementary saliency  maps, In Proceedings of the 18th ACM International Conference  on Multimedia (ACMMM), pages 891-894.  
Zhai, Y. & Shah, M.. 2006. Visual attention detection in video  sequences using spatiotemporal cues. In Proceedings of the 14th  ACM International Conference on Multimedia (ACMMM), pages  815-824.    
-----0
Amato, C.; Dibangoye, J. S.; and Zilberstein, S. 2009. Incremental policy generation for finite-horizon DEC-POMDPs.
In Proceedings of the International Conference on Automated Planning and Scheduling, 29.
Bernstein, D. S.; Givan, R.; Immerman, N.; and Zilberstein, S. 2002. The complexity of decentralized control of Markov decision processes. Mathematics of Operations Research 27:819840.
Brafman, R. I., and Shani, G. 2012. A multi-path compilation approach to contingent planning. In Proceedings of the Twenty-Sixth Conference on Artificial Intelligence, 1868 1874.
Helmert, M. 2006. The fast downward planning system.Journal of Artificial Intelligence Research 26:191246.
Kumar, A.; Zilberstein, S.; and Toussaint, M. 2011. Scalable multiagent planning using probabilistic inference. In Proceedings of the Twenty-Second International Joint Conference on Artificial Intelligence, 21402146.
Lewis, H. R. 1978. Complexity of solvable cases of the decision problem for the predicate calculus. In Proceedings of the Nineteenth Annual Symposium on Foundations of Computer Science, 3547.
Oliehoek, F. A.; Spaan, M. T. J.; Whiteson, S.; and Vlassis, N. 2008. Exploiting locality of interaction in factored DECPOMDPs. In Proceedings of the Seventh International Joint Conference on Autonomous Agents and Multiagent Systems, 517524.
Oliehoek, F. A.; Spaan, M. T. J.; and Vlassis, N. A. 2008.Optimal and approximate Q-value functions for decentralized POMDPs. Journal of Artificial Intelligence Research 32:289353.
Papadimitriou, C. H. 1994. Computational Complexity.Reading, MA: Addison-Wesley.
Seuken, S., and Zilberstein, S. 2007. Improved memorybounded dynamic programming for decentralized POMDPs.
In Proceedings of the Twenty-Third Conference on Uncertainty in Artificial Intelligence, 344351.
Seuken, S., and Zilberstein, S. 2008. Formal models and algorithms for decentralized decision making under uncertainty. Autonomous Agents and Multi-Agent Systems 17(2):190250.
Wu, F.; Zilberstein, S.; and Chen, X. 2011. Online planning for multi-agent systems with bounded communication.Artificial Intelligence 175(2):487511.
Yoon, S. W.; Fern, A.; Givan, R.; and Kambhampati, S.2008. Probabilistic planning via determinization in hindsight. In Proceedings of the Twenty-Third Conference on Artificial Intelligence, 10101016.
-----0
Baier, J. A., and Botea, A. 2009. Improving planning performance using low-conflict relaxed plans. In Gerevini, A.; 
Howe, A.; Cesta, A.; and Refanidis, I., eds., Proceedings of the 19th International Conference on Automated Planning and Scheduling (ICAPS 2009). AAAI Press.
Bonet, B., and Geffner, H. 2001. Planning as heuristic search. Artificial Intelligence 129(12):533.
Bylander, T. 1994. The computational complexity of propositional STRIPS planning. Artificial Intelligence 69(1 2):165204.
Cai, D.; Hoffmann, J.; and Helmert, M. 2009. Enhancing the context-enhanced additive heuristic with precedence constraints. In Gerevini, A.; Howe, A.; Cesta, A.; and Refanidis, I., eds., Proceedings of the 19th International Conference on Automated Planning and Scheduling (ICAPS 2009), 5057.AAAI Press.
Chen, H., and Gimenez, O. 2008. Causal graphs and structurally restricted planning. In Rintanen, J.; Nebel, B.; Beck, 
J. C.; and Hansen, E., eds., Proceedings of the 18th International Conference on Automated Planning and Scheduling (ICAPS 2008), 3643. AAAI Press.
Fox, M., and Long, D. 1998. The automatic inference of state invariants in TIM. Journal of Artificial Intelligence Research 9:367421.
Fox, M., and Long, D. 2001. Stan4: A hybrid planning strategy based on subproblem abstraction. The AI Magazine 22(3):8184.
Gerevini, A., and Schubert, L. 1998. Inferring stateconstraints for domain independent planning. In Mostow, J., and Rich, C., eds., Proceedings of the 15th National Conference of the American Association for Artificial Intelligence (AAAI-98), 905912. Madison, WI, USA: MIT Press.
Gerevini, A.; Saetti, A.; and Serina, I. 2003. Planning through stochastic local search and temporal action graphs.Journal of Artificial Intelligence Research 20:239290.
Haslum, P. 2012. Incremental lower bounds for additive cost planning problems. In Bonet, B.; McCluskey, L.; Silva, 
J. R.; and Williams, B., eds., Proceedings of the 22nd International Conference on Automated Planning and Scheduling (ICAPS 2012), 7482. AAAI Press.
Helmert, M., and Geffner, H. 2008. Unifying the causal graph and additive heuristics. In Rintanen, J.; Nebel, B.; 
Beck, J. C.; and Hansen, E., eds., Proceedings of the 18th International Conference on Automated Planning and Scheduling (ICAPS 2008), 140147. AAAI Press.
Helmert, M. 2004. A planning heuristic based on causal graph analysis. In Koenig, S.; Zilberstein, S.; and Koehler, J., eds., Proceedings of the 14th International Conference on Automated Planning and Scheduling (ICAPS-04), 161170.Whistler, Canada: Morgan Kaufmann.
Helmert, M. 2006. The Fast Downward planning system.Journal of Artificial Intelligence Research 26:191246.
Helmert, M. 2009. Concise finite-domain representations for PDDL planning tasks. 173:503535.
Hoffmann, J., and Nebel, B. 2001. The FF planning system: Fast plan generation through heuristic search. Journal of Artificial Intelligence Research 14:253302.
Hoffmann, J. 2011. Analyzing search topology without running any search: On the connection between causal graphs and h+. Journal of Artificial Intelligence Research 41:155 229.
Katz, M.; Hoffmann, J.; and Domshlak, C. 2013. Who said we need to relax All variables? In Borrajo, D.; Fratini, S.; 
Kambhampati, S.; and Oddi, A., eds., Proceedings of the 23rd International Conference on Automated Planning and Scheduling (ICAPS 2013). AAAI Press. Forthcoming.
Keyder, E., and Geffner, H. 2008. Heuristics for planning with action costs revisited. In Ghallab, M., ed., Proceedings of the 18th European Conference on Artificial Intelligence (ECAI-08), 588592. Patras, Greece: Wiley.
Keyder, E.; Hoffmann, J.; and Haslum, P. 2012. Semirelaxed plan heuristics. In Bonet, B.; McCluskey, L.; Silva, 
J. R.; and Williams, B., eds., Proceedings of the 22nd International Conference on Automated Planning and Scheduling (ICAPS 2012). AAAI Press.
Koehler, J., and Hoffmann, J. 2000. On reasonable and forced goal orderings and their use in an agenda-driven planning algorithm. Journal of Artificial Intelligence Research 12:338386.
Richter, S., and Westphal, M. 2010. The LAMA planner: Guiding cost-based anytime planning with landmarks. Journal of Artificial Intelligence Research 39:127177.
Rintanen, J. 2000. An iterative algorithm for synthesizing invariants. In Kautz, H. A., and Porter, B., eds., Proceedings of the 17th National Conference of the American Association for Artificial Intelligence (AAAI-00), 806811. Austin, TX, USA: AAAI Press.
Vidal, V. 2004. A lookahead strategy for heuristic search planning. In Koenig, S.; Zilberstein, S.; and Koehler, J., eds., Proceedings of the 14th International Conference on Automated Planning and Scheduling (ICAPS-04), 150160.Whistler, Canada: Morgan Kaufmann.
-----0
Bolt, J. H.; Renooij, S.; and van der Gaag, L. C. 2003. Upgrading ambiguous signs in QPNs. In Proc. of the Conference on Uncertainty in Artificial Intelligence (UAI), 7380.
Bolt, J. H.; van der Gaag, L. C.; and Renooij, S. 2003. Introducing situational influences in QPNs. In Proc. of the European Conference on Symbolic and Quantitative Approaches to Reasoning with Uncertainty (ECSQARU), 113124.
Bolt, J. H.; van der Gaag, L. C.; and Renooij, S. 2004.The practicability of situational signs for QPNs. In Proc.of the International Conference on Information Processing and Management of Uncertainty in Knowledge-based Systems (IPMU), 16911698.
de Campos, C. P., and Cozman, F. G. 2005. Belief updating and learning in semi-qualitative probabilistic networks. In Proc. of the Conference on Uncertainty in Artificial Intelligence (UAI), 153160.
de Campos, C. P. 2011. New complexity results for MAP in Bayesian networks. In Proc. of the International Joint Conference on Artificial Intelligence (IJCAI), 21002106. AAAI Press.
Druzdzel, M. J., and Henrion, M. 1993a. Belief propagation in qualitative probabilistic networks. In Carrete, N. P., and 
Singh, M., eds., Qualitative Reasoning and Decision Technologies. CIMNE, Barcelona. 451460.
Druzdzel, M. J., and Henrion, M. 1993b. Efficient reasoning in qualitative probabilistic networks. In Proc. of the AAAI Conference on Artificial Intelligence (AAAI), 548553.
Fagiuoli, E., and Zaffalon, M. 1998. 2U: An exact interval propagation algorithm for polytrees with binary variables.Artificial Intelligence 106(1):77107.
Maua, D.; de Campos, C.; and Zaffalon, M. 2012. The complexity of approximately solving influence diagrams. In Proc. of the Conference on Uncertainty in Artificial Intelligence (UAI), 604613. AUAI Press.
Parsons, S., and Dohnal, M. 1993. A semiqualitative approach to reasoning in probabilistic networks. Applied Artificial Intelligence 7:223235.
Renooij, S., and van der Gaag, L. C. 2000. Exploiting non-monotonic influences in qualitative belief networks. In Proc. International Conference on Information Processing and Management of Uncertainty in Knowledge-based Systems (IPMU), 12851290.
Renooij, S., and van der Gaag, L. C. 2002. From qualitative to quantitative probabilistic networks. In Proc. of the Conference on Uncertainty in Artificial Intelligence (UAI), 422429. San Francisco, CA: Morgan Kaufmann Publishers.
Renooij, S., and Witteman, C. 1999. Talking probabilities: communicating probabilistic information with words and numbers. International Journal of Approximate Reasoning 22:169194.
Renooij, S.; van der Gaag, L. C.; and Parsons, S. 2000. Propagation of multiple observations in qualitative probabilistic networks. In Proc. of the Belgium-Netherlands Conference on Artificial Intelligence, 235242.
Renooij, S.; van der Gaag, L. C.; and Parsons, S. 2002a.Propagation of multiple observations in qpns revisited. In Proc. of the European Conference on Artificial Intelligence (ECAI), 665669. Amsterdam: IOS Press.
Renooij, S.; van der Gaag, L. C.; and Parsons, S. 2002b.Context-specific sign-propagation in qualitative probabilistic networks. Artificial Intelligence 140(1-2):207230.
van der Gaag, L. C.; Bodlaender, H. L.; and Feelders, A. 2004. Monotonicity in Bayesian networks. In Proc. of the Conference on Uncertainty in Artificial Intelligence (UAI), 569576. AUAI Press.
Wellman, M. P. 1990. Fundamental concepts of qualitative probabilistic networks. Artificial Intelligence 44(3):257 303.
-----0
Afrati, F., and Kolaitis, P. G. 2008. Answering aggregate queries in data exchange. In Proceedings of the twentyseventh ACM SIGMOD-SIGACT-SIGART symposium on  Principles of database systems, PODS 08, 129138. New York, NY, USA: ACM.
Arenas, M.; Barcelo, P.; and Reutter, J. L. 2011. Query languages for data exchange: Beyond unions of conjunctive queries. Theory Comput. Syst. 49(2):489564.
Arenas, M.; Bertossi, L.; Chomicki, J.; He, X.; Raghavan, V.; and Spinrad, J. 2003. Scalar aggregation in inconsistent databases. Theor. Comput. Sci. 296(3):405434.
Artale, A.; Calvanese, D.; Kontchakov, R.; and Zakharyaschev, M. 2009. The DL-Lite family and relations. J.Artif. Intell. Res. (JAIR) 36:169.
Bienvenu, M.; Ortiz, M.; and Simkus, M. 2012. Answering expressive path queries over lightweight DL knowledge bases. In Kazakov, Y.; Lembo, D.; and Wolter, F., eds., Description Logics, volume 846 of CEUR Workshop Proceedings. CEUR-WS.org.
Borger, E.; Gradel, E.; and Gurevich, Y. 2001. The Classical Decision Problem. Springer, Berlin.
Calvanese, D.; De Giacomo, G.; Lembo, D.; Lenzerini, M.; and Rosati, R. 2007. Tractable reasoning and efficient query answering in description logics: The DL-Lite family. J. of Automated Reasoning 39(3):385429.
Calvanese, D.; Kharlamov, E.; Nutt, W.; and Thorne, C.2008. Aggregate queries over ontologies. In Elmasri, R.; 
Doerr, M.; Brochhausen, M.; and Han, H., eds., ONISW, 97 104. ACM.
Calvanese, D.; Giacomo, G. D.; Lembo, D.; Lenzerini, M.; Poggi, A.; Rodriguez-Muro, M.; Rosati, R.; Ruzzi, M.; and Savo, D. F. 2011. The MASTRO system for ontology-based data access. Semantic Web 2(1):4353.
Cohen, S.; Nutt, W.; and Sagiv, Y. 2007. Deciding equivalences among conjunctive aggregate queries. Journal of the ACM 54(2).
Cuenca Grau, B.; Horrocks, I.; Motik, B.; Parsia, B.; PatelSchneider, P.; and Sattler, U. 2008. Owl 2: The next step for OWL. Web Semant. 6(4):309322.
Glimm, B.; Ogbuji, C.; Hawke, S.; Herman, I.; Parsia, B.; Polleres, A.; and Seaborne, A. 2013. SPARQL 1.1 entailment regimes. W3C Recommendation 21 March 2013, http://www.w3.org/TR/2013/REC-sparql11entailment-20130321/.
Gutierrez-Basulto, V.; Ibanez-Garc?a, Y. A.; and Kontchakov, R. 2012. An update on query answering with restricted forms of negation. In Proceedings of the 6th international conference on Web Reasoning and Rule Systems, RR12, 7589. Berlin, Heidelberg: Springer-Verlag.
Kontchakov, R.; Lutz, C.; Toman, D.; Wolter, F.; and Zakharyaschev, M. 2011. The combined approach to ontologybased data access. In IJCAI, 26562661.
Libkin, L. 2006. Data exchange and incomplete information. In Vansummeren, S., ed., PODS, 6069. ACM.
Rosati, R. 2007. The limits of querying ontologies. In Schwentick, T., and Suciu, D., eds., ICDT, volume 4353 of Lecture Notes in Computer Science, 164178. Springer.
Vardi, M. Y. 1982. The complexity of relational query languages (extended abstract). In STOC, 137146.
-----0
Ahmadi, B.; Kersting, K.; and Hadiji, F. 2010. Lifted belief propagation: Pairwise marginals and beyond. In P. Myllymaeki, T. Roos, T. J., ed., Proceedings of the 5th European Workshop on Probabilistic Graphical Models (PGM10).
Apsel, U., and Brafman, R. I. 2012. Exploiting Uniform Assignments in First-Order MPE. In UAI, 7483.
Bengio, Y.; Delalleau, O.; and Le Roux, N. 2006. Label propagation and quadratic criterion. In Chapelle, O.; 
Scholkopf, B.; and Zien, A., eds., Semi-Supervised Learning. MIT Press. 193216.
Bui, H. B.; Huynh, T. N.; and de Salvo Braz, R. 2012. Exact lifted inference with distinct soft evidence on every object.In AAAI.
Bui, H. H.; Huynh, T. N.; and Riedel, S. 2012. Automorphism Groups of Graphical Models and Lifted Variational Inference. In Statistical Relational AI.
Choi, J., and Amir, E. 2012. Lifted Relational Variational Inference. In UAI, 196206.
de Salvo Braz, R.; Amir, E.; and Roth, D. 2005. Lifted first-order probabilistic inference. In IJCAI, 13191325.
den Broeck, G. V.; Choi, A.; and Darwiche, A. 2012. Lifted relax, compensate and then recover: From approximate to exact lifted probabilistic inference. In UAI, 131141.
Garnett, R.; Krishnamurthy, Y.; Xiong, X.; Schneider, J.; and Mann, R. 2012. Bayesian optimal active search and surveying. In Langford, J., and Pineau, J., eds., ICML, 12391246.New York, NY, USA: Omnipress.
Globerson, A., and Jaakkola, T. 2007. Fixing maxproduct: Convergent message passing algorithms for map lp-relaxations. In NIPS.
Ihler, A. T.; III, J. W. F.; and Willsky, A. S. 2005. Loopy belief propagation: Convergence and effects of message errors.Journal of Machine Learning Research 6:905936.
Kersting, K.; Ahmadi, B.; and Natarajan, S. 2009. Counting belief propagation. In Bilmes, J., and Ng, A. Y., eds., UAI, 277284.
Kersting, K.; Massaoudi, Y. E.; Ahmadi, B.; and Hadiji, F.2010. Informed lifting for messagepassing. In M. Fox, 
D. P., ed., AAAI. Atlanta, USA: AAAI Press.Kersting, K. 2012. Lifted probabilistic inference. In ECAI.
Montpellier, France: IOS Press. (Invited Talk at the Frontiers of AI Track).
Kumar, A., and Zilberstein, S. 2010. Map estimation for graphical models by likelihood maximization. In Lafferty, 
J.; Williams, C. K. I.; Shawe-Taylor, J.; Zemel, R.; and Culotta, A., eds., NIPS, 11801188.
McDonald, R.; Pereira, F.; Ribarov, K.; and Hajic?, J. 2005.Non-projective dependency parsing using spanning tree algorithms. In Proceedings of the conference on Human Language Technology and Empirical Methods in Natural Language Processing, HLT 05, 523530. Stroudsburg, PA, USA: Association for Computational Linguistics.
Mooij, J. M. 2010. libDAI: A free and open source C++ library for discrete approximate inference in graphical models. Journal of Machine Learning Research 11:21692173.
Nath, A., and Domingos, P. 2010. Efficient lifting for online probabilistic inference. In AAAI.
Niepert, M. 2012. Markov chains on orbits of permutation groups. In UAI, 624633.
Pearl, J. 1991. Reasoning in Intelligent Systems: Networks of Plausible Inference. Morgan Kaufmann, 2. edition.
Poole, D. 2003. First-order probabilistic inference. In IJCAI, 985991.
Richardson, M., and Domingos, P. 2006. Markov logic networks. Machine Learning 62(1-2):107136.
Shervashidze, N.; Schweitzer, P.; van Leeuwen, E. J.; Mehlhorn, K.; and Borgwardt:, K. M. 2011. Weisfeilerlehman graph kernels. Journal of Machine Learning Research 12:25392561.
Singla, P., and Domingos, P. 2006. Entity resolution with markov logic. In ICDM, 572582. Washington, DC, USA: IEEE Computer Society.
Singla, P., and Domingos, P. 2008. Lifted first-order belief propagation. In AAAI.
Singla, P.; Nath, A.; and Domingos, P. 2010. Approximate lifted belief propagation. In Statistical Relational AI.
Sontag, D.; Globerson, A.; and Jaakkola, T. 2011. Introduction to dual decomposition for inference. In Sra, S.; 
Nowozin, S.; and Wright, S. J., eds., Optimization for Machine Learning. MIT Press.
Toussaint, M.; Charlin, L.; and Poupart, P. 2008. Hierarchical pomdp controller optimization by likelihood maximization. In UAI, 562570. Arlington, Virginia: AUAI Press.
Wainwright, M. J., and Jordan, M. I. 2008. Graphical models, exponential families, and variational inference. Foundations and Trends in Machine Learning 1(1-2):1305.
Wainwright, M. J.; Jaakkola, T.; and Willsky, A. S. 2005.Map estimation via agreement on trees: message-passing and linear programming. IEEE Transactions on Information Theory 51(11):36973717.
Yanover, C.; Meltzer, T.; Weiss, Y.; Bennett, P.; and Parradohernndez, E. 2006. Linear programming relaxations and belief propagation an empirical study. Jourmal of Machine Learning Research 7:18871907.
-----0
Ahrens, K.; Chung, S.; and Huang, C. 2004. From lexical semantics to conceptual metaphors: Mapping principle verification with Wordnet and SUMO. In Recent Advancement in Chinese Lexical Semantics: Proceedings of 5th Chinese Lexical Semantics Workshop (CLSW-5), Singapore: COLIPS, 99106.
Allbritton, D.; McKoon, G.; and Gerrig, R. 1995. Metaphorbased schemas and text representations: Making connections through conceptual metaphors. Journal of Experimental Psychology: Learning, Memory, and Cognition 21(3):612.
Assaf, D.; Neuman, Y.; Cohen, Y.; Argamon, S.; Howard, N.; Last, M.; Frieder, O.; and Koppel, M. 2013. Why dark thoughts arent really dark: A novel algorithm for metaphor identification. In Proc. IEEE Symposium Series on Computational Intelligence 2013.
Birke, J., and Sarkar, A. 2006. A clustering approach for the nearly unsupervised recognition of nonliteral language. In Proceedings of EACL, volume 6, 329336.
Blei, D.; Ng, A.; and Jordan, M. 2003. Latent dirichlet allocation. the Journal of machine Learning research 3:993 1022.
Boers, F. 2003. Applied linguistics perspectives on crosscultural variation in conceptual metaphor. Metaphor and Symbol 18(4):231238.
Brew, C., and Schulte im Walde, S. 2002. Spectral clustering for german verbs. In Proceedings of the ACL-02 conference on Empirical methods in natural language processingVolume 10, 117124. Association for Computational Linguistics.
De Marneffe, M.; MacCartney, B.; and Manning, C. 2006.Generating typed dependency parses from phrase structure parses. In Proceedings of LREC, volume 6, 449454.
Fass, D., and Wilks, Y. 1983. Preference semantics, illformedness, and metaphor. Computational Linguistics 9(34):178187.
Freeman, M. 2003. Poetry and the scope of metaphor: Toward a cognitive theory of literature. Metaphor and Metonymy at the Crossroads: A Cognitive Perspective 30:253.
Gibbs Jr, R. 1992. Categorization and metaphor understanding. Psychological review 99(3):572.
Goguen, J., and Harrell, D. 2010. Style: A computational and conceptual blending-based approach. In Argamon, S.; 
Burns, K.; and Dubnov, S., eds., The Structure of Style.Springer-Verlag: Berlin, Heidelberg. 291316.
Johnson, M.; Lakoff, G.; et al. 2002. Why cognitive linguistics requires embodied realism. Cognitive linguistics 13(3):245264.
Krishnakumaran, S., and Zhu, X. 2007. Hunting elusive metaphors using lexical resources. In Proceedings of the Workshop on Computational approaches to Figurative Language, 1320. Association for Computational Linguistics.
Lakoff, G., and Johnson, M. 1980. Metaphors we live by.University of Chicago Press: London.
Lewis, D.; Yang, Y.; Rose, T.; and Li, F. 2004. RCV1: A new benchmark collection for text categorization research.The Journal of Machine Learning Research 5:361397.
Mason, Z. 2004. CorMet: A computational, corpus-based conventional metaphor extraction system. Computational Linguistics 30(1):2344.
Nayak, S., and Mukerjee, A. 2012. A grounded cognitive model for metaphor acquisition. In Twenty-Sixth AAAI Conference on Artificial Intelligence.
Pantel, P., and Lin, D. 2002. Discovering word senses from text. In Proceedings of the eighth ACM SIGKDD international conference on Knowledge discovery and data mining, 613619. ACM.Rohrer, T. 2007. The cognitive science of metaphor from philosophy to neuropsychology. Neuropsychological Trends 2:3140.
Shutova, E.; Teufel, S.; and Korhonen, A. 2012. Statistical metaphor processing. Computational Linguistics 39(2):1 92.
Sproat, R., and van Santen, J. 1998. Automatic ambiguity detection. In Proceedings ICSLP.
Thibodeau, P., and Boroditsky, L. 2011. Metaphors we think with: The role of metaphor in reasoning. PLoS One 6(2):e16782.
Turney, P.; Neuman, Y.; Assaf, D.; and Cohen, Y. 2011. Literal and metaphorical sense identification through concrete and abstract context. In Proceedings of the 2011 Conference on the Empirical Methods in Natural Language Processing, 680690.
Wickman, S.; Daniels, M.; White, L.; and Fesmire, S. 1999.A primer in conceptual metaphor for counselors. Journal of Counseling & Development 77(4):389394.
-----0
Brenner, M. 2011. Creating Dynamic Story Plots with Continual  Multiagent Planning. Proc. of the 24th National Conference on  Artificial Intelligence.  
Chambers, N. and Jurafsky, D. 2008. Unsupervised Learning of  Narrative Event Chains. Proc. of the 46th Annual Meeting of the  Association for Computational Linguistics.  
Chen, S., Nelson, M., and Mateas, M. 2009. Evaluating the  Authorial Leverage of Drama Management. Proc. of the 5th AAAI  Conference on AI and Interactive Digital Entertainment.  
Gervs, P., Daz-Agudo, B., Peinado, F., and Hervs, R. 2005.  Story Plot Generation based on CBR. Journal of KnowledgeBased Systems, 18, 235-242.  
Lebowitz, M. 1987. Planning stories. Proc. of the 9th Annual  Conference of the Cognitive Science Society.  
Li, B., Lee-Urban, S., Appling, D.S., and Riedl, M.O. 2012.  Crowdsourcing Narrative Intelligence. Advances in Cognitive  Systems, 2, 25-42.  
Liu, H. and Singh, P. 2002. MAKEBELIEVE: Using  Commonsense to Generate Stories. Proc. of the 18th National  Conference on Artificial Intelligence.  
Meehan, J.R. 1976. The Metanovel: Writing Stories by  Computers. Ph.D. Thesis, Yale University.  
McIntyre, N. and Lapata, M. 2010. Plot induction and  evolutionary search for story generation. Proc. of the 48th Annual  Meeting of the Association for Computational Linguistics.  
Nelson, M. and Mateas, M. 2005. Search-Based Drama  Management in the Interactive Fiction Anchorhead. Proc. of the  1st AAAI Conference on AI and Interactive Digital Entertainment.  
Porteous, J., Cavazza, M., and Charles, F. 2010. Applying  Planning to Interactive Storytelling: Narrative Control Using  State Constraints. ACM Transactions on Intelligent Systems and  Technology, 1(2), 1-21.  
Regneri, M., Koller, A., and Pinkal, M. 2010. Learning Script  Knowledge with Web Experiments. Proc. of the 48th Annual  Meeting of the Association for Computational Linguistics.  
Riedl, M.O. and Young, R.M. 2010. Narrative Planning:  Balancing Plot and Character. Journal of Artificial Intelligence  Research, 39, 217-268.  
Swanson, R. and Gordon, A. 2012. Say Anything: Using Textual  Case-Based Reasoning to Enable Open-Domain Interactive  Storytelling. ACM Transactions on Interactive Intelligent  Systems, 2(3), 16:1-16:35.  
Turner, S. 1994. The Creative Process: A Computer Model of  Storytelling. Lawrence Erlbaum Associates.  
Weyhrauch, P. 1997. Guiding Interactive Fiction. Ph.D. Thesis,  Carnegie Mellon University.  
Winston, P.H. 2011. The Strong Story Hypothesis and the  Directed Perception Hypothesis. In Technical Report FS-11-01, Papers from the AAAI Fall Symposium. AAAI Press.         
-----0
Abbeel, P., and Ng, A. Y. 2004. Apprenticeship learning via inverse reinforcement learning. In Proceedings of the Twenty-first International Conference on Machine Learning.
Argall, B.; Chernova, S.; Veloso, M.; and Browning, B.2009. A survey of robot learning from demonstration.
Robotics and Autonomous Systems 67:469483.Baxter, J.; Tridgell, A.; and Weaver, L. 1998. Knightcap: A chess program that learns by combining td(?) with gametree search. In Proceedings of the 15th International Conference on Machine Learning, 2836. Morgan Kaufmann.
Beal, D. F. 1990. A generalised quiescence search algorithm. Artificial Intelligence 43(1):8598.
Buro, M. 2002. Improving heuristic mini-max search by supervised learning. Artificial Intelligence 8599.
Campbell, M.; Hoane Jr, A. J.; and Hsu, F.-h. 2002. Deep blue. Artificial Intelligence 134(1-2):5783.
Coulom, R. 2006. Efficient selectivity and backup operators in monte-carlo tree search. In 5th International Conference on Computer and Games, 7283.
Coulom, R. 2007. Computing elo ratings of move patterns in the game of Go. ICGA Journal 30(4):198208.
He, H.; Daume III, H.; and Eisner, J. 2012. Imitation learning by coaching. In Advances in Neural Information Processing Systems 25.
Heinz, E. A. 1998. Darkthought goes deep. ICCA Journal 21(4):228229.
Hoki, K., and Kaneko, T. 2011. The global landscape of objective functions for the optimization of shogi piece values with a game-tree search. In ACG, volume 7168 of Lecture Notes in Computer Science, 184195.
Hsu, F.-h.; Anantharaman, T. S.; Campbell, M. S.; and Nowatzyk, A. G. 1990. Deep Thought. In Computers, Chess and Cognition, 5578.
Kaneko, T., and Hoki, K. 2011. Analysis of evaluationfunction learning by comparison of sibling nodes. In ACG, volume 7168 of Lecture Notes in Computer Science, 158 169.
Neu, G., and Szepesvari, C. 2009. Training parsers by inverse reinforcement learning. Machine Learning 77:303 337.
Ross, S., and Bagnell, D. 2010. Efficient reductions for imitation learning. Journal of Machine Learning Research Proceedings Track 9:661668.
Sebag, M., and Ducoulombier, A. 1998. Extending population-based incremental learning to continuous search spaces. In Proceedings of the 5th International Conference on Parallel Problem Solving from Nature, 418427.
Silver, D., and Tesauro, G. 2009. Monte-carlo simulation balancing. In Proceedings of the 26th International Conference on Machine Learning, 945952.
Takeuchi, S.; Kaneko, T.; Kazunori, Y.; and Kawai, S. 2007.Visualization and adjustment of evaluation functions based on evaluation values and win probability. In AAAI07, 858 863.
Tesauro, G. 2001. Comparison training of chess evaluation functions. In Machines that learn to play games, 117130.Nova Science Publishers, Inc.
Tsuruoka, Y.; Yokoyama, D.; and Chikayama, T. 2002.Game-tree search algorithm based on realization probability. ICGA Journal 25(3):145152.
-----0
Andrews, S.; Tsochantaridis, I.; and Hofmann, T. 2003.Support vector machines for multiple-instance learning. In Advances in Neural Information Processing Systems, 561 568.
Auer, P., and Ortner, R. 2004. A boosting approach to multiple instance learning. In Machine Learning: ECML 2004, volume 3201 of Lecture Notes in Computer Science.Springer. 6374.
Blockeel, H.; Page, D.; and Srinivasan, A. 2005. Multiinstance tree learning. In Proceedings of the 22nd International Conference on Machine Learning, 5764.
Breiman, L. 1996. Bagging predictors. Machine Learning Journal 24(2):123140.
Cohn, D. A.; Ghahramani, Z.; and Jordan, M. I. 1996. Active learning with statistical models. Journal of Artificial Intelligence Research 4:129145.
Dietterich, T. G.; Lathrop, R. H.; and Lozano-Perez, T.1997. Solving the multiple instance problem with axisparallel rectangles. Artificial Intelligence 89(12):3171.
Freund, Y., and Schapire, R. E. 1996. Experiments with a new boosting algorithm. In Proceedings of the 13th International Conference on Machine Learning, 148156.
Gartner, T.; Flach, P.; Kowalczyk, A.; and Smola, A. 2002.Multi-instance kernels. In Proceedings of the 19th International Conference on Machine Learning, 179186.
Liu, D.; Hua, X.; Yang, L.; and Zhang, H. 2009. Multipleinstance active learning for image categorization. Advances in Multimedia Modeling 239249.
Maron, O., and Ratan, A. L. 1998. Multiple-instance learning for natural scene classification. In Proceedings of the 15th International Conference on Machine Learning, 341 349.
Maron, O. 1998. Learning from Ambiguity. Ph.D. Dissertation, Department of Electrical Engineering and Computer Science, MIT, Cambridge, MA.
Pedregosa, F.; Varoquaux, G.; Gramfort, A.; Michel, V.; Thirion, B.; Grisel, O.; Blondel, M.; Prettenhofer, P.; Weiss, R.; Dubourg, V.; et al. 2011. Scikit-learn: Machine Learning in Python . Journal of Machine Learning Research 12:2825 2830.
Ramon, J., and Raedt, L. D. 2000. Multi instance neural networks. In Proceedings of the ICML 2000 workshop on Attribute-Value and Relational Learning.
Ray, S., and Craven, M. 2005. Supervised versus multiple instance learning: an empirical comparison. In Proceedings of the 26th International Conference on Machine Learning, 697704.
Settles, B.; Craven, M.; and Ray, S. 2008. Multiple-instance active learning. In Advances in Neural Information Processing Systems, 12891296.Tong, S., and Koller, D. 2002. Support vector machine active learning with applications to text classification. The Journal of Machine Learning Research 2:4566.
Xu, X., and Frank, E. 2004. Logistic regression and boosting for labeled bags of instances. In Proceedings of the 8th Pacific-Asia Conference on Knowledge Discovery and Data Mining, 272281.
Zhang, Q., and Goldman, S. 2001. EM-DD: An improved multiple-instance learning technique. In Advances in Neural Information Processing Systems, 10731080.
Zhou, Z.-H., and Zhang, M.-L. 2002. Neural networks for multi-instance learning. In Proceedings of the International Conference on Intelligent Information Technology.
Zhou, Z., and Zhang, M. 2003. Ensembles of multi-instance learners. In Machine Learning: ECML 2003, volume 2837 of Lecture Notes in Computer Science. Springer. 492502.
Zhou, Z.; Sun, Y.; and Li, Y. 2009. Multi-instance learning by treating instances as non-IID samples. In Proceedings of the 26th International Conference on Machine Learning, 12491256.
-----0
Aumann, R. 1960. Acceptable points in games of perfect information. PAC J MATH 10:381417.
Chen, X.; Deng, X.; and Teng, S.-H. 2009. Settling the complexity of computing twoplayer Nash equilibria. J ACM 56(3):14:114:57.
Conitzer, V., and Sandholm, T. 2008. New complexity results about Nash equilibria. GAME ECON BEHAV 63(2):621641.
Daskalakis, C.; Goldberg, P.; and Papadimitriou, C. 2006.The complexity of computing a Nash equilibrium. In STOC, 7178.
Epstein, A.; Feldman, M.; and Mansour, Y. 2007. Strong equilibrium in cost sharing connection games. In ACM EC, 8492.
Fourer, R.; Gay, D.; and Kernighan, B. 1990. A modeling language for mathematical programming. Management Science 36(5):519554.
Gatti, N.; Patrini, G.; Rocco, M.; and Sandholm, T. 2012.Combining local search techniques and path following for bimatrix games. In UAI, 286295.
Gatti, N.; Rocco, M.; and Sandholm, T. 2013. On the verification and computation of strong Nash equilibrium. In AAMAS.
Gourve`s, L., and Monnot, J. 2009. On strong equilibria in the max cut game. InWINE, 608615.
Hayrapetyan,A.; Tardos, E.; andWexler, T. 2006. The effect of collusion in congestion games. In STOC, 8998.
Hoefer, M., and Skopalik, A. 2010. On the complexity of Paretooptimal Nash and strong equilibria. In SAGT, 312 322.
Holzman, R., and Law-Yone, N. 1997. Strong equilibrium in congestion games. GAME ECON BEHAV 21:85101.
Lemke, C., and Howson, J. 1964. Equilibrium points of bimatrix games. SIAM J APPL MATH 12(2):413423.
Luo, Z.-Q.; Pang, J.-S.; and Ralph, D. 1996. Mathematical Programs with EquilibriumConstraints. CambridgeUniversity Press.
Miettinen, K. 1999. Multiobjective Optimization. Kluwer.Nessah, R., and Tian, G. 2012. On the existence of strong Nash equilibria. IESEG School of Management, Working Paper.
Nudelman, E.; Wortman, J.; Leyton-Brown, K.; and Shoham, Y. 2004. Run the GAMUT: A comprehensive approach to evaluating gametheoretic algorithms. In AAMAS, 880887.
Onn, S., and Weissman, I. 2011. Generating uniform random vectors over a simplex with implications to the volume of a certain polytope and to multivariate extremes. Annals of Operations Research 189(1):331342.
Porter, R.; Nudelman, E.; and Shoham, Y. 2009. Simple search methods for finding a Nash equilibrium. GAME ECON BEHAV 63:642662.
Rozenfeld, O., and Tennenholtz, M. 2006. Strong and correlated strong equilibria in monotone congestion games. In WINE, 7486.
Sandholm, T.; Gilpin, A.; and Conitzer, V. 2005. Mixed integer programming methods for finding Nash equilibria.In AAAI, 495501.
Shoham, Y., and Leyton-Brown, K. 2008. Multiagent Systems: Algorithmic, Game Theoretic and Logical Foundations. Cambridge University Press.
Stanford Business Software Inc. 2012. http://www.sbsi-soloptimize.com/.
Thompson, D. R. M.; Leung, S.; and Leyton-Brown, K.2011. Computing Nash equilibria of actiongraph games via support enumeration. InWINE, 338350.
-----0
Aumann, R., and Dreze, J. 1974. Cooperative games with coalition structures. International Journal of Game Theory 3(4):217237.
Aziz, H., and de Keijzer, B. 2011. Complexity of coalition structure generation. Arxiv preprint arXiv:1101.1007.
Bachrach, Y., and Rosenschein, J. 2009. Power in threshold network flow games. AAMAS 18(1):106132.
Bachrach, Y.; Elkind, E.; Meir, R.; Pasechnik, D.; Zuckerman, M.; Rothe, J.; and Rosenschein, J. 2009a. The cost of stability in coalitional games. Algorithmic Game Theory 122134.
Bachrach, Y.; Meir, R.; Zuckerman, M.; Rothe, J.; and Rosenschein, J. 2009b. The cost of stability in weighted voting games. In Proceedings of The 8th International Conference on Autonomous Agents and Multiagent SystemsVolume 2, 12891290.
Bachrach, Y.; Meir, R.; Jung, K.; and Kohli, P. 2010. Coalitional Structure Generation in Skill Games. In AAAI-2010.
Bansal, N.; Blum, A.; and Chawla, S. 2004. Correlation clustering. Machine Learning Journal 86113.
Bilbao, J. M. 2000. Cooperative Games on Combinatorial Structures. Kluwer Publishers.
Chalkiadakis, G.; Elkind, E.; and Wooldridge, M. 2011.Computational Aspects of Cooperative Game Theory. Morgan and Claypool.
Chalkiadakis, G.; Markakis, E.; and Jennings, N. R. 2012.Coalitional stability in structured environments. In AAMAS, 779786.
Cowans, P., and Szummer, M. 2005. A graphical model for simultaneous partitioning and labeling. In AISTATS.
Deng, X., and Papadimitriou, C. H. 1994. On the complexity of cooperative solution concepts. Math. Oper. Res.19(2):257266.
Gabow, H., and Westermann, H. 1988. Forests, frames, and games: algorithms for matroid sums and applications.In Proceedings of the twentieth annual ACM symposium on 
Theory of computing, STOC 88, 407421. New York, NY, USA: ACM.
Gillies, D. B. 1953. Some theorems on n-person games.Ph.D. Dissertation, Princeton University.
Greco, G.; Malizia, E.; Palopoli, L.; and Scarcello, F. 2011.On the complexity of the core over coalition structures. In AAAI, 216221.
Ha?stad, J. 1996. Clique is hard to approximate within n1-epsilon. In FOCS, 627636.
Ieong, S., and Shoham, Y. 2006. Multi-attribute coalitional games. In ACM EC.
Larson, K., and Sandholm, T. 2000. Anytime coalition structure generation: average case study. J. Experimental & Theoretical Artificial Intelligence 12(1):2342.
Mitra, P., and Samal, M. 2009. Approximation algorithm for correlation clustering. In Networked Digital Technologies (NDT).
NASH-WILLIAMS, C. S. A. 1964. Decomposition of finite graphs into forests. J. London Math. Soc.
Ohta, N.; Iwasaki, A.; Yokoo, M.; Maruono, K.; Conitzer, V.; and Sandholm, T. 2006. A compact representation scheme for coalitional games in open anonymous environments. In AAAI, volume 21, 697702.
Peleg, B., and Sudholter, P. 2007. Introduction to the theory of cooperative games. Springer.
Rahwan, T., and Jennings, N. 2008. An improved dynamic programming algorithm for coalition structure generation.In AAMAS.
Rahwan, T.; Ramchurn, S.; Dang, V.; Giovannucci, A.; and Jennings, N. 2007. Anytime optimal coalition structure generation. In AAAI.
Rahwan, T.; Michalak, T.; Wooldridge, M.; and Jennings, N. R. 2012. Anytime coalition structure generation in multiagent systems with positive or negative externalities. Artificial Intelligence.
Sandholm, T.; Larson, K.; Andersson, M.; Shehory, O.; and Tohme, F. 1999. Coalition structure generation with worst case guarantees. AIJ.
Schmeidler, D. 1969. The nucleolus of a characteristic function game. SIAM Journal on Applied Mathematics 17(6):11631170.
Service, T., and Adams, J. 2010. Approximate coalition structure generation. In AAAI.
Shehory, O., and Kraus, S. 1998. Methods for task allocation via agent coalition formation. Artificial Intelligence 101(1 2):165200.
Shoham, Y., and Leyton-Brown, K. 2009. Multiagent systems: Algorithmic, game-theoretic, and logical foundations.Cambridge Univ Pr.
Tan, J. 2008. A note on the inapproximability of correlation clustering. Information Processing Letters 108(5):331335.
Thomason, A. 2001. The extremal function for complete minors. J. Comb. Theory Ser. B 81(2):318338.
Voice, T.; Polukarov, M.; and Jennings, N. R. 2012. Graph coalition structure generation. Technical report.
Wagner, K. 1937. Uber eine Eigenschaft der ebenen Komplexe. Math. Ann. 114:570590.
Yun Yeh, D. 1986. A dynamic programming approach to the complete set partitioning problem. BIT Numerical Mathematics 26(4):467474.
-----0
ANSYS, Inc. 2013. ANSYS DesignXplorer.http://www.ansys.com/Products/Workflow+Technology/AN SYS+Workbench+Platform/ANSYS+DesignXplorer.
Beal, J.; Mostafa, H.; Mozeika, A.; Axelrod, B.; Adler, A.; Markiewicz, G.; and Usbeck, K. 2012. A manifold operator representation for adaptive design. In GECCO 2012.
Beal, J. 2011. Functional blueprints: An approach to modularity in grown systems. Swarm Intelligence Journal 5(34):257281.
Carroll, S. B. 2005. Endless Forms Most Beautiful. W. W.Norton & Co.
Fan, Z.; Wang, J.; and Goodman, E. 2005. Cutting Edge Robotics. Germany: Pro Literatur Verlag. chapter Exploring Open-Ended Design Space of Mechatronic Systems, 707 726.
JGAP. 2006. JGAP Java Genetic Algorithms Package: http://jgap.sf.net.
Kirschner, M. W., and Norton, J. C. 2005. The Plausibility of Life: Resolving Darwins Dilemma. Yale University Press.
Kossiakoff, A.; Sweet, W. N.; Seymour, S.; and Biemer, S. M. 2011. Systems Engineering Principles and Practice.Wiley-Interscience, 2 edition.
Koza, J. R.; Bennett III, F. H.; Andre, D.; and Keane, M. A.1998. Evolutionary design of analog electrical circuits using genetic programming. In Adaptive Computing in Design and Manufacture, 177192. Springer.
Newton, M. A. H.; Pham, D. N.; Sattar, A.; and Maher, M. J.2011. Kangaroo: An efficient constraint-based local search system using lazy propagation. In Principles and Practice of Constraint Programming, 17th International Conference, CP, 645659.
OGrady, R.; Christensen, A. L.; Pinciroli, C.; and Dorigo, M. 2010. Robots autonomously self-assemble into dedicated morphologies to solve different tasks. In Autonomous Agents and Multiagent Systems.
OGrady, R.; Christensen, A.; and Dorigo, M. 2009. Swarmorph: Multi-robot morphogenesis using directional selfassembly. IEEE Transactions on Robotics 25(3):738743.
Quigley, M.; Gerkey, B.; Conley, K.; Faust, J.; Foote, T.; Leibs, J.; Berger, E.; Wheeler, R.; and Ng, A. Y. 2009.
ROS: an open-source robot operating system. In Proceedings of the Open-Source Software workshop at the International Conference on Robotics and Automation (ICRA).
Stoy, K., and Nagpal, R. 2004. Self-reconfiguration using directed growth. In Intl. Symposium on Distributed Autonomous Robotic Sys. (DARS).
Van Hentenryck, P., and Michel, L. 2005. Constraint-Based Local Search. MIT Press.
Werfel, J., and Nagpal, R. 2007. Collective construction of environmentally-adaptive structures. In Intl Conf. on Intelligent Robots and Sys.
-----0
Aamodt, A., and Plaza, E. 1994. Case-based reasoning: foundational issues, methodological variations, and system approaches. AI Communications 7(1):3959.
Backstrom, C., and Klein, I. 1991. Planning in polynomial time: the SAS-PUBS class. Computational Intelligence 7:181197.
Backstrom, C., and Nebel, B. 1996. Complexity results for SAS+ planning. Computational Intelligence 11:625655.
Backstrom, C.; Chen, Y.; Jonsson, P.; Ordyniak, S.; and Szeider, S. 2012. The complexity of planning revisited a parameterized analysis. In Twenty-Sixth AAAI Conference on Artificial Intelligence.
Backstrom, C.; Jonsson, P.; Ordyniak, S.; and Szeider, S.2013. Parameterized complexity and kernel bounds for hard planning problems. In Spirakis, P., and Serna, M., eds., Algorithms and Complexity (CIAC 2013), volume 7878 of Lecture Notes in Computer Science.
Bodlaender, H. L.; Downey, R. G.; Fellows, M. R.; and Wareham, H. T. 1995. The parameterized complexity of sequence alignment and consensus. Theoretical Computer Science 147:3154.
Bylander, T. 1994. The computational complexity of propositional STRIPS planning. Artificial Intelligence 69:165204.
Cesati, M. 2003. The Turing way to parameterized complexity. Journal of Computer and System Sciences 67:654685.
Chen, H., and Gimenez, O. 2010. Causal graphs and structurally restricted planning. Journal of Computer and System Sciences 76(7):579592.
Downey, R. G., and Fellows, M. R. 1995. Fixed-parameter tractability and completeness I: Basic results. SIAM J. Comput. 24(4):873921.
Downey, R. G., and Fellows, M. R. 1999. Parameterized Complexity. Monographs in Computer Science. New York: Springer Verlag.
Downey, R.; Fellows, M. R.; and Stege, U. 1999. Parameterized complexity: A framework for systematically confronting computational intractability. In Contemporary Trends in Discrete Mathematics: From DIMACS and DIMATIA to the Future, volume 49 of AMS-DIMACS, 4999. American Mathematical Society.
Fellows, M. R.; Hermelin, D.; Rosamond, F. A.; and Vialette, S. 2009. On the parameterized complexity of multipleinterval graph problems. Theoretical Computer Science 410(1):5361.
Flum, J., and Grohe, M. 2003. Describing parameterized complexity classes. Information and Computation 187(2):291 319.
Flum, J., and Grohe, M. 2006. Parameterized Complexity Theory, volume XIV of Texts in Theoretical Computer Science. An EATCS Series. Berlin: Springer Verlag.
Ghallab, M.; Nau, D.; and Traverso, P. 2004. Automated Planning: Theory & Practice. Morgan Kaufmann.
Gottlob, G., and Szeider, S. 2006. Fixed-parameter algorithms for artificial intelligence, constraint satisfaction, and database problems. The Computer Journal 51(3):303325.Survey paper.
Hanks, S., and Weld, D. 1995. A domain-independent algorithm for plan adaptation. Journal of Artificial Intelligence Research (JAIR) 2:319360.
Helmert, M. 2006. The fast downward planning system.Journal of Artificial Intelligence Research 26(1):191246.
Hoffmann, J. 2001. Ff: The fast-forward planning system.AI magazine 22(3):57.
Kambhampati, S., and Hendler, J. A. 1992. A validationstructure-based theory of plan modification and reuse. Artificial Intelligence 55:193258.
Leake, D. B., ed. 1996. Case-Based Reasoning. Cambridge, Massachusetts: The MIT Press.
Liberatore, P. 2005. On the complexity of case-based planning. Journal of Experimental & Theoretical Artificial Intelligence 17(3):283295.
Nebel, B., and Koehler, J. 1995. Plan reuse versus plan generation: A complexity-theoretic perspective. Artificial IntelligenceSpecial Issue on Planning and Scheduling 76:427454.
Niedermeier, R. 2006. Invitation to Fixed-Parameter Algorithms. Oxford Lecture Series in Mathematics and its Applications. Oxford: Oxford University Press.
Spalazzi, L. 2001. A survey on case-based planning. Artificial Intelligence Review 16(1):336.
Tonidandel, F., and Rillo, M. 2002. The FAR-OFF system: A heuristic search case-based planning. In Ghallab, M.; 
Hertzberg, J.; and Traverso, P., eds., AIPS, 302311. AAAI.Veloso, M. 1994. Planning and Learning by Analogical Reasoning, volume 886 of Lecture Notes in Artificial Intelligence and Lecture Notes in Computer Science. New York, USA: Springer-Verlag Inc.
-----0
Al-Najjar, N. I., and Smorodinsky, R. 2007. The efficiency of competitive mechanisms under private information. Journal of Economic Theory 137(1):383403.
Arrow, K., and Debreu, G. 1954. Existence of an equilibrium for a competitive economy. Econometrica 22(3):265 290.
Bharadwaj, V. e. a. 2010. Pricing guaranteed contracts in online display advertising. In ACM international conference on Information and knowledge management (CIKM).
Boutilier, C.; Parkes, D. C.; Sandholm, T.; and Walsh, W. E.2008. Expressive banner ad auctions and model-based online optimization for clearing. In AAAI Conference on Artificial Intelligence.
Cheng, J. Q., and Wellman, M. P. 1998. The WALRAS algorithm: A convergent distributed implementation of general equilibrium outcomes. Computational Economics 12(1):1 24.
Chickering, D. M.; Meek, C. A.; Charles, D. X.; and Tillman, R. E. 2010. Inventory management, US patent application 12/761,961.
Codenotti, B.; McCune, B.; and Varadarajan, K. 2005. Market equilibrium via the excess demand function. In ACM symposium on Theory of computing.
Emek, Y.; Feldman, M.; Gamzu, I.; Leme, R. P.; and Tennenholtz, M. 2012. Signaling schemes for revenue maximization. In ACM Conference on Electronic Commerce.
Lahaie, S.; Parkes, D. C.; and Pennock, D. M. 2008. An expressive auction design for online display advertising. In AAAI Conference on Artificial Intelligence.
Muthukrishnan, S. 2009. Ad exchanges: Research issues.In Workshop on Internet & Network Economics (WINE).
Radovanovic, A., and Heavlin, W. D. 2012. Risk-aware revenue maximization in display advertising. In International Conference on World Wide Web.
Walsh, W. E.; Boutilier, C.; Sandholm, T.; Shields, R.; Nemhauser, G. L.; and Parkes, D. C. 2010. Automated channel abstraction for advertising auctions. In AAAI Conference on Artificial Intelligence.
-----0
Andraus, Z. S.; Liffiton, M. H.; and Sakallah, K. A. 2008.
Reveal: A formal verification tool for verilog designs. In International Conference on Logic for Programming, Artificial Intelligence, and Reasoning, 343352.
Bailey, J., and Stuckey, P. J. 2005. Discovery of minimal unsatisfiable subsets of constraints using hitting set dualization. In International Symposium on Practical Aspects of Declarative Languages, 174186.
Belov, A.; Lynce, I.; and Marques-Silva, J. 2012. Towards efficient MUS extraction. AI Commun. 25(2):97116.
Birnbaum, E., and Lozinskii, E. L. 2003. Consistent subsets of inconsistent systems: structure and behaviour. J. Exp.Theor. Artif. Intell. 15(1):2546.
Buning, H. K., and Kullmann, O. 2009. Minimal unsatisfiability and autarkies. In Handbook of Satisfiability. IOS Press. 339401.
Davies, J., and Bacchus, F. 2011. Solving MAXSAT by solving a sequence of simpler SAT instances. In Principles and Practice of Constraint Programming, 225239.
de la Banda, M. J. G.; Stuckey, P. J.; and Wazny, J. 2003. Finding all minimal unsatisfiable subsets. In Conference on Principles and Practice of Declarative Programming, 32 43.
Een, N., and Sorensson, N. 2003. An extensible SAT-solver.In Theory and Applications of Satisfiability Testing, 502 518.
Giunchiglia, E., and Maratea, M. 2012. Algorithms for solving satisfiability problems with qualitative preferences. In Correct Reasoning, 327344. Springer.
Gregoire, E.; Mazure, B.; and Piette, C. 2007. Boosting a complete technique to find MSS and MUS thanks to a local search oracle. In International Joint Conference on Artificial Intelligence, 23002305.
Han, B., and Lee, S.-J. 1999. Deriving minimal conflict sets by CS-trees with mark set in diagnosis from first principles. IEEE Transactions on Systems, Man, and Cybernetics, Part B 29(2):281286.
Hunter, A., and Konieczny, S. 2006. Shapley inconsistency values. In Conference on Principles of Knowledge Representation and Reasoning, 249259.
Hunter, A., and Konieczny, S. 2010. On the measure of conflicts: Shapley inconsistency values. Artif. Intell.174(14):10071026.
Junker, U. 2004. QUICKXPLAIN: Preferred explanations and relaxations for over-constrained problems. In AAAI Conference on Artificial Intelligence, 167172.
Liffiton, M., and Malik, A. 2013. Enumerating infeasibility: Finding multiple MUSes quickly. In Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems.
Liffiton, M. H., and Sakallah, K. A. 2005. On finding all minimally unsatisfiable subformulas. In Theory and Applications of Satisfiability Testing, 173186.
Liffiton, M. H., and Sakallah, K. A. 2008. Algorithms for computing minimal unsatisfiable subsets of constraints. J.Autom. Reasoning 40(1):133.
Liffiton, M. H.; Moffitt, M. D.; Pollack, M. E.; and Sakallah, K. A. 2005. Identifying conflicts in overconstrained temporal problems. In International Joint Conference on Artificial Intelligence, 205211.
Marques-Silva, J.; Heras, F.; Janota, M.; Previti, A.; and Belov, A. 2013. On computing minimal correction subsets. In International Joint Conference on Artificial Intelligence.
Marques-Silva, J.; Janota, M.; and Belov, A. 2013. Minimal sets over monotone predicates in Boolean formulae. In Computer Aided Verification.
OSullivan, B.; Papadopoulos, A.; Faltings, B.; and Pu, P. 2007. Representative explanations for over-constrained problems. In AAAI Conference on Artificial Intelligence, 323328.
Reiter, R. 1987. A theory of diagnosis from first principles.Artif. Intell. 32(1):5795.
Rosa, E. D.; Giunchiglia, E.; and Maratea, M. 2010. Solving satisfiability problems with preferences. Constraints 15(4):485515.
Safarpour, S.; Mangassarian, H.; Veneris, A. G.; Liffiton, M. H.; and Sakallah, K. A. 2007. Improved design debugging using maximum satisfiability. In Formal Methods in Computer-Aided Design, 1319.
Schlobach, S.; Huang, Z.; Cornet, R.; and van Harmelen, F. 2007. Debugging incoherent terminologies. J. Autom.Reasoning 39(3):317349.
Sinz, C.; Kaiser, A.; and Kuchlin, W. 2003. Formal methods for the validation of automotive product configuration data.AI EDAM 17(1):7597.
Stern, R. T.; Kalech, M.; Feldman, A.; and Provan, G. M.2012. Exploring the duality in conflict-directed model-based diagnosis. In AAAI Conference on Artificial Intelligence.
Torlak, E.; Chang, F. S.-H.; and Jackson, D. 2008. Finding minimal unsatisfiable cores of declarative specifications. In International Symposium on Formal Methods, 326341.
Torlak, E.; Vaziri, M.; and Dolby, J. 2010. MemSAT: checking axiomatic specifications of memory models. In Conference on Programming Language Design and Implementation, 341350.
Xiao, G., and Ma, Y. 2012. Inconsistency measurement based on variables in minimal unsatisfiable subsets. In European Conference on Artificial Intelligence, 864869.
-----0
Arrow, K., et al. 2007. Statement on prediction markets.AEI-Brookings Publication No. 07-11.
Berg, J., and Rietz, T. 2003. Prediction markets as decision support systems. Information Systems Frontiers 5(1):7993.
Berg, J.; Forsythe, R.; Nelson, F.; and Rietz, T. 2008.Results from a dozen years of election futures markets research. Handbook of Experimental Economics Results 1:742751.
Brahma, A.; Chakraborty, M.; Das, S.; Lavoie, A.; and Magdon-Ismail, M. 2012. A Bayesian market maker. In Proceedings of the 13th ACM Conference on Electronic Commerce, 215232.
Chen, Y., and Pennock, D. 2007. A utility framework for bounded-loss market makers. In Proceedings of the 23rd Conference on Uncertainty in Artificial Intelligence, 4956.
Chen, Y.; Dimitrov, S.; Sami, R.; Reeves, D.; Pennock, D.; Hanson, R.; Fortnow, L.; and Gonen, R. 2009. Gaming prediction markets: Equilibrium strategies with a market maker. Algorithmica 140.
Cowgill, B.; Wolfers, J.; and Zitzewitz, E. 2010. Using prediction markets to track information flows: Evidence from Google. Working paper.
Das, S., and Magdon-Ismail, M. 2009. Adapting to a market shock: Optimal sequential market-making. In Koller, D.; 
Schuurmans, D.; Bengio, Y.; and Bottou, L., eds., Advances in Neural Information Processing Systems 21. 361368.Das, S. 2005. A learning market-maker in the GlostenMilgrom model. Quantitative Finance 5(2):169180.
Das, S. 2008. The effects of market-making on price dynamics. In Proceedings of the 7th International Joint Conference on Autonomous Agents and Multiagent Systems Volume 2, AAMAS 08, 887894. Richland, SC: International Foundation for Autonomous Agents and Multiagent Systems.
Gneezy, U., and Rustichini, A. 2000. Pay enough or dont pay at all. The Quarterly Journal of Economics 115(3):791 810.
Hanson, R., and Oprea, R. 2009. A manipulator can aid prediction market accuracy. Economica 76(302):304314.
Hanson, R. 2007. Logarithmic market scoring rules for modular combinatorial information aggregation. Journal of Prediction Markets 1(1):315.
Hanson, R. 2008. Insider trading and prediction markets.Journal of Law, Economics, and Policy 4:449463.
Loewenstein, G. 1999. Experimental economics from the vantage-point of behavioural economics. The Economic Journal 109(453):2534.
Luckner, S., and Weinhardt, C. 2007. How to pay traders in information markets? Results from a field experiment.Journal of Prediction Markets 1(2):147156.
Othman, A., and Sandholm, T. 2010. Automated marketmaking in the large: the Gates-Hillman prediction market.In Proceedings of the 11th ACM Conference on Electronic Commerce, 367376.
Othman, A.; Sandholm, T.; Pennock, D.; and Reeves, D. 2010. A practical liquidity-sensitive automated market maker. In Proceedings of the 11th ACM Conference on Electronic Commerce, 377386.
Pennock, D., and Sami, R. 2007. Computational aspects of prediction markets. In Nisan, N.; Roughgarden, T.; Tardos, E.; and Vazirani, V. V., eds., Algorithmic Game Theory.Cambridge University Press.
Pennock, D. 2004. A dynamic pari-mutuel market for hedging, wagering, and information aggregation. In Proceedings of the 5th ACM Conference on Electronic Commerce, 170 179.
Servan-Schreiber, E.; Wolfers, J.; Pennock, D.; and Galebach, B. 2004. Prediction markets: Does money matter? Electronic Markets 14(3):243251.
Wolfers, J., and Zitzewitz, E. 2004a. Five open questions about prediction markets. Stanford GSB Working Paper.
Wolfers, J., and Zitzewitz, E. 2004b. Prediction markets.Journal of Economic Perspectives 18(2):107126.
-----0
Barrett, S., and Stone, P. 2012. An analysis framework for ad hoc teamwork tasks. In AAMAS 12.
Barrett, S.; Stone, P.; and Kraus, S. 2011. Empirical evaluation of ad hoc teamwork in the pursuit domain. In AAMAS 11.
Blum, A., and Mansour, Y. 2007. Learning, regret minimization, and equilibria.
Bowling, M., and McCracken, P. 2005. Coordination and adaptation in impromptu teams. In AAAI, 5358.
Brafman, R. I., and Tennenholtz, M. 1996. On partially controlled multi-agent systems. Journal of Artificial Intelligence Research 4:477507.
Conitzer, V., and Sandholm, T. 2007. AWESOME: A general multiagent learning algorithm that converges in selfplay and learns a best response against stationary opponents.Machine Learning 67.
Dai, W.; Yang, Q.; Xue, G.-R.; and Yu, Y. 2007. Boosting for transfer learning. In ICML 07, 193200.
Doshi, P., and Zeng, Y. 2009. Improved approximation of interactive dynamic influence diagrams using discriminative model updates. In AAMAS 09.
Gal, Y., and Pfeffer, A. 2008. Network of influence diagrams: Reasoning about agents beliefs and decisionmaking processes. Journal of Artificial Intelligence Research 33:109147.
Gelly, S., and Wang, Y. 2006. Exploration exploitation in Go: UCT for Monte-Carlo Go. In NIPS 06.
Gmytrasiewicz, P. J., and Doshi, P. 2005. A framework for sequential planning in multi-agent settings. Journal of Artificial Intelligence Research 24(1):4979.
Grosz, B. J., and Kraus, S. 1996. Collaborative plans for complex group action. Artificial Intelligence 86(2):269357.
Grosz, B., and Kraus, S. 1999. The evolution of sharedplans. In Rao, A., and Woolridge, M., eds., Foundations and Theories of Rational Agency, 227262.
Hall, M.; Frank, E.; Holmes, G.; Pfahringer, B.; Reutemann, P.; and Witten, I. H. 2009. The WEKA data mining software: an update. SIGKDD Explor. Newsl. 11:1018.
Horling, B.; Lesser, V.; Vincent, R.; Wagner, T.; Raja, A.; Zhang, S.; Decker, K.; and Garvey, A. 1999. The TAEMS White Paper.
Huang, P.; Wang, G.; and Qin, S. 2012. Boosting for transfer learning from multiple data sources. Pattern Recognition Letters 33(5):568  579.
Jones, E.; Browning, B.; Dias, M. B.; Argall, B.; Veloso, M. M.; and Stentz, A. T. 2006. Dynamically formed heterogeneous robot teams performing tightly-coordinated tasks.In ICRA, 570  575.
Kamishima, T.; Hamasaki, M.; and Akaho, S. 2009. TrBagg: A simple transfer learning method and its application to personalization in collaborative tagging. In Ninth IEEE International Conference on Data Mining, 219 228.
Kocsis, L., and Szepesvari, C. 2006. Bandit based MonteCarlo planning. In ECML 06.
Liemhetcharat, S., and Veloso, M. 2011. Modeling mutual capabilities in heterogeneous teams for role assignment. In IROS 11, 3638 3644.
Pardoe, D., and Stone, P. 2010. Boosting for regression transfer. In ICML 10.
Pynadath, D. V., and Tambe, M. 2002. The communicative multiagent team decision problem: Analyzing teamwork theories and models. Journal of Artificial Intelligence Research 16:389423.
Silver, D., and Veness, J. 2010. Monte-Carlo planning in large POMDPs. In NIPS 10.
Stone, P., and Veloso, M. 2000. Multiagent systems: A survey from a machine learning perspective. Autonomous Robots 8(3):345383.
Stone, P.; Kaminka, G. A.; Kraus, S.; and Rosenschein, J. S.2010. Ad hoc autonomous agent teams: Collaboration without pre-coordination. In AAAI 10.Tambe, M. 1997. Towards flexible teamwork. Journal of Artificial Intelligence Research 7:83124.
Wu, F.; Zilberstein, S.; and Chen, X. 2011. Online planning for ad hoc autonomous agent teams. In IJCAI.
Yao, Y., and Doretto, G. 2010. Boosting for transfer learning with multiple sources. In CVPR 10.
-----0
Achlioptas, D.; Beame, P.; and Molloy, M. 2001. A sharp threshold in proof complexity. In 33rd STOC, 337346.
Achlioptas, D.; Beame, P.; and Molloy, M. 2004. Exponential bounds for DPLL below the satisfiability threshold. In 15th SODA, 139140.
Audemard, G., and Simon, L. 2009. Predicting learnt clauses quality in modern SAT solvers. In 21st IJCAI, 399 404.
Balint, A.; Belov, A.; Jarvisalo, M.; and Sinz, C. 2012. SAT challenge.
Beame, P.; Kautz, H.; and Sabharwal, A. 2004. Understanding and harnessing the potential of clause learning. JAIR 22:319351.
Ben-Sasson, E., and Nordstrom, J. 2008. Short proofs may be spacious: An optimal separation of space and length in resolution. In FOCS, 709718.
Biere, A.; Heule, M. J. H.; van Maaren, H.; and Walsh, T., eds. 2009. Handbook of Satisfiability, volume 185 of Frontiers in Artificial Intelligence and Applications. IOS Press.
Biere, A. 2012. Plingeling: Solver description. SAT Challenge 2012.
Bloom, B.; Grove, D.; Herta, B.; Sabharwal, A.; Samulowitz, H.; and Saraswat, V. A. 2012. SatX10: A scalable plug&play parallel sat framework (tool presentation). In SAT, 463468.
Buss, S. R.; Hoffmann, J.; and Johannsen, J. 2008. Resolution trees with lemmas: Resolution renements that characterize DLL-algorithms with clause learning. Logical Methods in Computer Science 4(4):13.
Cook, S. A., and Reckhow, R. A. 1979. The relative efficiency of propositional proof systems. J. Symb. Logic 44(1):3650.
Gangal, D., and Ranade, A. G. 2008. Precedence constrained scheduling in (2? 7/(3p+1)) optimal. J. Comput.and Syst. Sc. 74(7):11391146.
Garey, M. R., and Johnson, D. S. 1979. Computers and Intractability: A Guide to the Theory of NP-Completeness.W.H. Freeman and Co., New York.
Hamadi, Y., and Wintersteiger, C. M. 2012. Seven challenges in parallel sat solving. In 26th AAAI.
Hertel, P.; Bacchus, F.; Pitassi, T.; and Gelder, A. V. 2008.Clause learning can effectively p-simulate general propositional resolution. In 23rd AAAI, 283290.
Jarvisalo, M.; Matsliah, A.; Nordstrom, J.; and Zivny, S.2012. Relating proof complexity measures and practical hardness of sat. In CP, 316331.
Jarvisalo, M.; Le Berre, D.; and Roussel, O. 2011. SAT competition.
Kozen, D. 1977. Lower bounds for natural proof systems. In Foundations of Computer Science, 1977., 18th Annual Symposium on, 254266. IEEE.
Lenstra, J. K., and Rinnooy Kan, A. 1978. Complexity of scheduling under precedence constraints. Operations Research 26:2235.
Pipatsrisawat, K., and Darwiche, A. 2011. On the power of clause-learning SAT solvers as resolution engines. AI J.175(2):512525.
Robinson, J. A. 1965. A machine oriented logic based on the resolution principle. Journal of the ACM 12(1):2341.
Roussel, O. 2012. ppfolio: Solver description. SAT Challenge 2012.Soos, M. 2012. CryptoMiniSat 2.9.2.http://www.msoos.org/cryptominisat2.
Urquhart, A. 2011. The depth of resolution proofs. Studia Logica 99(1-3):349364.
Wotzlaw, A.; van der Grinten, A.; Speckenmeyer, E.; and Porschen, S. 2012. pfolioUZK: Solver description. SAT Challenge 2012.
-----0
Aggoun, A., and Beldiceanu, N. 1993. Extending CHIP in order to Solve Complex Scheduling and Placement Problems. Mathl. Comput. Modelling 17(7):5773.
Barbieri, G.; Pachet, F.; Roy, P.; and Esposti, M. D. 2012.Markov constraints for generating lyrics with style. In ECAI, 115120.
Beldiceanu, N.; Carlsson, M.; Debruyne, R.; and Petit, T.2005. Reformulation of global constraints based on constraints checkers. Constraints 10(4):339362.
Bordeaux, L.; Katsirelos, G.; Narodytska, N.; and Vardi, M. Y. 2011. The complexity of integer bound propagation. J. Artif. Intell. Res. (JAIR) 40:657676.
Brooks, Jr., F. P.; Hopkins, Jr., A. L.; Neumann, P. G.; and Wright, W. V. 1992. An experiment in musical composition.Cambridge, MA, USA: MIT Press. 2340.
Conklin, D., and Witten, I. H. 1995. Multiple viewpoint systems for music prediction. Journal of New Music Research 24:5173.
Davismoon, S., and Eccles, J. 2010. Combining musical constraints with Markov transition probabilities to improve the generation of creative musical structures. EvoApplications 2:361370.
Demassey, S.; Pesant, G.; and Rousseau, L.-M. 2006.A cost-regular based hybrid column generation approach.Constraints 11(4):315333.
Khovanskii, A. 1992. Newton polyhedron, Hilbert polynomial, and sums of finite sets. Functional Analysis and Its Applications 26(4):276281.
Nierhaus, G. 2009. Algorithmic Composition, Paradigms of Automated Music Generation. Springer-Verlag.
Pachet, F., and Roy, P. 2011. Markov constraints: steerable generation of Markov sequences. Constraints 16(2).
Pachet, F.; Roy, P.; and Barbieri, G. 2011. Finite-length Markov processes with constraints. In IJCAI, 635642.
Paiement, J.-F.; Bengio, S.; Grandvalet, Y.; and Eck, D.2008. A generative model for rhythms. In Neural Information Processing Systems, Workshop on Brain, Music and Cognition.
Pesant, G. 2004. A regular language membership constraint for finite sequences of variables. In Wallace, M., ed., CP, volume 3258 of Lecture Notes in Computer Science, 482 495. Springer.
Petit, T.; Beldiceanu, N.; and Lorca, X. 2011. A generalized arc-consistency algorithm for a class of counting constraints.
In Walsh, T., ed., IJCAI, 643648. IJCAI/AAAI.Regin, J.-C. 1996. Generalized arc consistency for global cardinality constraint. In AAAI/IAAI, Vol. 1, 209215.
Zhang, Y., and Yap, R. H. C. 2000. Arc consistency on n-ary monotonic and linear constraints. In Dechter, R., ed., CP, volume 1894 of Lecture Notes in Computer Science, 470 483. Springer.
-----0
Barker, J. K., and Korf, R. E. 2012. Solving peg solitaire with bidirectional BFIDA. In AAAI.
Dechter, R., and Pearl, J. 1985. Generalized best-first search strategies and the optimality of A*. Journal of the Association for Computing Machinery 32(3):505536.
Dillenburg, J. F., and Nelson, P. C. 1994. Perimeter search.Artificial Intelligence 65(1):165178.
Felner, A.; Moldenhauer, C.; Sturtevant, N. R.; and Schaeffer, J. 2010. Single-frontier bidirectional search. In AAAI.
Hart, P. E.; Nilsson, N. J.; and Raphael, B. 1968. A formal basis for the heuristic determination of minimum cost paths. IEEE Transactions on Systems Science and Cybernetics SSC-4(2):100107.
Helmert, M. 2010. Landmark heuristics for the pancake problem. In Proceedings of the Third Symposium on Combinatorial Search.
Holte, R. C. 2010. Common misconceptions concerning heuristic search. In Proceedings of the Third Annual Symposium on Combinatorial Search, 4651.
Kaindl, H., and Kainz, G. 1997. Bidirectional heuristic search reconsidered. Journal of Artificial Intelligence Research 7:283317.
Korf, R., and Felner, A. 2002. Disjoint pattern database heuristics. Artificial Intelligence 134:922.
Korf, R. E.; Reid, M.; and Edelkamp, S. 2001. Time complexity of iterative-deepening-A*. Artificial Intelligence 129:199218.
Korf, R. E. 1985. Iterative-deepening-A*: An optimal admissible tree search. In Proceedings of the Ninth International Joint Conference on Artificial Intelligence, 1034 1036.
Likhachev, M.; Gordon, G.; and Thrun, S. 2003. ARA*: Anytime A* with provable bounds on sub-optimality. In Proceedings of the Seventeenth Annual Conference on Neural Information Processing Systems.
Lippi, M.; Ernandes, M.; and Felner, A. 2012. Efficient single frontier bidirectional search. In Proceedings of the Fifth Symposium on Combinatorial Search.
Lopez, C. L., and Junghanns, A. 2002. Perimeter search performance. In Computers and Games, 345359.
Manzini, G. 1995. BIDA: An improved perimeter search algorithm. Artificial Intelligence 75(2):347360.
Wilt, C., and Ruml, W. 2012. When does weighted A* fail? In Proceedings of the Fifth Symposium on Combinatorial Search.
-----0
Basu, S.; Davidson, I.; and Wagstaff, K., eds. 2008. Constrained clustering: Advances in algorithms, theory, and applications. Chapman & Hall/CRC.
Byrd, R. H.; Hribar, M. E.; and Nocedal, J. 1999. An interior point algorithm for large-scale nonlinear programming.SIAM Journal on Optimization 9(4):877900.
Chaovalitwongse, W. 2008. Novel quadratic programming approach for time series clustering with biomedical application. Journal of Combinatorial Optimization 15(3):225 241.
Coleman, T.; Saunderson, J.; and Wirth, A. 2008. Spectral clustering with inconsistent advice. In ICML 2008: Proc. of the 25th Intl. Conference on Machine Learning, 152159.
Coleman, T. F. 1994. Linearly constrained optimization and projected preconditioned conjugate gradients. In Proceedings of the Fifth SIAM Conference on Applied Linear Algebra, 118122. Philadelphia, PA: SIAM.
Golub, G. H., and van Loan, C. F. 1996. Matrix Computations. Johns Hopkins University Press.
Kamvar, S.; Klein, D.; and Manning, C. 2003. Spectral learning. In IJCAI 2003: Proc. of the 17th Intl. Joint Conference on Artificial Intelligence, 561566.Lang, K. 1995. Newsweeder: Learning to filter netnews. In ICML 1995: Proc. of the 12th Intl. Conference on Machine Learning, 331339.
Long, B.; Zhang, Z. M.; Wu, X.; and Yu, P. S. 2006. Spectral clustering for multi-type relational data. In ICML 2006: Proc. of the 23rd Intl. Conference on Machine Learning, 585592.
Long, B.; Zhang, Z.; and Yu, P. 2010. Relational Data Clustering: Models, Algorithms, and Applications. Chapman & Hall/CRC.
von Luxburg, U. 2007. A tutorial on spectral clustering. Statistics and Computing 17(4):395416.
Wagstaff, K.; Cardie, C.; Rogers, S.; and Schroedl, S. 2001.Constrained k-means clustering with background knowledge. In ICML 2001: Proc. 18th Intl. Conf. on Machine Learning, 577584.
Wang, X., and Davidson, I. 2010. Flexible constrained spectral clustering. In KDD 2010: Proc. 16th ACM SIGKDD Intl. Conf. on Knowledge Discovery and Data Mining, 563 572.
Wang, X.; Qian, B.; and Davidson, I. 2012. Improving document clustering using automated machine translation. In CIKM 2012: Proc. 21st ACM Intl. Conf. on Information and Knowledge Management, 645653.
-----0
Agarwal, S., and Roth, D. 2005. Learnability of bipartite ranking functions. In COLT, 1631.
Collins, M. 2000. Discriminative reranking for natural language parsing. In ICML, 175182.
Crammer, K.; Dekel, O.; Keshet, J.; Shalev-Shwartz, S.; and Singer, Y. 2006. Online passive-aggressive algorithms.JMLR 7:551585.
Dietterich, T. G.; Hild, H.; and Bakiri, G. 1995. A comparison of ID3 and backpropagation for english text-to-speech mapping. MLJ 18(1):5180.
Doppa, J. R.; Fern, A.; and Tadepalli, P. 2012. Output space search for structured prediction. In ICML.
Felzenszwalb, P. F., and McAllester, D. A. 2007. The generalized A* architecture. JAIR 29:153190.
Fern, A.; Yoon, S. W.; and Givan, R. 2006. Approximate policy iteration with a policy language bias: Solving relational Markov decision processes. JAIR 25:75118.
Fern, A. 2010. Speedup learning. In Encyclopedia of Machine Learning. 907911.
Grubb, A., and Bagnell, D. 2012. Speedboost: Anytime prediction with uniform near-optimality. JMLR Proceedings Track 22:458466.
Hal Daume III; Langford, J.; and Marcu, D. 2009. Searchbased structured prediction. MLJ 75(3):297325.
Hoffgen, K.-U.; Simon, H.-U.; and Horn, K. S. V. 1995.Robust trainability of single neurons. Journal of Computer and System Sciences 50(1):114125.
Jiang, J.; Teichert, A.; Daume III, H.; and Eisner, J. 2012.Learned prioritization for trading off accuracy and speed. In NIPS, 13401348.
Khardon, R. 1999. Learning to take actions. Machine Learning 35(1):5790.
Lafferty, J.; McCallum, A.; and Pereira, F. 2001. Conditional random fields: Probabilistic models for segmenting and labeling sequence data. In ICML, 441448.
Mohan, A.; Chen, Z.; and Weinberger, K. Q. 2011. Websearch ranking with initialized gradient boosted regression trees. JMLR Proceedings Track 14:7789.
Ross, S., and Bagnell, D. 2010. Efficient reductions for imitation learning. In AISTATS, 661668.
Ross, S.; Gordon, G.; and Bagnell, D. 2011. A reduction of imitation learning and structured prediction to no-regret online learning. In AISTATS, 627635.
Taskar, B.; Guestrin, C.; and Koller, D. 2003. Max-margin markov networks. In NIPS.
Tsochantaridis, I.; Hofmann, T.; Joachims, T.; and Altun, Y.2004. Support vector machine learning for interdependent and structured output spaces. In ICML.
Vogel, J., and Schiele, B. 2007. Semantic modeling of natural scenes for content-based image retrieval. IJCV 72(2):133157.
Weiss, D., and Taskar, B. 2010. Structured prediction cascades. In AISTATS, 916923.
Weiss, D.; Sapp, B.; and Taskar, B. 2010. Sidestepping intractable inference with structured ensemble cascades. In NIPS, 24152423.
Wick, M. L.; Rohanimanesh, K.; Singh, S.; and McCallum, A. 2009. Training factor graphs with reinforcement learning for efficient map inference. In NIPS, 20442052.
Wick, M. L.; Rohanimanesh, K.; Bellare, K.; Culotta, A.; and McCallum, A. 2011. Samplerank: Training factor graphs with atomic gradients. In ICML, 777784.
Xu, Y.; Fern, A.; and Yoon, S. 2009. Learning linear ranking functions for beam search with application to planning.JMLR 10:15711610.
Xu, Z.; Weinberger, K.; and Chapelle, O. 2012. The greedy miser: Learning under test-time budgets. In ICML.
-----0
Beck, A., and Teboulle, M. 2003. Mirror descent and nonlinear projected subgradient methods for convex optimization.Operations Research Letters.
Ben-Tal, A.; Margalit, T.; and Nemirovski, A. 2001. The ordered subsets mirror descent optimization method with applications to tomography. SIAM Journal of Optimization.
Bertsekas, D. P., and Tsitsiklis, J. N. 1996. Neuro-Dynamic Programming. Belmont, Massachusetts: Athena Scientific.
Bertsekas, D., and Yu, H. 2009. Basis function adaptation methods for cost approximation in Markov Decision Processes. In IEEE International Symposium on Adaptive Dynamic Programming and Reinforcement Learning.
Bertsekas, D. P. 1999. Nonlinear Programming. Athena Scientific, 2nd edition.
Borkar, V. 2008. Stochastic Approximation: A Dynamical Systems Viewpoint. Cambridge University Press.
Bregman, L. 1967. The relaxation method of finding the common point of convex sets and its application to the solution of problems in convex programming. USSR Computational Mathematics and Mathematical Physics 7(3):200  217.
Castro, D. D., and Mannor, S. 2010. Adaptive bases for Qlearning. In 49th IEEE Conference on Decision and Control.
Geist, M., and Scherrer, B. 2011. L1-penalized projected Bellman residual. In Proceedings of the European Workshop on Reinforcement Learning.
Gentile, C. 2003. The robustness of the p-norm algorithms.Mach. Learn. 53:265299.
Golub, G., and Pereyra, V. 1973. The differentiation of pseudo-inverses and nonlinear least squares problems whose variables separate. SIAM Journal of Numerical Analysis 10:41332.
Johns, J.; Painter-Wakefield, C.; and Parr, R. 2010. Linear complementarity for regularized policy evaluation and improvement. In Proceedings of Advances in Neural Information Processing Systems 23.
Kolter, J. Z., and Ng, A. Y. 2009. Regularization and feature selection in least-squares temporal difference learning. In Proceedings of the 26th Annual International Conference on Machine Learning, ICML 09, 521528. New York, NY, USA: ACM.
Konidaris, G.; Osentoski, S.; and Thomas, P. 2011. Value function approximation in reinforcement learning using the fourier basis. In Proceedings of the Twenty-Fifth Conference on Artificial Intelligence.
Lagoudakis, M., and Parr, R. 2003. Least-squares policy iteration. Journal of Machine Learning Research 4:1107 1149.
Liu, B.; Mahadevan, S.; and Liu, J. 2012. Regularized offpolicy TD-learning. In Neural Information Processing Systems Conference (NIPS).Mahadevan, S., and Liu, B. 2012. Reinforcement learning using mirror descent. In UAI 2012: Proceedings of the conference on Uncertainty in AI.
Mahadevan, S. 2008. Representation Discovery using Harmonic Analysis. Morgan and Claypool Publishers.Mahadevan, S. 2009. Learning Representation and Control in Markov Decision Processes: New Frontiers. Foundations and Trends in Machine Learning 1(4):403565.
Menache, N.; Shimkin, N.; and Mannor, S. 2005. Basis function adaptation in temporal difference reinforcement learning. Annals of Operations Research 134:215238.
Nemirovksi, A., and Yudin, D. 1983. Problem Complexity and Method Efficiency in Optimization. John Wiley Press.
Petrik, M.; Taylor, G.; Parr, R.; and Zilberstein, S. 2010.Feature selection using regularization in approximate linear programs for markov decision processes. In ICML, 871 878.
Shalev-Shwartz, S., and Tewari, A. 2011. Stochastic methods for l1 regularized loss minimization. Journal of Machine Learning Research.
Srebro, N.; Sridharan, K.; and Tewari, A. 2011. On the universality of online mirror descent. Arxiv preprint arXiv:1107.4080.
Sutton, R., and Barto, A. G. 1998. An Introduction to Reinforcement Learning. MIT Press.Watkins, C. 1989. Learning from Delayed Rewards. Ph.D.
Dissertation, Kings College, Cambridge, England.Zinkevich, M. 2003. Online convex programming and generalized infinitesimal gradient ascent. Proceedings of the International Conference on Machine Learning (ICML).
-----0
Abdulkadiroglu, A.; Pathak, P.; and Roth, A. 2009. Strategyproofness versus efficiency in matching with indifferences: Redesigning the NYC high school match. American Economic Review 99(5):19541978.
Abraham, D.; Levavi, A.; Manlove, D.; and OMalley, G.2007. The stable roommates problem with globally-ranked pairs. Internet and Network Economics 431444.
Abraham, D.; Blum, A.; and Sandholm, T. 2007. Clearing algorithms for barter exchange markets: Enabling nationwide kidney exchanges. In Proceedings of the 8th ACM Conference on Electronic Commerce, 295304.
Anshelevich, E., and Das, S. 2010. Matching, cardinal utility, and social welfare. ACM SIGECom Exchanges 9(1):4:1 4:7.
Anshelevich, E.; Chhabra, M.; Gerrior, M.; and Das, S.2012. On the social welfare of mechanisms for repeated batch matching. In Proceedings of the 11th International Conference on Autonomous Agents and Multiagent SystemsVolume 3, 13211322.
Anshelevich, E.; Das, S.; and Naamad, Y. 2013. Anarchy, stability, and utopia: Creating better matchings. Autonomous Agents and Multi-Agent Systems 26(1):120140.
Ashlagi, I.; Jaillet, P.; and Manshadi, V. H. 2013. Kidney exchange in dynamic sparse heterogenous pools. arXiv preprint arXiv:1301.3509.
Awasthi, P., and Sandholm, T. 2009. Online stochastic optimization in the large: Application to kidney exchange. In Proceedings of the 21st International Joint Conference on Artificial Intelligence, 405411.
Birnbaum, B., and Mathieu, C. 2008. On-line bipartite matching made simple. ACM SIGACT News 39:8087.
Delmonico, F. 2004. Exchanging kidneys-advances in living-donor transplantation. New England Journal of Medicine 350(18):18121814.
Dickerson, J.; Procaccia, A.; and Sandholm, T. 2012a. Dynamic matching via weighted myopia with application to kidney exchange. In Proceedings of the 26th AAAI Conference on Artificial Intelligence.
Dickerson, J.; Procaccia, A.; and Sandholm, T. 2012b. Optimizing kidney exchange with transplant chains: Theory and reality. In Proceedings of the 11th International Conference on Autonomous Agents and Multiagent Systems, 711718.
Epstein, L.; Levin, A.; Mestre, J.; and Segev, D. 2011. Improved approximation guarantees for weighted matching in the semi-streaming model. SIAM Journal on Discrete Mathematics 25(3):12511265.
Khuller, S.; Mitchell, S.; and Vazirani, V. 1994. On-line algorithms for weighted bipartite matching and stable marriages. Theoretical Computer Science 127:255267.
McGregor, A. 2005. Finding graph matchings in data streams. In Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques. Springer.170181.
Opelz, G., and Dohler, B. 2007. Effect of human leukocyte antigen compatibility on kidney graft survival: Comparative analysis of two decades. Transplantation 84(2):137.
Roth, A., and Peranson, E. 1999. The redesign of the matching market for American physicians: Some engineering aspects of economic design. American Economic Review 89(4):748780.
Roth, A. E., and Xing, X. 1994. Jumping the gun: Imperfections and institutions related to the timing of market transactions. American Economic Review 84(4):9921044.
Roth, A.; Sonmez, T.; and Unver, M. 2004. Kidney Exchange. Quarterly Journal of Economics 119(2):457488.
Saidman, S.; Roth, A.; Sonmez, T.; Unver, M.; and Delmonico, F. 2006. Increasing the opportunity of live kidney donation by matching for two-and three-way exchanges.Transplantation 81(5):773.
Su, X., and Zenios, S. 2005. Patient choice in kidney allocation: A sequential stochastic assignment model. Operations Research 53(3):443455.Unver, M. U. 2010. Dynamic kidney exchange. The Review of Economic Studies 77(1):372414.
Zenios, S.; Woodle, E.; and Ross, L. 2001. Primum non nocere: Avoiding harm to vulnerable wait list candidates in an indirect kidney exchange. Transplantation 72(4):648.
Zenios, S. 1996. Health care applications of optimal control theory. Ph.D. thesis, Operations Research Center, Massachussets Institute of Technology, Cambridge, MA.
-----0
Boutilier, C.; Caragiannis, I.; Haber, S.; Lu, T.; Procaccia, A. D.; and Sheffet, O. 2012. Optimal social choice functions: A utilitarian view. In Proceedings of the 13th ACM Conference on Electronic Commerce (EC), 197214.
Caragiannis, I., and Procaccia, A. D. 2011. Voting almost maximizes social welfare despite limited communication.
Artificial Intelligence 175(910):16551671.Caragiannis, I.; Covey, J. A.; Feldman, M.; Homan, C. M.; 
Kaklamanis, C.; Karanikolas, N.; Procaccia, A. D.; and Rosenschein, J. S. 2012. On the approximability of Dodgson and Young elections. Artificial Intelligence 187188:3151.
Caragiannis, I.; Kaklamanis, C.; Karanikolas, N.; and Procaccia, A. D. 2013. Socially desirable approximations for Dodgsons voting rule. ACM Transactions on Algorithms.Forthcoming.
Gibbard, A. 1973. Manipulation of voting schemes. Econometrica 41:587602.
Lev, O., and Rosenschein, J. S. 2012. Convergence of iterative voting. In Proceedings of the 11th International Joint Conference on Autonomous Agents and Multi-Agent Systems (AAMAS), 611618.
Lu, T., and Boutilier, C. 2011. Robust approximation and incremental elicitation in voting protocols. In Proceedings of the 22nd International Joint Conference on Artificial Intelligence (IJCAI), 287293.
Meir, R.; Polukarov, M.; Rosenschein, J. S.; and Jennings, N. R. 2010. Convergence to equilibria in plurality voting.
In Proceedings of the 24th AAAI Conference on Artificial Intelligence (AAAI), 823828.
Procaccia, A. D. 2010. Can approximation circumvent Gibbard-Satterthwaite? In Proceedings of the 24th AAAI Conference on Artificial Intelligence (AAAI), 836841.
Reyhani, R., and Wilson, M. C. 2012. Best reply dynamics for scoring rules. In Proceedings of the 20th European Conference on Artificial Intelligence (ECAI), 672677.
Roughgarden, T., and Tardos, E. 2002. How bad is selfish routing? Journal of the ACM 49(2):236259.
Satterthwaite, M. 1975. Strategy-proofness and Arrows conditions: Existence and correspondence theorems for voting procedures and social welfare functions. Journal of Economic Theory 10:187217.
Service, T. C., and Adams, J. A. 2012. Communication complexity of approximating voting rules. In Proceedings of the 11th International Joint Conference on Autonomous Agents and Multi-Agent Systems (AAMAS), 593602.
-----0
Cormen, T.; Leiserson, C.; Rivest, R.; and Stein, C. 2001.Introduction to Algorithms. MIT press.
Gent, I. P., and Walsh, T. 1992. The enigma of SAT hillclimbing procedures. Technical Report TR 605, University of Edinburgh, Department of Artificial Intelligence.
Gent, I. P., and Walsh, T. 1993a. An empirical analysis of search in GSAT. Journal of Artificial Intelligence Research 1:4759.
Gent, I. P., and Walsh, T. 1993b. Towards an understanding of hill-climbing procedures for SAT. In Proceedings of the Eleventh National Conference on Artificial Intelligence, 28 33. MIT Press.
Kautz, H.; Sabharwal, A.; and Selman, B. 2009. Incomplete algorithms. Handbook of Satisfiability, Frontiers in Artificial Intelligence and Applications 185:185204.
Kroc, L.; Sabharwal, A.; Gomes, C.; and Selman, B. 2009.Integrating systematic and local search paradigms: A new strategy for MaxSAT. In Proceedings of the 21st International Joint Conference on Artifical Intelligence, 544551.
Li, C.; Wei, W.; and Zhang, H. 2007. Combining adaptive noise and look-ahead in local search for SAT. Theory and Applications of Satisfiability TestingSAT 2007 121133.
McAllester, D.; Selman, B.; and Kautz, H. 1997. Evidence for invariants in local search. In Proceedings of the National Conference on Artificial Intelligence, 321326.
Schuurmans, D., and Southey, F. 2001. Local search characteristics of incomplete SAT procedures. Artificial Intelligence 132(2):121150.
Selman, B.; Kautz, H.; and Cohen, B. 1994. Noise strategies for improving local search. In Proceedings of the National Conference on Artificial Intelligence, 337337.
Selman, B.; Levesque, H.; and Mitchell, D. 1992. A new method for solving hard satisfiability problems. In Proceedings of the Tenth National Conference on Artificial intelligence, 440446.
Smyth, K.; Hoos, H. H.; and Stutzle, T. 2003. Iterated robust tabu search for MAX-SAT. In Proceedings of the 16th Conference of the Canadian Society for Computational Studies of Intelligence, 129144.
Tompkins, D., and Hoos, H. 2005. UBCSAT: An implementation and experimentation environment for SLS algorithms for SAT andMAX-SAT. In Revised Selected Papers from the Seventh International Conference on Theory and Applications of Satisfiability Testing, volume 3542 of Lecture Notes in Computer Science, 306320.
Tompkins, D.; Balint, A.; and Hoos, H. 2011. Captain Jack: New variable selection heuristics in local search for SAT.
Theory and Applications of Satisfiability Testing-SAT 2011 302316.
Whitley, D., and Chen, W. 2012. Constant Time Steepest Ascent Local Search with Statistical Lookahead for NKLandscapes. In GECCO 12: Proc. of the annual conference on Genetic and Evolutionary Computation Conference.
-----0
Barreto, A.; Precup, D.; and Pineau, J. 2011. Reinforcement learning using kernel-based stochastic factorization. In Advances in Neural Information Processing Systems 24, 720 728.
Bellman, R. 1957. Dynamic Programming. Princeton, NJ: Princeton University Press.
Boutilier, C.; Dearden, R.; and Goldszmidt, M. 1995. Exploiting structure in policy construction. In Proceedings of the 14th International Joint Conference on Artificial Intelligence, 11041111.
Ernst, D.; Geurts, P.; and Wehenkel, L. 2005. Tree-based batch mode reinforcement learning. Journal of Machine Learning Research 6:503556.
Fonteneau, R.; Murphy, S.; Wehenkel, L.; and Ernst, D.2013. Batch mode reinforcement learning based on the synthesis of artificial trajectories. Annals of Operations Research.
Guestrin, C.; Koller, D.; Parr, R.; and Venkataraman, S.2003. Efficient solution algorithms for factoredMDPs. Journal of Artificial Intelligence Research 19:399468.
Guestrin, C.; Koller, D.; and Parr, R. 2001. Max-norm projections for factored MDPs. In Proceedings of the 17th International Joint Conference on Artificial Intelligence, 673 682.
Jong, N., and Stone, P. 2006. Kernel-based models for reinforcement learning. In ICML 2006 Workshop on Kernel Methods and Reinforcement Learning.
Koller, D., and Parr, R. 1999. Computing factored value functions for policies in structured MDPs. In Proceedings of the 16th International Joint Conference on Artificial Intelligence, 13321339.
Kveton, B., and Theocharous, G. 2012. Kernel-based reinforcement learning on representative states. In Proceedings of the 26th AAAI Conference on Artificial Intelligence, 977 983.
Kveton, B.; Hauskrecht, M.; and Guestrin, C. 2006. Solving factored MDPs with hybrid state and action variables.Journal of Artificial Intelligence Research 27:153201.
Ormoneit, D., and Sen, S. 2002. Kernel-based reinforcement learning. Machine Learning 49:161178.
Puterman, M. 1994. Markov Decision Processes: Discrete Stochastic Dynamic Programming. New York, NY: John Wiley & Sons.
Sutton, R., and Barto, A. 1998. Reinforcement Learning: An Introduction. Cambridge, MA: MIT Press.
-----0
Amato, C., and Zilberstein, S. 2009. Achieving goals in decentralized POMDPs. In Proceedings of the Eighth International Conference on Autonomous Agents and Multiagent Systems, 593600.
Amato, C.; Bernstein, D.; and Zilberstein, S. 2007.Optimizing memory-bounded controllers for decentralized POMDPs. In Proc. UAI.
Banerjee, B.; Lyle, J.; Kraemer, L.; and Yellamraju, R.2012. Sample bounded distributed reinforcement learning for decentralized POMDPs. In Proceedings of the TwentySixth AAAI Conference on Artificial Intelligence (AAAI-12), 12561262.
Bernstein, D. S.; Givan, R.; Immerman, N.; and Zilberstein, S. 2002. The complexity of decentralized control of Markov decision processes. Mathematics of Operations Research 27:819840.
Brafman, R. I., and Tennenholtz, M. 2002. R-max A general polynomial time algorithm for near-optimal reinforcement learning. Journal of Machine Learning Research 3:213  231.
Browne, C.; Powley, E.; Whitehouse, D.; Lucas, S.; Cowling, P.; Rohlfshagen, P.; Tavener, S.; Perez, D.; Samothrakis, S.; and Colton, S. 2012. A survey of Monte Carlo tree search methods. IEEE Transactions on Computational Intelligence and AI in Games 4:143.
Emery-Montemerlo, R.; Gordon, G.; Schneider, J.; and Thrun, S. 2004. Approximate solutions for partially observable stochastic games with common payoffs. Autonomous Agents and Multiagent Systems, International Joint Conference on 1:136143.
Huang, J.; Liu, Z.; Lu, B.; and Xiao, F. 2010. Pruning in UCT algorithm. In Proc. Int. Conf. Tech. Applicat. Artif.Intell., 177181.
Kocsis, L., and Szepesvri, C. 2006. Bandit based montecarlo planning. In Proceedings of ECML-06, 282293.
Nair, R.; Tambe, M.; Yokoo, M.; Pynadath, D.; and Marsella, S. 2003. Taming decentralized POMDPs: Towards efficient policy computation for multiagent settings. In Proceedings of the 18th International Joint Conference on Artificial Intelligence (IJCAI-03), 705711.
Oliehoek, F. A.; Spaan, M. T. J.; Dibangoye, J. S.; and Amato, C. 2010. Heuristic search for identical payoff bayesian games. In Proceedings of the Ninth International Conference on Autonomous Agents and Multiagent Systems (AAMAS-10), 11151122.
Seuken, S., and Zilberstein, S. 2007. Improved memorybounded dynamic programming for decentralized POMDPs. In Proceedings of the Twenty-Third Conference on Uncertainty in Artificial Intelligence, 344351.
Spaan, M. T. J.; Oliehoek, F. A.; and Amato, C. 2011.Scaling up optimal heuristic search in Dec-POMDPs via incremental expansion. In Proceedings of the TwentySecond International Joint Conference on Artificial Intelligence (IJCAI-11), 20272032.
Sutton, R., and Barto, A. G. 1998. Reinforcement Learning: An Introduction. MIT Press.
Szer, D., and Charpillet, F. 2006. Point-based dynamic programming for dec-pomdps. In Proceedings of the 21st National Conference on Artificial Intelligence, 12331238.
Zhang, C., and Lesser, V. 2011. Coordinated multi-agent reinforcement learning in networked distributed POMDPs.In Proc. AAAI-11.
-----0
Aggarwal, C. C., ed. 2011. Social Network Data Analytics.Springer.
Bade, K., and Benz, D. 2009. Evaluation strategies for learning algorithms of hierarchies. In Proceedings of the 32nd Annual Conference of the German Classification Society (GfKl08).
Carlsson, G., and Memoli, F. 2010. Characterization, stability and convergence of hierarchical clustering methods. J.Mach. Learn. Res. 99:14251470.
Herlocker, J. L.; Konstan, J. A.; Borchers, A.; and Riedl, J.1999. An algorithmic framework for performing collaborative filtering. In Proceedings of the 22nd annual international ACM SIGIR conference on Research and development in information retrieval, SIGIR 99. ACM.
Kettenring, J. R. 2008. A Perspective on Cluster Analysis.Statistical Analysis and Data Mining 1(1):5253.
Mueller, M., and Kramer, S. 2010. Integer linear programming models for constrained clustering. In Pfahringer, B.; Holmes, G.; and Hoffmann, A., eds., Discovery Science, volume 6332. Springer Berlin Heidelberg. 159173.
Nakhleh, L.; Ringe, D.; and Warnow, T. 2002. Perfect phylogenetic networks : A new methodology for reconstructing the evolutionary history of natural languages. Networks 81(2):382420.
Nemhauser, G. L., and Wolsey, L. A. 1988. Integer and combinatorial optimization. Wiley.
Sibson, R. 1973. SLINK: an optimally efficient algorithm for the single-link cluster method. The Computer Journal 16(1):3034.
Sneath, P. H. A., and Sokal, R. R. 1973. Numerical taxonomy: the principles and practice of numerical classification.San Francisco, USA: Freeman.
Sokal, R. R., and Michener, C. D. 1958. A statistical method for evaluating systematic relationships. University of Kansas Science Bulletin 38:14091438.
Srensen, T. 1948. A method of establishing groups of equal amplitude in plant sociology based on similarity of species and its application to analyses of the vegetation on Danish commons. Biol. Skr. 5:134.
Tan, P.-N.; Steinbach, M.; and Kumar, V. 2005. Introduction to Data Mining, (First Edition). Boston, MA, USA: Addison-Wesley Longman Publishing Co., Inc.
-----0
Brafman, R. I. 1997. A heuristic variable grid solution method for POMDPs. In Proceedings of the Fourteenth National Conference on Artificial Intelligence and Ninth Conference on Innovative Applications of Artificial Intelligence, 727733.
Cassandra, A. R.; Kaelbling, L. P.; and Kurien, J. A. 1996.Acting under uncertainty: Discrete Bayesian models for mobile-robot navigation. In Proceedings of IEEE/RSJ International Conference on Intelligent Robots and Systems, 963972.
Cassandra, A. R. 1998. Exact and Approximate Algorithms for Partially Observable Markov Decision Processes. Ph.D.Dissertation, Brown University, Department of Computer Science, Providence, RI.
Du, Y.; Hsu, D.; Kurniawati, H.; Lee, W. S.; Ong, S. C.; and Png, S. W. 2010. A POMDP approach to robot motion planning under uncertainty. In International Conference on Automated Planning & Scheduling, Workshop on Solving Real-World POMDP Problems.
Golovin, D.; Krause, A.; and Ray, D. 2010. Near-optimal Bayesian active learning with noisy observations. CoRR abs/1010.3091.
He, R.; Brunskill, E.; and Roy, N. 2010. PUMA: Planning under uncertainty with macro-actions. In Proceedings of the Twenty-Fourth Conference on Artificial Intelligence (AAAI).
Kaplow, R.; Atrash, A.; and Pineau, J. 2010. Variable resolution decomposition for robotic navigation under a POMDP framework. In Proceedings of the International Conference on Robotics and Automation.
Khalvati, K., and Mackworth, A. K. 2012. Active robot localization with macro actions. In Intelligent Robots and Systems (IROS), 2012 IEEE/RSJ International Conference on, 187 193.
Kurniawati, H.; Du, Y.; Hsu, D.; and Lee, W. S. 2011. Motion planning under uncertainty for robotic tasks with long time horizons. International Journal of Robotics Research 30:308323.
Kurniawati, H.; Hsu, D.; and Lee, W. S. 2008. SARSOP: Efficient point-based POMDP planning by approximating optimally reachable belief spaces. In Proceedings of Robotics: Science and Systems.
Littman, M. L.; Cassandra, A. R.; and Kaelbling, L. P.1995. Learning policies for partially observable environments: Scaling up. In Proceedings of the Twelfth International Conference on Machine Learning.
Pineau, J.; Gordon, G.; and Thrun, S. 2006. Anytime pointbased approximations for large POMDPs. Journal of Artificial Intelligence Research 27.
Poon, K. M. 2001. A fast heuristic algorithm for decisiontheoretic planning. Masters thesis, The Hong Kong University of Science and Technology.
Ross, S.; Pineau, J.; Paquet, S.; and Chaib-draa, B. 2008.Online planning algorithms for POMDPs. Journal of Artificial Intelligence Research.
Roy, N., and Gordon, G. 2003. Exponential family PCA for belief compression in POMDPs. In Neural Information Processing Systems (NIPS), 10431049. MIT Press.
Silver, D., and Veness, J. 2010. Monte-carlo planning in large pomdps. In In Advances in Neural Information Processing Systems 23, 21642172.
Smith, T., and Simmons, R. G. 2004. Heuristic search value iteration for POMDPs. In Proceedings of International Conference on Uncertainty in Artificial Intelligence (UAI).
Thrun, S.; Burgard, W.; and Fox, D. 2005. Probabilistic Robotics. Cambridge, MA,: MIT Press.
Viswanathan, P.; Little, J. J.; Mackworth, A. K.; and Mihailidis, A. 2011. Navigation and obstacle avoidance help (NOAH) for older adults with cognitive impairment: a pilot study. In The proceedings of the 13th international ACM SIGACCESS conference on Computers and accessibility, ASSETS 11, 4350.
-----0
Aine, S., and Likhachev, M. 2013. Truncated LPA* : The Proofs. Technical Report TR-12-32, Carnegie Mellon University, Pittsburgh, PA.
Ferguson, D., and Stentz, A. 2006. Using interpolation to improve path planning: The field D* algorithm. J. Field Robotics 23(2):79101.
Fox, M.; Gerevini, A.; Long, D.; and Serina, I. 2006. Plan Stability: Replanning versus Plan Repair. In Long, D.; 
Smith, S. F.; Borrajo, D.; and McCluskey, L., eds., ICAPS, 212221. AAAI.
Gerevini, A., and Serina, I. 2000. Fast Plan Adaptation through Planning Graphs: Local and Systematic Search 
Techniques. In Chien, S.; Kambhampati, S.; and Knoblock, C. A., eds., AIPS, 112121. AAAI.
Gerevini, A.; Saetti, A.; and Serina, I. 2003. Planning Through Stochastic Local Search and Temporal Action Graphs in LPG. J. Artif. Intell. Res. (JAIR) 20:239290.
Hart, P. E.; Nilsson, N. J.; and Raphael, B. 1968. A formal basis for the heuristic determination of minimum cost paths. IEEE Transactions on Systems Science and Cybernetics 4(2):100107.
Koenig, S., and Likhachev, M. 2002. D* Lite. In Dechter, R., and Sutton, R. S., eds., AAAI/IAAI, 476483. AAAI Press / The MIT Press.
Koenig, S., and Likhachev, M. 2005. Adaptive A*. In Dignum, F.; Dignum, V.; Koenig, S.; Kraus, S.; Singh, M. P.; and Wooldridge, M., eds., AAMAS, 13111312. ACM.
Koenig, S.; Likhachev, M.; and Furcy, D. 2004. Lifelong Planning A*. Artif. Intell. 155(1-2):93146.
Likhachev, M., and Ferguson, D. 2009. Planning Long Dynamically Feasible Maneuvers for Autonomous Vehicles. I.J. Robotic Res. 28(8):933945.
Likhachev, M., and Koenig, S. 2005. A Generalized Framework for Lifelong Planning A* Search. In Biundo, S.; Myers, K. L.; and Rajan, K., eds., ICAPS, 99108. AAAI.
Likhachev, M.; Ferguson, D.; Gordon, G. J.; Stentz, A.; and Thrun, S. 2008. Anytime search in dynamic graphs. Artif.Intell. 172(14):16131643.
Pohl, I. 1970. Heuristic Search Viewed as Path Finding in a Graph. Artif. Intell. 1(3):193204.
Ramalingam, G., and Reps, T. W. 1996. An Incremental Algorithm for a Generalization of the Shortest-Path Problem.J. Algorithms 21(2):267305.
Stentz, A. 1995. The Focussed D* Algorithm for Real-Time Replanning. In IJCAI, 16521659. Morgan Kaufmann.
Sun, X., and Koenig, S. 2007. The Fringe-Saving A* Search Algorithm A Feasibility Study. In Veloso, M. M., ed., IJCAI, 23912397.
Sun, X.; Koenig, S.; and Yeoh, W. 2008. Generalized Adaptive A*. In Padgham, L.; Parkes, D. C.; Muller, J. P.; and 
Parsons, S., eds., AAMAS (1), 469476. IFAAMAS.Trovato, K. I., and Dorst, L. 2002. Differential A*.IEEE Transactions on Knowledge and Data Engineering 14(6):12181229.
-----0
Billings, D., and Kan, M. 2006. A tool for the direct assessment of poker decisions. International Computer Games Association Journal.
DAloisio, T. 2010. Insider trading and market manipulation. Retrieved May 30, 2012 from: http://www.asic.gov.au/asic/pdflib.nsf/LookupByFileName/ speech-insider-trading-market-manipulation-August 2010.pdf/$file/speech-insider-trading-market-manipulationAugust-2010.pdf.
Ganzfried, S.; Sandholm, T.; and Waugh, K. 2012. Strategy purification and thresholding: Effective non-equilibrium approaches for playing large games. In Proceedings of the 11th International Conference on Autonomous Agents and Multiagent Systems, AAMAS 12.
Graham, D. A., and Marshall, R. C. 1987. Collusive bidder behavior at single-object second-price and english auctions.Journal of Political Economy 95(6):121739.
Hendricks, K., and Porter, R. H. 1989. Collusion in auctions.Annales dEconomie et de Statistique 217230.
Johanson, M.; Bard, N.; Lanctot, M.; Gibson, R.; and Bowling, M. 2012. Efficient nash equilibrium approximation through monte carlo counterfactual regret minimization. In Proceedings of the Eleventh International Conference on Autonomous Agents and Multi-Agent Systems (AAMAS).
Johansson, U.; Sonstrod, C.; and Konig, R. 2003. Cheating by sharing informationthe doom of online poker. Proceedings of the 2nd International Conference on Application and Development of Computer Games 1622.
Joseph E. Harrington, J. 2008. Detecting cartels. Handbook in Antitrust Economics.
Klemperer, P. 2002. What really matters in auction design.Journal of Economic Perspectives 16(1):169189.
Kocsis, L., and Gyorgy, A. 2010. Fraud detection by generating positive samples for classification from unlabeled data.In ICML 2010 Workshop on Machine Learning and Games.
Laasonen, J.; Knuutila, T.; and Smed, J. 2011. Eliciting collusion features. In Proceedings of the 4th International ICST Conference on Simulation Tools and Techniques, SIMU
Tools 11, 296303. ICST, Brussels, Belgium, Belgium: ICST (Institute for Computer Sciences, Social-Informatics and Telecommunications Engineering).
McAfee, R. P., and McMillan, J. 1992. Bidding rings. American Economic Review 82(3):57999.
McCormack, A., and Griffiths, M. 2012. What differentiates professional poker players from recreational poker players? a qualitative interview study. International Journal of Mental Health and Addiction 10(2):243257.
Osborne, M. J., and Rubinstein, A. 1994. A course in game theory. MIT Press.PokerStars. 2012. Data privacy for our poker software: Collusion. Retrieved May 30, 2012 from: http://www.pokerstars.com/poker/room/features/security/.
Porter, R. H., and Zona, J. D. 1993. Detection of bid rigging in procurement auctions. Journal of Political Economy 101(3):pp. 518538.
Risk, N. A., and Szafron, D. 2010. Using counterfactual regret minimization to create competitive multiplayer poker agents. In Proceedings of the 9th International Conference on Autonomous Agents and Multiagent Systems: volume 1 Volume 1, AAMAS 10, 159166. Richland, SC: International Foundation for Autonomous Agents and Multiagent Systems.
Robinson, M. S. 1985. Collusion and the choice of auction.The RAND Journal of Economics 16(1):pp. 141145.
Smed, J.; Knuutila, T.; and Hakonen, H. 2006. Can we prevent collusion in multiplayer online games? In Proceedings of the Ninth Scandinavian Conference on Artificial Intelligence 2006, 168175.
Smed, J.; Knuutila, T.; and Hakonen, H. 2007. Towards swift and accurate collusion detection. Security.
Watson, M. J. 2012. The regulation of capital markets: Market manipulation and insider trading. Retrieved May 30, 2012 from: www.icclr.law.ubc.ca/Publications/Reports/wats pap.pdf.
Waugh, K.; Schnizlein, D.; Bowling, M.; and Szafron, D. 2009. Abstraction pathologies in extensive games. In Proceedings of the Eighth International Conference on Autonomous Agents and Multi-Agent Systems (AAMAS), 781 788.White, M., and Bowling, M. 2009. Learning a value analysis tool for agent evaluation. In Proceedings of the Twenty-First International Joint Conference on Artificial Intelligence (IJCAI), 19761981.
Yampolskiy, R. V. 2008. Detecting and controlling cheating in online poker. In 2008 5th IEEE Consumer Communications and Networking Conference, 848853. Ieee.
Yan, J. 2010. Collusion detection in online bridge. In Proceedings of the Twenty-Fourth AAAI Conference on Artificial Intelligence (AAAI).
Zinkevich, M.; Bowling, M.; Bard, N.; Kan, M.; and Billings, D. 2006. Optimal unbiased estimators for evaluating agent performance. In Proceedings of the Twenty-First National Conference on Artificial Intelligence (AAAI), 573 578.
Zinkevich, M.; Johanson, M.; Bowling, M.; and Piccione, C. 2008. Regret minimization in games with incomplete information. In Advances in Neural Information Processing Systems 20 (NIPS), 905912. A longer version is available as a University of Alberta Technical Report, TR07-14.
-----0
Bertsekas, D. P. 2003. Nonlinear Programming. Athena Scientific.
Bertsimas, D. P., and Weismantel, R. 2005. Optimization Over Integers. Belmont, Massachusetts: Dynamic Ideas.Billsus, D., and Pazzani, M. J. 1998. Learning collaborative information filters. In Proceedings of the Fifteenth International Conference on Machine Learning, 4654.
Bishop, C. M. 1999. Bayesian pca. In Proceedings of the 1998 conference on Advances in Neural Information Processing Systems, 382388.
Breese, J. S.; Heckerman, D.; and Kadie, C. 1998. Empirical analysis of predictive algorithms for collaborative filtering.
In Proceedings of the Fourteenth conference on Uncertainty in artificial intelligence, 4352.
Cai, J.; Candes, E. J.; and Shen, Z. 2010. A singular value thresholding algorithm for matrix completion. SIAM Journal on Optimization 20(4):19561982.
Candes, E. J., and Recht, B. 2009. Exact matrix completion via convex optimization. Foundations of Computational Mathematics 9(6):717772.
Chistov, A. L., and Grigoriev, D. Y. 1984. Complexity of quantifier elimination in the theory of algebraically closed fields. Mathematical Foundations of Computer Science, volume 176 of Lecture Notes in Computer Science 1731.
Collins, M.; Dasgupta, S.; and Schapire, R. E. 2001. A generalization of principal component analysis to the exponential family. In Proceedings of Advances in Neural Information Processing Systems, 617624.
de Brevern, A. G.; Hazout, S.; and Malpertuy, A. 2004. Influence of microarrays experiments missing values on the stability of gene groups by hierarchical clustering. BMC Bioinformatics 5(114).
Dewester, S.; Dumains, S.; Landauer, T.; Furnas, G.; and Harshman, R. 1990. Indexing by latent semantic analysis.Journal of the Society for Information Science 41(6):391 407.
Fazel, M. 2002. Matrix rank minimization with applications.Hofmann, T. 2001. Learning what people (dont) want. In Proceedings of the 12th European Conference on Machine Learning, 214225.
Ji, S., and Ye, J. 2009. An accelerated gradient method for trace norm minimization. In Proceedings of the 26th Annual International Conference on Machine Learning, 457464.
Larsen, R. M. 2005. Propackcsoftware for large and sparse svd calculations. available online. url http://sun. stanford.edu/rmunk/propack.
Marlin, B. 2003. Modeling user rating profiles for collaborative filtering. In Proceedings of advances in Neural Information Processing Systems, 627634.
Nie, F.; Wang, H.; Cai, X.; Huang, H.; and Ding, C. 2012.Robust matrix completion via joint schatten p-norm and lpnorm minimization. In IEEE 12th International Conference on Data Mining (ICDM), 566574.
Nie, F.; Huang, H.; and Ding, C. 2012. Efficient schatten-p norm minimization for low-rank matrix recovery. In TwentySixth AAAI Conference on Artificial Intelligence (AAAI), 655661.
Oba, S.; Sato, M.; Takemasa, I.; Monden, M.; Matsubara, K.; and Ishii, S. 2003. A bayesian missing value estimation method. Bioinformatics 19(16):20882096.
Rennie, J. D., and Srebro, N. 2005. Fast maximum margin matrix factorization for collaborative prediction. In Proceedings of the 22nd international conference on Machine learning, 713719.
Salakhutdinov, R., and Mnih, A. 2008. Bayesian probabilistic matrix factorization using markov chain monte carlo. In Proceedings of the 25th International Conference on Machine learning, 880887.
Srebro, N., and Jaakkola, T. 2003. Weighted low-rank approximations. In Proceeding of 20th International Conference on Machine Learning, 720727.
Stark, C.; Breitkreutz, B. J.; Reguly, T.; Boucher, L.; Breitkreutz, A.; and Tyers, M. 2006. Biogrid: a general reprository for interaction datasets. Nucleic Acids Res. 34(Database Issue).
-----0
Atkeson, C., Moore, A., and Schaal, S. 1997. Locally Weighted  Learning. AI Review 11. 11-73.  
Forbus, K. D. 1980. Spatial and Qualitative Aspects of Reasoning  about Motion. Proceedings of 1st Proceedings of the 1st Annual  National Conference on Artificial Intelligence.  
Forbus, K. D., Nielsen, P. and Faltings, B. 1991. Qualitative  Spatial Reasoning: The CLOCK Project. Artificial Intelligence  51, p 417-471.  
Hastie, T., Tibshirani, R. and Friedman, J. 2001. The Elements of  Statistical Learning. New York: Springer-Verlag.  
Kuipers, B. 1994. Modeling and Simulation With Incomplete  Knowledge. MIT Press.  
Lembcke, S. 2013. Chipmunk Physics Engine. Version 6.1.2.  Available from http://chipmunk-physics.net.  
Nguyen-Tuong, D.; Peters, J. 2011. Model Learning in Robotics:  a Survey. Cognitive Processing, 12, 4.  
Potts, D. 2005. Incremental Learning of Linear Model Trees.  Machine Learning 61.  Quilan, R. 1990. Learning Logical Definitions from Relations.  Machine Learning 5, p. 239-266.  
Paoletti, S., Juloski, A., Ferrari-Trecate, G. and Vidal, R. 2007.  Identification of Hybrid Systems: A Tutorial. European Journal of  Control, vol. 13, p. 242-260.  
Tax, D. and Duin, R. 2002. Using Two-Class Classifiers for  Multiclass Classification. Proceedings of the 16th International  Conference on Pattern Recognition.   
Toussaint, M., and Vijayakumar, S. 2005. Learning Discontinuities with Products-of-Sigmoids for Switching between  Local Models. Proceedings of the 22nd International Conference  on Machine Learning, p. 904-911.  
Troha, M. and Bratko, I. 2011. Qualitative Learning of Object  Pushing by a Robot. Working papers of the 25th International  Workshop on Qualitative Reasoning.  
-----0
Aberer, K.; Sathe, S.; Chakraborty, D.; Martinoli, A.; Barrenetxea, G.; Faltings, B.; and Thiele, L. 2010.Opensense: Open community driven sensing of environment. In ACM SIGSPATIAL International Workshop on GeoStreaming (IWGS), 3942.
Campbell, J. E. 1996. Polls and votes: The trial-heat presidential election forecasting model, certainty, and political campaigns. American Politics Quarterly 24(4):408433.
Faltings, B.; Jurca, R.; and Li, J. J. 2012. Eliciting truthful measurements from a community of sensors. In Proceedings of the Third International Conference on the Internet of Things, 5118.
Gneiting, T., and Raftery, A. E. 2007. Strictly proper scoring rules, prediction, and estimation. Journal of the American Statistical Association 102:359378.
Jurca, R., and Faltings, B. 2006. Minimum payments that reward honest reputation feedback. In Proceedings of the 7th ACM Conference on Electronic Commerce (EC06), 190 199.
Jurca, R., and Faltings, B. 2007. Robust incentivecompatible feedback payments. In Agent-Mediated Electronic Commerce, volume LNAI 4452, 204218. SpringerVerlag.
Jurca, R., and Faltings, B. 2011. Incentives for answering hypothetical questions. In Workshop on Social Computing and User Generated Content (EC-11).
Lambert, N., and Shoham, Y. 2009. Eliciting truthful answers to multiple-choice questions. In Proceedings of the tenth ACM conference on Electronic Commerce, 109118.
Miller, N.; Resnick, P.; and Zeckhauser, R. 2005. Eliciting informative feedback: The peer-prediction method. Management Science 51:13591373.
Prelec, D., and Seung, S. 2006. An algorithm that finds truth even if most people are wrong. Working paper.
Prelec, D. 2004. A bayesian truth serum for subjective data.Science 34(5695):462466.
Savage, L. J. 1971. Elicitation of personal probabilities and expectations. Journal of the American Statistical Association 66(336):783801.
Surowiecki, J. 2005. The Wisdom of Crowds. Anchor.Witkowski, J., and Parkes, D. C. 2012a. Peer prediction without a common prior. In Proceedings of the 13th ACM Conference on Electronic Commerce (EC 12), 964981.
Witkowski, J., and Parkes, D. C. 2012b. A robust bayesian truth serum for small populations. In Proceedings of the 26th AAAI Conference on Artificial Intelligence (AAAI12).
-----0
Adams, B.; Banks, H.; Kwon, H.-D.; and Tran, H. 2004. Dynamic multidrug therapies for HIV: Optimal and STI control approaches. In Mathematical Biosciences and Engineering, volume 1, 223  241.
Brunskill, E.; Leffler, B.; Li, L.; Littman, M.; and Roy, N. 2009. Provably efficient learning with typed parametric models. The Journal of Machine Learning Research 10:19551988.
Busoniu, L.; Munos, R.; Schutter, B. D.; and Babuska, R.2011. Optimistic planning for sparsely stochastic systems. In IEEE International Symposium on Adaptive Dynamic Programming and Reinforcement Learning.
Ernst, D.; Stan, G.-B.; Goncalves, J.; and Wehenkel, L.2006. Clinical data based optimal STI strategies for HIV; a reinforcement learning approach. In Machine Learning Conference of Belgium and The Netherlands (Benelearn), 6572.
Jong, N., and Stone, P. 2007. Model-based exploration in continuous state spaces. Abstraction, Reformulation, and Approximation 258272.
Kakade, S.; Kearns, M. J.; and Langford, J. 2003. Exploration in metric state spaces. In ICML, 306312.
Kakade, S. M. 2003. On the sample complexity of reinforcement learning. Ph.D. Dissertation, Gatsby Computational Neuroscience Unit, University College London.
Kearns, M. J., and Singh, S. P. 2002. Near-optimal reinforcement learning in polynomial time. Machine Learning 49(2-3):209232.
Kolter, J. Z., and Ng, A. Y. 2009. Near-bayesian exploration in polynomial time. In ICML 09, 513520.
Li, L. 2009. A unifying framework for computational reinforcement learning theory. Ph.D. Dissertation, Rutgers University, New Brunswick, NJ, USA. AAI3386797.
Moldovan, T. M., and Abbeel, P. 2012. Safe exploration in Markov decision processes. CoRR abs/1205.4810.
Nouri, A., and Littman, M. 2008. Multi-resolution exploration in continuous spaces. Advances in neural information processing systems 21:12091216.
Strehl, A. L., and Littman, M. L. 2005. A theoretical analysis of model-based interval estimation. In ICML 05, 856 863. New York, NY, USA: ACM.
Strehl, A., and Littman, M. 2008. Online linear regression and its application to model-based reinforcement learning. Advances in Neural Information Processing Systems 20:14171424.
Strehl, A. L.; Li, L.; Wiewiora, E.; Langford, J.; and Littman, M. L. 2006. PAC model-free reinforcement learning. In ICML, 881888.
Szita, I., and Szepesvari, C. 2010. Model-based reinforcement learning with nearly tight exploration complexity bounds. In ICML, 10311038.
Williams, R., and Baird, L. 1993. Tight performance bounds on greedy policies based on imperfect value functions. Technical report, Northeastern University, College of Computer Science.
-----0
Barbu, A.; Bridge, A.; Burchill, Z.; Coroian, D.; Dickinson, S.; Fidler, S.; Michaux, A.; Mussman, S.; Narayanaswamy, S.; Salvi, D.; et al. 2012. Video in sentences out. In UAI, 10212.
Chang, C., and Lin, C. 2011. Libsvm: a library for support vector machines. ACM Transactions on Intelligent Systems and Technology (TIST) 2(3):27.
Chen, S., and Goodman, J. 1999. An empirical study of smoothing techniques for language modeling. Computer Speech & Language 13(4):359393.
Chen, D.; Dolan, W.; Raghavan, S.; Huynh, T.; Mooney, R.; Blythe, J.; Hobbs, J.; Domingos, P.; Kate, R.; Garrette, D.; et al. 2010. Collecting highly parallel data for paraphrase evaluation. JAIR 37:397435.
De Marneffe, M.; MacCartney, B.; and Manning, C. 2006.Generating typed dependency parses from phrase structure parses. In Proceedings of LREC, volume 6, 449454.
Ding, D.; Metze, F.; Rawat, S.; Schulam, P.; Burger, S.; Younessian, E.; Bao, L.; Christel, M.; and Hauptmann, A.2012. Beyond audio and video retrieval: towards multimedia summarization. In Proceedings of the 2nd ACM International Conference on Multimedia Retrieval, 2. ACM.
Farhadi, A.; Hejrati, M.; Sadeghi, M.; Young, P.; Rashtchian, C.; Hockenmaier, J.; and Forsyth, D. 2010. Every picture tells a story: Generating sentences from images. Computer VisionECCV 2010 1529.
Felzenszwalb, P.; McAllester, D.; and Ramanan, D. 2008. A discriminatively trained, multiscale, deformable part model.In Computer Vision and Pattern Recognition, 2008. CVPR 2008. IEEE Conference on, 18. IEEE.
Khan, M., and Gotoh, Y. 2012. Describing video contents in natural language. EACL 2012 27.
Kojima, A.; Tamura, T.; and Fukunaga, K. 2002. Natural language description of human activities from video images based on concept hierarchy of actions. International Journal of Computer Vision 50(2):171184.
Kulkarni, G.; Premraj, V.; Dhar, S.; Li, S.; Choi, Y.; Berg, A.; and Berg, T. 2011. Baby talk: Understanding and generating simple image descriptions. In CVPR, 16011608. IEEE.
Laptev, I., and Perez, P. 2007. Retrieving actions in movies.In Computer Vision, 2007. ICCV 2007. IEEE 11th International Conference on, 18. IEEE.
Laptev, I.; Marszalek, M.; Schmid, C.; and Rozenfeld, B.2008. Learning realistic human actions from movies. In CVPR, 18. IEEE.
Lee, M.; Hakeem, A.; Haering, N.; and Zhu, S. 2008. Save: A framework for semantic annotation of visual events. In CVPRW, 18. IEEE.
Li, L.; Su, H.; Xing, E.; and Fei-Fei, L. 2010. Object bank: A high-level image representation for scene classification and semantic feature sparsification. Advances in Neural Information Processing Systems 24.
Li, S.; Kulkarni, G.; Berg, T.; Berg, A.; and Choi, Y. 2011.Composing simple image descriptions using web-scale ngrams. In Proceedings of the Fifteenth Conference on Computational Natural Language Learning, 220228. Association for Computational Linguistics.
Lin, Y.; Michel, J.; Aiden, E.; Orwant, J.; Brockman, W.; and Petrov, S. 2012. Syntactic annotations for the google books ngram corpus. In Proceedings of the 50th Annual Meeting of the Association for Computational Linguistics.
Motwani, T., and Mooney, R. 2012. Improving video activity recognition using object recognition and text mining. ECAI.
Ordonez, V.; Kulkarni, G.; and Berg, T. 2011. Im2text: Describing images using 1 million captioned photographs. In Proceedings of NIPS.
Packer, B.; Saenko, K.; and Koller, D. 2012. A combined pose, object, and feature model for action understanding. In CVPR, 13781385. IEEE.
Pauls, A., and Klein, D. 2011. Faster and smaller n-gram language models. In Proceedings of the 49th annual meeting of the Association for Computational Linguistics: Human Language Technologies, volume 1, 258267.
Pedersen, T.; Patwardhan, S.; and Michelizzi, J. 2004. Wordnet:: Similarity: measuring the relatedness of concepts. In Demonstration Papers at HLT-NAACL 2004, 3841. Association for Computational Linguistics.
Reddy, K., and Shah, M. 2012. Recognizing 50 human action categories of web videos. Machine Vision and Applications 111.
Schuldt, C.; Laptev, I.; and Caputo, B. 2004. Recognizing human actions: A local SVM approach. In Pattern Recognition, 2004. ICPR 2004. Proceedings of the 17th International Conference on, volume 3, 3236. IEEE.
Wang, H.; Klaser, A.; Schmid, C.; and Liu, C.-L. 2011.Action recognition by dense trajectories. In CVPR, 3169 3176. IEEE.
Yang, Y.; Teo, C. L.; Daume, III, H.; and Aloimonos, Y.2011. Corpus-guided sentence generation of natural images.
In EMNLP, EMNLP 11, 444454. Association for Computational Linguistics.
Yao, B., and Fei-Fei, L. 2010. Modeling mutual context of object and human pose in human-object interaction activities.In CVPR.
Yao, B.; Yang, X.; Lin, L.; Lee, M.; and Zhu, S. 2010. I2t: Image parsing to text description. Proceedings of the IEEE 98(8):14851508.
Zhang, J.; Marsza?ek, M.; Lazebnik, S.; and Schmid, C. 2007.Local features and kernels for classification of texture and object categories: A comprehensive study. International Journal of Computer Vision 73(2):213238.
-----0
Aberdeen, D.; Buffet, O.; and Thomas, O. 2007. Policygradients for PSRs and POMDPs. In AISTATS.
Boots, B.; Siddiqi, S.; and Gordon, G. 2010. Closing the learning-planning loop with predictive state representations.In Proceedings of Robotics: Science and Systems.
Capitan, J.; Merino, L.; and Ollero, A. 2011. Multirobot coordinated decision making under mixed observability through decentralized data fusion. In Proceedings of the 11th International Conference on Mobile Robots and Competitions (Robotica 2011).
Chades, I.; Carwardine, J.; Martin, T. G.; Nicol, S.; Sabbadin, R.; and Buffer, O. 2012. MOMDPs: a solution for modelling adaptive management problems. In AAAI.
Izadi, M., and Precup, D. 2008. Point-based planning for predictive state representations. In Canadian Conference on AI.
James, M. R.; Singh, S.; and Littman, M. L. 2004. Planning with predictive state representations. In International Conference on Machine Learning and Applications, 304311.
James, M. R.; Wessling, T.; and Vlassis, N. 2006. Improving approximate value iteration using memories and predictive state representations. In AAAI.
Kaelbling, L.; Littman, M.; and Cassandra, A. 1998. Planning and acting in partially observable stochastic domains.Artificial Intelligence 101:99134.
Littman, M.; Sutton, R.; and Singh, S. 2002. Predictive representations of state. In Advances in Neural Information Processing Systems (NIPS).
Ong, S. C. W.; Png, S. W.; Hsu, D.; and Lee, W. S. 2010.Planning under uncertainty for robotic tasks with mixed observability. International Journal of Robotics Research.
Rafols, E. J.; Ring, M.; Sutton, R.; and Tanner, B. 2005.Using predictive representations to improve generalization in reinforcement learning. In IJCAI.
Singh, S.; James, M.; and Rudary, M. 2004. Predictive state representations: A new theory for modeling dynamical systems. In Proceedings UAI.
-----0
Alonso, O.; Rose, D. E.; and Stewart, B. 2008. Crowdsourcing for relevance evaluation. SIGIR Forum 42(2):915.
Bernstein, M. S.; Little, G.; Miller, R. C.; Hartmann, B.; Ackerman, M. S.; Karger, D. R.; Crowell, D.; and Panovich, K. 2010. Soylent: a word processor with a crowd inside. In Proceedings of the 23nd annual ACM symposium on User interface software and technology, UIST 10, 313 322. ACM.
Dai, P.; Mausam; and Weld, D. S. 2010. Decision-theoretic control of crowd-sourced workflows. In Proceedings of the 24th AAAI Conference on Artificial Intelligence, AAAI 10, 11681174.
Dai, P.; Mausam; and Weld, D. S. 2011. Artificial intelligence for artificial artificial intelligence. In Proceedings of the 25th AAAI Conference on Artificial Intelligence, AAAI 11, 11531159.
Darlington, J. 1978. A synthesis of several sorting algorithms. Acta Informatica 11:130. 10.1007/BF00264597.
Horvitz, E.; Cooper, G.; and Heckerman, D. 1989. Reflection and action under scarce resources: Theoretical principles and empirical study. In Proceedings of the 11th International Joint Conference on Artificial Intelligence, IJCAI 89, 11211127.
Horvitz, E. J. 1987. Reasoning about beliefs and actions under computational resource constraints. In Proceedings of the Third Workshop on Uncertainty in Artificial Intelligence, 429444.
Horvitz, E. J. 1990. Computation and Action Under Bounded Resources. Dissertation, Stanford.
Howard, R. 1970. Decision analysis: Perspectives on inference, decision, and experimentation. Proceedings of the IEEE 58(5):632643.
Huang, E.; Zhang, H.; Parkes, D. C.; Gajos, K.; and Chen, Y. 2010. Toward automatic task design: A progress report. In Proceedings of the 2nd Human Computation Workshop, HCOMP 10.
Kamar, E.; Hacker, S.; and Horvitz, E. 2012. Combining human and machine intelligence in large-scale crowdsourcing. In Proceedings of the 11th International Conference on Autonomous Agents and Multiagent Systems Volume 1, AAMAS 12, 467474. Richland, SC: International Foundation for Autonomous Agents and Multiagent Systems.
Kittur, A.; Smus, B.; Kraut, R.; and Khamkar, S. 2011.Crowdforge: Crowdsourcing complex work. In Proceedings of the 24th annual ACM symposium on User interface software and technology, UIST 11.
Law, E., and von Ahn, L. 2011. Human Computation. Morgan & Claypool Publishers.
Li, X.; Garzaran, M. J.; and Padua, D. 2007. Optimizing sorting with machine learning algorithms. In Proceedings of the IEEE International Parallel and Distributed Processing Symposium, IPDPS 07.
Lin, C.; Mausam; and Weld, D. 2012. Dynamically switching between synergistic workflows for crowdsourcing. In Proceedings of the 26th AAAI Conference on Artificial Intelligence, AAAI 12.
Little, G.; Chilton, L. B.; Goldman, M.; and Miller, R. C.2010. Turkit: human computation algorithms on mechanical turk. In Proceedings of the 23nd annual ACM symposium on user interface software and technology, UIST 10, 57 66. New York, NY, USA: ACM.
Marcus, A.; Wu, E.; Karger, D.; Madden, S.; and Miller, R.2011a. Human-powered sorts and joins. Proceedings of the VLDB Endowment 5(1):1324.
Marcus, A.; Wu, E.; Karger, D. R.; Madden, S.; and Miller, R. C. 2011b. Crowdsourced databases: Query processing with people. In Proceedings of the 5th Biennial Conference on Innovative Data Systems Research, CIDR 11.
Noronha, J.; Hysen, E.; Zhang, H.; and Gajos, K. Z. 2011.Platemate: Crowdsourcing nutrition analysis from food photographs. In Proceedings of the 24th annual ACM symposium on User interface software and technology, UIST 11, 112.
Russell, S., and Wefald, E. 1991. Principles of metareasoning. Artificial Intelligence 49(1-3):361395.
Shahaf, D., and Horvitz, E. 2010. Generalized task markets for human and machine computation. In Proceedings of the 24th AAAI Conference on Artificial Intelligence, AAAI 10, 986993.
Smith, D. R. 1985. Top-down synthesis of divide-andconquer algorithms. Artificial Intelligence 27,1:4396.
Venetis, P.; Garcia-Molina, H.; Huang, K.; and Polyzotis, N.2012. Max algorithms in crowdsourcing environments. In Proceedings of the 21st international conference on World Wide Web, WWW 12, 989998. New York, NY, USA: ACM.von Ahn, L. 2005. Human Computation. Ph.D. Dissertation, Carnegie Mellon University.
Zhang, H., and Parkes, D. C. 2008. Value-based policy teaching with active indirect elicitation. In Proceedings of the 23rd National Conference on Artificial Intelligence, AAAI 08, 208214.
-----0
Alviano, M.; Faber, W.; and Leone, N. 2010. Disjunctive ASP with functions: Decidable queries and effective computation. Theory and Practice of Logic Programming 10(46):497512.
Anderson, M. L., and Oates, T. 2007. A review of recent research in metareasoning and metalearning. AI Magazine 28:716.
Bonatti, P. 2004. Reasoning with infinite stable models.Artificial Intelligence 156:75111.
Calimeri, F.; Cozza, S.; Ianni, G.; and Leone, N. 2008. In International Conference on Logic Programming, 407424.
Chen, W., and Warren, D. S. 1996. Tabled Evaluation with Delaying for General Logic Programs. Journal of the ACM 43(1):2074.
Chen, W.; Kifer, M.; and Warren, D. S. 1993. HiLog: A foundation for higher-order logic programming. Journal of Logic Prog. 15(3):187230.
Fisher, M., and Ghidini, C. 1999. Programming resourcebounded deliberative agents. In International Joint Conference on Artificial Intelligence, volume 16, 200205.
Fisher, M.; Bordini, R. H.; Hirsch, B.; and Torroni, P. 2007.Computational logics and agents a roadmap of current technologies and future trends. Computational Intelligence 23(1):6191.
Grant, J.; Kraus, S.; and Perlis, D. 2000. A logic for characterizing multiple bounded agents. Autonomous Agents and Multi-Agent Systems 3(4):351387.
Konolige, K. 1983. A deductive model of belief. In International Joint Conference on Artificial Intelligence, 377381.
Levesque, H. 1984. A logic of implicit and explicit belief. In Proceedings of the Conference of the American Association for Artificial Intelligence, 198202.OpenRuleBench. 2011. Openrulebench: Benchmarks for semantic web rule engines.rulebench.projects.semwebcentral.org, benchmark suites were tested in 2009, 2010, and 2011.
Przymusinski, T. 1989. Every logic program has a natural stratification and an iterated least fixed point model. In ACM Principles of Database Systems, 1121. ACM Press.
Riguzzi, F., and Swift, T. 2013a. Termination of logic programs with finite three-valued models.
Riguzzi, F., and Swift, T. 2013b. Well-definedness and efficient inference for probabilistic logic programming under the distribution semantics. Theory and Practice of Logic Programming 13(2):279302.
Russell, S., and Subramanian, D. 1995. Provably boundedoptimal agents. Journal of Artificial Intelligence Research 2.
SILK. 2013. SILK: Semantic Inferencing on Large Knowledge. http://silk.semwebcentral.org (project begun in 2008).
Swift, T., and Warren, D. 2012. XSB: Extending the power of Prolog using tabling. Theory and Practice of Logic Programming 12(1-2):157187.
Swift, T. 1999. A new formulation of tabled resolution with delay. In Progress in Artificial Intelligence, 163177.
Tamaki, H., and Sato, T. 1986. OLDT resolution with tabulation. In International Conference on Logic Programming, 8498.van Gelder, A.; Ross, K.; and Schlipf, J. 1991. Unfounded sets and well-founded semantics for general logic programs.Journal of the ACM 38(3):620650.
Wan, H.; Grosof, B.; Kifer, M.; Fodor, P.; and Liang, S.2009. Logic programming with defaults and argumentation theories. In International Conference on Logic Programming, 432448.
XSB. 2013. XSB Prolog. http://xsb.sourceforge.net (first released in 1993).
-----0
Chan, P.; Schlag, D.; and Zien, J. 1994. Spectral k-way ratio-cut partitioning and clustering. IEEE Transactions on  Computer-Aided Design of Integrated Circuits and Systems 13(9):10881096.
Chung, F. 1997. Spectral Graph Theory. American Mathematical Society.
Dhillon, I.; Guan, Y.; and Kulis, B. 2004. Kernel kmeans, spectral clustering and normalized cuts. In KDD, 551556.
Ding, C.; He, X.; Zha, H.; Gu, M.; and Simon, H. 2001. A min-max cut algorithm for graph partitioning and data clustering. In ICDM, 107114.
Ding, C.; He, X.; and Simon, H. 2005. On the equivalence of nonnegative matrix factorization and spectral clustering.In SDM, 606610.
Ding, C.; Li, T.; and Jordan, M. 2008. Nonnegative matrix factorization for combinatorial optimization: Spectral clustering, graph matching, and clique finding. In ICDM, 183 192.Frank, A., and Asuncion, A. 2010. Uci machine learning repository.
Georghiades, A., and et al. 2001. From few to many: Illumination cone models for face recognition under variable lighting and pose. IEEE Transaction on Pattern Analysis and Machine Intelligence 23(6):643660.
Hagen, L., and Kahng, A. 1992. New spectral methods for ratio cut partioning and clustering. IEEE Transactions on Computer-Aided Design 11(6):10741085.
LeCun, Y.; Bottou, L.; Bengio, Y.; and Haffner, P. Gradientbased learning applied to document recognition. Proceedings of the IEEE 86(11):22782324.
Lee, D., and Seung, H. 2001. Algorithms for non-negative matrix factorization. In NIPS, 556562.
Luo, D.; Huang, H.; Ding, C.; and Nie, F. 2010. On the eigenvectors of p-laplacian. Machine Learning 81(1):3751.
Luxberg, U. 2007. A tutorial on spectral clustering. Statistics and Computing 17(4):395416.
Lyons, M.; Akamatsu, S.; Kamachi, M.; and Gyoba, J. 1998.Coding facial expressions with gabor wavelets. In 3rd IEEE 
International Conference on Automatic Face and Gesture Recognition.
MacKay, D. 2003. Information Theory, Inference, and Learning Algorithms. Cambridge University Press.
Mann, H., and Whitney, D. 1947. On a test of whether one of two random variables is stochastically larger than the other.Annals of Mathematical Statistics 18(1):5060.
Martinez, A., and Kak, A. 2001. Pca versus lda. IEEE Transactions on Pattern Analysis and Machine Intelligence 2(23):228233.
Nene, S.; Nayar, S.; and Murase, H. 1996. Technical report, Columbia University.
Ng, A.; Jordan, M.; and Weiss, Y. 2002. On spectral clustering: Analysis and an algorithm. In NIPS, 849856.
Nie, F.; Ding, C.; Luo, D.; and Huang, H. 2010. Improved minmax cut graph clustering with nonnegative relaxation. In ECMLPKDD, 451466.
Nie, F.; Wang, H.; Huang, H.; and Ding, C. 2011. Unsupervised and semi-supervised learning via l1-norm graph. In ICCV, 22682273.
Samaria, F., and Harter, A. 1994. Parameterisation of a stochastic model for human face identification. In 2nd IEEE Workshop on Applications of Computer Vision.
Shi, J., and Malik, J. 2000. Normalized cuts and image segmentation. IEEE Transactions on Pattern Analysis and Machine Intelligence 22(8):888905.
Sim, T.; Baker, S.; and Bsat, M. 2002. The cmu pose, illumination, and expression database. IEEE Transactions on Pattern Analysis and Machine Intelligence 25(12):16151618.
Yu, X., and Shi, J. 2003. Multiclass spectral clustering. In ICCV, 313319.
Zelnik-manor, L., and Perona, P. 2004. Self-tuning spectral clustering. In NIPS, 16011608.
Zha, H.; He, X.; Ding, C.; and Simon, H. 2001. Spectral relaxation for k-means clustering. In NIPS, 10571064.
-----0
Arthur, D., and Vassilvitskii, S. 2007. k-means++: The advantages of careful seeding. In Proceedings of the 18th Annual ACM-SIAM Symposium on Discrete Algorithms, 1027 1035. SIAM.
Bengio, Y.; Louradour, J.; Collobert, R.; and Weston, J.2009. Curriculum learning. In Proceedings of the 26th International Conference on Machine Learning, 4148. ACM Press.
Cohn, D. A.; Ghahramani, Z.; and Jordan, M. I. 1996. Active learning with statistical models. Journal of Artificial Intelligence Research 4:129145.
Kumar, A., and Daume III, H. 2012. Learning task grouping and overlap in multi-task learning. In Proceedings of the 29th International Conference on Machine Learning, 1383 1390. Omnipress.
Kumar, M. P.; Packer, B.; and Koller, D. 2010. Self-paced learning for latent variable models. In Advances in Neural Information Processing Systems 23, 11891197.
Lee, Y. J., and Grauman, K. 2011. Learning the easy things first: Self-paced visual category discovery. In Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition, 17211728. IEEE Press.
MacKay, D. J. 1992. Information-based objective functions for active data selection. Neural Computation 4:590604.
Pan, S., and Yang, Q. 2010. A survey on transfer learning. IEEE Transactions on Knowledge and Data Engineering 22(10):13451359.
Rai, P., and Daume III, H. 2010. Infinite predictor subspace models for multitask learning. In Proceedings of the 13th International Conference on Artificial Intelligence and Statistics, 613620.
Ruvolo, P., and Eaton, E. 2013. ELLA: An efficient lifelong learning algorithm. In Proceedings of the 30th International Conference on Machine Learning.
Saha, A.; Rai, P.; Daume III, H.; and Venkatasubramanian, S. 2010. Active online multitask learning. In ICML 2010 Workshop on Budget Learning.
Saha, A.; Rai, P.; Daume III, H.; and Venkatasubramanian, S. 2011. Online learning of multiple tasks and their relationships. In Proceedings of the 14th International Conference on Artificial Intelligence and Statistics, 643651.
Tong, S., and Koller, D. 2001. Support vector machine active learning with applications to text classification. Journal of Machine Learning Research 2:4566.
Valstar, M.; Jiang, B.; Mehu, M.; Pantic, M.; and Scherer, K. 2011. The first facial expression recognition and analysis challenge. In Proceedings of the IEEE International Conference on Automatic Face & Gesture Recognition, 921926.IEEE Press.
Xue, Y.; Liao, X.; Carin, L.; and Krishnapuram, B. 2007.Multi-task learning for classification with Dirichlet process priors. The Journal of Machine Learning Research 8:3563.
Zhang, J.; Ghahramani, Z.; and Yang, Y. 2008. Flexible latent variable models for multi-task learning. Machine Learning 73(3):221242.
Zhang, Y. 2010. Multi-task active learning with output constraints. In Proceedings of the 24th AAAI Conference on Artificial Intelligence.
-----0
Adams, A.; Baek, J.; and Davis, M. A. 2010. Fast High-Dimensional Filtering Using the Permutohedral Lattice. Computer Graphics Forum 29(2):753762.
Adams, A.; Gelfand, N.; Dolson, J.; and Levoy, M.2009. Gaussian KD-trees for fast high-dimensional filtering. ACM Transactions on Graphics 28(3):1.
Bishop, C. M. 2006. Pattern Recognition and Machine Learning. Springer.
Buades, A.; Coll, B.; and Morel, J.-M. 2011. NonLocal Means Denoising. Image Processing On Line 2011.
Hansen, J.; Sato, M.; and Ruedy, R. 1997. Radiative forcing and climate response. Journal of Geophysical Research: Atmospheres 102(D6):68316864.
Kim, M., and Pavlovic, V. 2009. Discriminative Learning for Dynamic State Prediction. IEEE Transactions on Pattern Analysis and Machine Intelligence 31(10):18471861.
Koller, D., and Friedman, N. 2009. Probabilistic Graphical Models: Principles and Techniques. MIT Press.
Kolmogorov, V. 2006. Convergent tree-reweighted message passing for energy minimization. IEEE transactions on pattern analysis and machine intelligence 28(10):156883.
Krahenbuhl, P., and Koltun, V. 2011. Efficient Inference in Fully Connected CRFs with Gaussian Edge Potentials. Neural Information Processing Systems.
Lafferty, J, M. A., and Pereira, F. 2001. Conditional random fields: Probabilistic Models for Segmenting and Labeling Sequence Data. In Proceedings International Conference on Machine Learning.
Neville, J.; Gallagher, B.; Eliassi-Rad, T.; and Wang, T. 2012. Correcting evaluation bias of relational classifiers with network cross validation. Knowledge and Information Systems 30:3155.
Paris, S., and Durand, F. 2009. A Fast Approximation of the Bilateral Filter Using a Signal Processing Approach. International Journal of Computer Vision 81(1):2452.
Payet, N., and Todorovic, S. 2010. (RF)2 Random Forest Random Field. In Neural Information Processing Systems (NIPS), volume 1, 19.
Qin, T.; Liu, T.; Zhang, X.; Wang, D.; and Li, H. 2008.Global Ranking Using Continuous Conditional Random Fields. Neural Information Processing Systems.
Radosavljevic, V.; Vucetic, S.; and Obradovic, Z. 2010.Continuous conditional random fields for regression in remote sensing. In Proceedings of the 2010 conference on ECAI 2010: 19th European Conference on Artificial 
Intelligence, 809814. Amsterdam, The Netherlands, The Netherlands: IOS Press.
Remer, L. A., and Kaufman, Y. 2005. The modis aerosol algorithm, products and validation. Journal of the Atmospheric Sciences 62:947973.
Roth, S., and Black, M. 2005. Fields of Experts: A Framework for Learning Image Priors. In 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR05), volume 2, 860867.
Roth, S., and Black, M. J. 2009. Fields of experts. Int.J. Comput. Vision 82(2):205229.
Salmon, J., and Strozecki, Y. 2012. Patch reprojections for non-local methods. Signal Processing 92(2):477  489.
Schelten, K., and Roth, S. 2012. Mean field for continuous high-order mrfs. In Pinz, A.; Pock, T.; Bischof, H.; and Leberl, F., eds., DAGM/OAGM Symposium, volume 7476 of Lecture Notes in Computer Science, 5261. Springer.
Solberg, A H S, T. T., and Jain, A. K. 1996. A Markov Random Field Model for Classification of Multisource Satellite Imagery. IEEE Transactions on Geoscience and Remote Sensing 34(1):100113.
Tappen, M F, L. C.; Adelson, E. H.; and Freeman, W. T.2007. Learning Gaussian Conditional Random Fields for Low-Level Vision. IEEE Conference on Computer Vision and Pattern Recognition.
Tasdizen, T. 2009. Principal neighborhood dictionaries for nonlocal means image denoising. Image Processing, IEEE Transactions on 18(12):2649 2660.
Toyoda, T., and Hasegawa, O. 2008. Random Field Model for Integration of Local Information and Global Information. IEEE Transactions on Pattern Analysis and Machine Intelligence 30(8):14831489.
Van De Ville, D., and Kocher, M. 2011. Nonlocal means with dimensionality reduction and sure-based parameter selection. Image Processing, IEEE Transactions on 20(9):2683 2690.
Vineet, V.; Warrell, J.; and Torr, P. 2012. Filter-based Mean-Field Inference for Random Fields with HigherOrder Terms and Product Label-Spaces. In European Conference on Computer Vision (ECCV).
Vishwanathan, S. V. N.; Schraudolph, N. N.; Schmidt, M. W.; and Murphy, K. P. 2006. Accelerated training of conditional random fields with stochastic gradient methods. In Proceedings of the 23rd international conference on Machine learning, ICML 06, 969976.New York, NY, USA: ACM.
Xin, X.; King, I.; Deng, H.; and Lyu, M. R. 2009. A social recommendation framework based on multi-scale continuous conditional random fields. In Proceedings of the 18th ACM conference on Information and knowledge management, CIKM 09, 12471256. New York, NY, USA: ACM.
Zhang, Y., and Chen, T. 2012. Efficient inference for fully-connected CRFs with stationarity. In 2012 IEEE Conference on Computer Vision and Pattern Recognition, 582589. IEEE.
-----0
Achlioptas, D.; Clauset, A.; Kempe, D.; and Moore, C. 2009. On the bias of traceroute sampling. J. ACM 56(4):21:121:28.
Bakshy, E.; Hofman, J.; Mason, W.; and Watts, D. 2011. Everyones an influencer: Quantifying influence on twitter. In WSDM.
Borgatti, S.; Carley, K.; and Krackhardt, D. 2006. On the robustness of centrality measures under conditions of imperfect data. Social Networks 28:124136.
Chen, J. 2010. The effects of demographic and spatial variability on epidemics: A comparison between beijing, delhi and los angeles. In Conf. on Crit. Inf.
Chung, F., and Lu, L. 2002. Connected components in random graphs with given expected degree sequences. Annals of Combinatorics 6:125145.
Clauset, A.; Moore, C.; and Newman, M. 2008. Hierarchical structure and the prediction of missing links in networks.Nature 453:98101.
Costenbader, E., and Valente, T. 2003. The stability of centrality measures when networks are sampled. Social Networks 25:283307.
Eubank, S. 2010. Detail in network models of epidemiology: are we there yet? Journal of Biological Dynamics 446455.
Faloutsos, M.; Faloutsos, P.; and Faloutsos, C. 1999. On power-law relationships of the internet topology. In SIGCOMM, volume 29, 251262.
Flaxman, A., and Frieze, A. M. 2004. The diameter of randomly perturbed digraphs and some applications. In APPROX-RANDOM, 345356.
Flaxman, A. 2007. Expansion and lack thereof in randomly perturbed graphs. Internet Mathematics 4(2-3):131147.
Galuba, W. 2010. Outtweeting the twitterers predicting information cascades in microblogs. In WOSN.
Goldenberg, J.; Libai, B.; and Muller, E. 2001. Talk of the network: A complex systems look at the underlying process of word-of-mouth. Marketing Letters.
Gonzlez-Bailn, S.; Borge-Holthoefer, J.; Rivero, A.; and Moreno, Y. 2011. The dynamics of protest recruitment through an online network. Scientific Reports 1.
Hagmann, P. 2008. Mapping the structural core of human cerebral cortex. PLoS Biol.
Kaneko, K. 1985. Spatiotemporal intermittency in coupled map lattices. Progress of Theoretical Physics 74(5):1033 1044.
Kempe, D.; Kleinberg, J. M.; and Tardos, E. 2003. Maximizing the spread of influence through a social network. In KDD, 137146. ACM.
Kempe, D.; Kleinberg, J. M.; and Tardos, E. 2005. Influential nodes in a diffusion model for social networks. In ICALP.
Lahiri, M.; Maiya, A. S.; Caceres, R. S.; Habiba; and BergerWolf, T. Y. 2008. The impact of structural changes on predictions of diffusion in networks. In ICDM, 939948.
Leskovec, J. 2011. Stanford network analysis project.Newman, M. 2003. The structure and function of complex networks. SIAM Review 45(2):167256.
Romero, D.; Meeder, B.; and Kleinberg, J. 2011. Differences in the mechanics of information diffusion across topics: idioms, political hashtags, and complex contagion on twitter.In Proc. of WWW, 695704. ACM.
Ron, D. 2010. Algorithmic and analysis techniques in property testing. Foundations and Trends in TCS 5(2):73205.
Schwab, D. J.; Bruinsma, R. F.; Feldman, J. L.; and Levine, A. J. 2010. Rhythmogenic neuronal networks, emergent leaders, and k-cores. Phys. Rev. E 82:051911.
Spielman, D. 2009. Smoothed analysis: An attempt to explain the behavior of algorithms in practice. Communications of the ACM 7684.
Wu, C. W. 2005. Synchronization in networks of nonlinear dynamical systems coupled via a directed graph. Nonlinearity 18:10571064.
-----0
Albarghouthi, A.; Baier, J. A.; and McIlraith, S. A. 2009. On the use of planning technology for verification. In Proc. of ICAPS Workshop on Verification and Validation of Planning and Scheduling Systems.
Albore, A., and Bertoli, P. 2004. Generating safe assumption-based plans for partially observable, nondeterministic domains. In Proc. of the 19th National Conference on Artificial Intelligence (AAAI), 495500.
Albore, A., and Geffner, H. 2009. Acting in partially observable environments when achievement of the goal cannot be guaranteed. In Proc. of ICAPS Workshop on Planning and Plan Execution for Real-World Systems.
Albore, A.; Palacios, H.; and Geffner, H. 2009. A translation-based approach to contingent planning. In Proc.of the 21st International Joint Conference on Artificial Intelligence (IJCAI), 16231628.
Baier, J. A., and McIlraith, S. A. 2008. Planning with preferences. Artificial Intelligence Magazine 29(4):2536.
Bonet, B., and Geffner, H. 2011. Planning under partial observability by classical replanning: Theory and experiments. In Proc. of the 22nd International Joint Conference on Artificial Intelligence (IJCAI), 19361941.
Brafman, R. I., and Shani, G. 2012. Replanning in domains with partial information and sensing actions. Journal of Artificial Intelligence Research 45:565600.
Brafman, R. I., and Taig, R. 2011. A translation based approach to probabilistic conformant planning. In Proceedings of the Second International Conference on Algorithmic Decision Theory (ADT), 1627.
Bylander, T. 1994. The computational complexity of propositional STRIPS planning. Artificial Intelligence 69(12):165204.
Davis-Mendelow, S.; Baier, J. A.; and McIlraith, S. A.2012a. Making reasonable assumptions to plan with incomplete information. In Proc. of the ICAPS Workshop on Heuristics and Search for Domain-Independent Planning (HSDIP).
Davis-Mendelow, S.; Baier, J. A.; and McIlraith, S. A.2012b. Making reasonable assumptions to plan with incomplete information: Abridged report. In Proc. of the AAAI Workshop on Problem Solving Using Classical Planners (CP4PS).
De Giacomo, G., and Vardi, M. Y. 1999. Automata-theoretic approach to planning for temporally extended goals. In Biundo, S., and Fox, M., eds., ECP, volume 1809 of LNCS, 226238. Durham, UK: Springer.
Faletti, J. 1982. Pandora: A program for doing commonsense planning in complex situations. In AAAI82, 185188.
Fritz, C., and McIlraith, S. A. 2007. Monitoring plan optimality during execution. In Proc. of the 17th International Conference on Automated Planning and Scheduling (ICAPS), 144151.
Gobelbecker, M.; Keller, T.; Eyerich, P.; Brenner, M.; and Nebel, B. 2010. Coming up with good excuses: What to do when no plan can be found. In Proc. of the 20th International Conference on Automated Planning and Scheduling (ICAPS), 8188.
Gobelbecker, M.; Gretton, C.; and Dearden, R. 2011. A switching planner for combined task and observation planning. In Proc. of the 26th AAAI Conference on Artificial Intelligence (AAAI).
Haslum, P., and Grastien, A. 2011. Diagnosis as planning: Two case studies. In Proc. of the International Scheduling and Planning Applications workshop (SPARK).
Haslum, P., and Jonsson, P. 1999. Some results on the complexity of planning with incomplete information. In Proc. of the 5th European Conference on Planning (ECP), 308318.
Hoffmann, J., and Nebel, B. 2001. The FF planning system: Fast plan generation through heuristic search. Journal of Artificial Intelligence Research 14:253302.
Hoffmann, J. 2003. The Metric-FF planning system: Translating ignoring delete lists to numeric state variables.Journal of Artificial Intelligence Research 20:291341.
Lin, F., and Reiter, R. 1997. How to progress a database.Artif. Intell. 92(1-2):131167.
Palacios, H., and Geffner, H. 2006. Compiling uncertainty away: Solving conformant planning problems using a classical planner (sometimes). In Proc. of the 21st National Conference on Artificial Intelligence (AAAI).
Palacios, H., and Geffner, H. 2009. Compiling uncertainty away in conformant planning problems with bounded width.Journal of Artificial Intelligence Research 35:623675.
Pellier, D., and Fiorino, H. 2004. Assumption-based planning. In In Proceedings of the International Conference on Advances in Intelligence Systems Theory and Applications, Luxemburg.
Poole, D.; Goebel, R.; and Aleliunas, R. 1987. Theorist: a logical reasoning system for defaults and diagnosis. In Cercone, N., and McCalla, G., eds., The Knowledge Frontier: Essays in the Representation of Knowledge. New York: Springer Verlag. 331352.
Ram?rez, M., and Geffner, H. 2010. Probabilistic plan recognition using off-the-shelf classical planners. In Proc. of the 25th AAAI Conference on Artificial Intelligence (AAAI).
Richter, S.; Helmert, M.; and Westphal, M. 2008. Landmarks revisited. In Proc. of the 23rd AAAI Conference on Artificial Intelligence (AAAI), 975982.
Sohrabi, S.; Baier, J.; and McIlraith, S. A. 2010. Diagnosis as planning revisited. In Proc. of the 12th International Conference on Knowledge Representation and Reasoning (KR), 2636.
Sohrabi, S.; Baier, J. A.; and McIlraith, S. A. 2011. Preferred explanations: Theory and generation via planning. In Proc. of the 26th AAAI Conference on Artificial Intelligence (AAAI), 261267.
To, S. T.; Son, T. C.; and Pontelli, E. 2010. A New Approach to Conformant Planning Using CNF*. In Proc. of the 20th International Conference on Automated Planning and Scheduling (ICAPS), 169176.
-----0
Birkhoff, G. 1946. Tres observaciones sobre el algebra lineal. Univ. Nac. Tucumn Rev, Ser. A, no. 5 147151.
Budish, E.; koo Che, Y.; Kojima, F.; and Milgrom, P. 2013.Designing random allocation mechanisms: Theory and applications. American Economic Review, 103(2): 585-623.
Conitzer, V., and Sandholm, T. 2006. Computing the optimal strategy to commit to. In Proceedings of the ACM Conference on Electronic Commerce (EC), 8290.
Jain, M.; Pita, J.; Tambe, M.; Ordonez, F.; Paruchuri, P.; and Kraus, S. 2008. Bayesian Stackelberg games and their application for security at Los Angeles International Airport.SIGecom Exch. 7(2):13.
Kiekintveld, C.; Jain, M.; Tsai, J.; Pita, J.; Ordonez, F.; and Tambe, M. 2009. Computing optimal randomized resource allocations for massive security games. In Proceedings of the Eighth International Joint Conference on Autonomous Agents and Multi-Agent Systems (AAMAS), 689696.
Korzhyk, D.; Conitzer, V.; and Parr, R. 2010. Complexity of computing optimal Stackelberg strategies in security resource allocation games. In Proceedings of the National Conference on Artificial Intelligence (AAAI), 805810.
Lin, G.; Cai, Z.; and Lin, D. 2006. Vertex covering by paths on trees with its applications in machine translation. Inf.Process. Lett. 97(2):7381.
Paruchuri, P.; Pearce, J. P.; Marecki, J.; Tambe, M.; Ordonez, F.; and Kraus, S. 2008. Playing games for security: An efficient exact algorithm for solving Bayesian Stackelberg games. In Proceedings of the Seventh International Joint Conference on Autonomous Agents and Multi-Agent Systems (AAMAS), 895902.
Pita, J.; Jain, M.; Ordonez, F.; Portway, C.; Tambe, M.; and Western, C. 2009. Using game theory for Los Angeles airport security. AI Magazine 30(1):4357.
Shieh, E.; An, B.; Yang, R.; Tambe, M.; Baldwin, C.; DiRenzo, J.; Maule, B.; and Meyer, G. 2012. PROTECT: A deployed game theoretic system to protect the ports of the United States. In International Conference on Autonomous Agents and Multiagent Systems (AAMAS), 847854.
Tsai, J.; Rathi, S.; Kiekintveld, C.; Ordonez, F.; and Tambe, M. 2009. IRIS a tool for strategic security allocation in transportation networks. In The Eighth International Conference on Autonomous Agents and Multiagent Systems Industry Track, 3744.
von Stengel, B., and Zamir, S. 2010. Leadership games with convex strategy sets. Games and Economic Behavior 69:446457.
Yin, Z.; Jiang, A. X.; Johnson, M.; Kiekintveld, C.; LeytonBrown, K.; Sandholm, T.; Tambe, M.; and Sullivan, J. 2012.Trusts: Scheduling randomized patrols for fare inspection in transit systems. In Proceedings of Innovative Applications of Artificial Intelligence (IAAI).
-----0
Barutcuoglu, Z.; Schapire, R. E.; and Troyanskaya, O. G.2006. Hierarchical multi-label prediction of gene function.Bioinformatics 22(7):830836.
Bertsekas, D., and Tsitsiklis, J. 1989. Parallel and Distributed Computation: Numerical Methods. Prentice-Hall.
Boutell, M. R.; Luo, J.; Shen, X.; and Brown, C. M. 2004.Learning multi-label scene classification. Pattern Recognition 37(9):17571771.
Boyd, S.; Parikh, N.; Chu, E.; Peleato, B.; and Eckstein, J.2011. Distributed optimization and statistical learning via the alternating direction method of multipliers. Foundations and Trends in Machine Learning 3(1):1122.
Chang, C., and Lin, C. 2011. Libsvm: A library for support vector machines. ACM Transactions on Intelligent Systems and Technology 2(3):27.
Cheng, W.; Dembczynski, K.; and Hullermeier, E. 2010.Graded multilabel classification: The ordinal case. In Proceedings of the 27th International Conference on Machine Learning, 223230.
Dekel, O.; Manning, C.; and Singer, Y. 2003. Log-linear models for label ranking. In Advances in Neural Information Processing Systems 16.
Dembczynski, K.; Waegeman, W.; Cheng, W.; and Hullermeier, E. 2010. Regret analysis for performance metrics in multi-label classification: The case of hamming and subset zero-one loss. In Proceedings of the European Conference on Machine Learning and Principles and Practice of Knowledge Discovery in Databases, 280295.
Elisseeff, A., and Weston, J. 2002. A kernel method for multi-labelled classification. In Advances in Neural Information Processing Systems 14. 681687.
Fan, R.; Chang, K.; Hsieh, C.; Wang, X.; and Lin, C. 2008.LIBLINEAR: A library for large linear classification. Journal of Machine Learning Research 9:18711874.
Forero, P.; Cano, A.; and Giannakis, G. 2010. Consensusbased distributed support vector machines. Journal of Machine Learning Research 11:16631707.
Furnkranz, J.; Hullermeier, E.; Menc?a, E.; and Brinker, K.2008. Multilabel classification via calibrated label ranking.Machine Learning 73(2):133153.
Gartner, T., and Vembu, S. 2010. Label ranking algorithms: A survey. In Johannes Furnkranz, E. H., ed., Preference Learning. 4564.
Godbole, S., and Sarawagi, S. 2004. Discriminative methods for multi-labeled classification. In Proceedings of 8th Pacific-Asia Conference on Knowledge Discovery and Data Mining, 2230.
He, B., and Yuan, X. 2012. On the o(1/n) convergence rate of the douglas-rachford alternating direction method. SIAM Journal of Numerical Analysis 50(2):700709.
Hullermeier, E.; Furnkranz, J.; Cheng, W.; and Brinker, K.2008. Label ranking by learning pairwise preferences. Artifical Intellengce 172(16-17):18971916.
Kazawa, H.; Izumitani, T.; Taira, H.; and Maeda, E. 2005.Maximal margin labeling for multi-topic text categorization. In Advances in Neural Information Processing Systems 17.649656.
Kotlowski, W.; Dembczynski, K.; and Huellermeier, E.2011. Bipartite ranking through minimization of univariate loss. In Proceedings of the 28th International Conference on Machine Learning, 11131120.
Li, H.; Wang, M.; and Hua, X.-S. 2009. Msra-mm 2.0: A large-scale web multimedia dataset. In ICDM Workshops, 164169.
Qi, G.-J.; Hua, X.-S.; Rui, Y.; Tang, J.; Mei, T.; and Zhang, H.-J. 2007. Correlative multi-label video annotation. In Proceedings of the 15th International Conference on Multimedia, 1726.
Schapire, R. E., and Singer, Y. 2000. BoosTexter: A boosting-based system for text categorization. Machine Learning 39(2-3):135168.Shalev-Shwartz, S., and Singer, Y. 2006. Efficient learning of label ranking by soft projections onto polyhedra. Journal of Machine Learning Research 7:15671599.
Tsoumakas, G.; Katakis, I.; and Vlahavas, I. 2010. Mining multi-label data. In Data Mining and Knowledge Discovery Handbook. 667685.Vapnik, V. N. 1998. Statistical Learning Theory. Wiley.
Yang, Y. 1999. An evaluation of statistical approaches to text categorization. Information Retrieval 1(1-2):6990.
Yu, K.; Yu, S.; and Tresp, V. 2005. Multi-label informed latent semantic indexing. In Proceedings of the 28th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval, 258265.
Zhang, M.-L., and Zhou, Z.-H. 2006. Multilabel neural networks with applications to functional genomics and text categorization. IEEE Transactions on Knowledge and Data Engineering 18(10):13381351.
Zhang, M.-L., and Zhou, Z.-H. 2007a. ML-KNN: A lazy learning approach to multi-label learning. Pattern Recognition 40(7):20382048.Zhang, M.-L., and Zhou, Z.-H. 2007b. Multi-label learning by instance differentiation. In Proceedings of the 22nd AAAI Conference on Artificial Intelligence, 669674.
Zhang, M.; Pena, J.; and Robles, V. 2009. Feature selection for multi-label naive bayes classification. Information Science 179(19):32183229.
Zhou, Z.-H., and Yu, Y. 2005. Ensembling local learners through multimodal perturbation. IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics 35(4):725735.
-----0
Aloul, F. A.; Markov, I. L.; and Sakallah, K. A. 2004. Mince: A static global variable-ordering heuristic for SAT search and BDD manipulation. J. UCS 10(12):15621596.
Bryant, R. E. 1986. Graph-based algorithms for Boolean function manipulation. IEEE Transactions on Computers C-35:677691.
Campbell, D. M. 1984. The computation of Catalan numbers.Mathematics Magazine 57(4):195208.
Darwiche, A. 2011. SDD: A new canonical representation of propositional knowledge bases. In IJCAI, 819826.
Ferrara, A.; Pan, G.; and Vardi, M. Y. 2005. Treewidth in verification: Local vs. global. In LPAR, 489503.
Huang, J., and Darwiche, A. 2004. Using DPLL for efficient OBDD construction. In SAT.Knuth, D. E. 2005. The Art of Computer Programming, Volume 4, Fascicle 2: Generating All Tuples and Permutations. AddisonWesley Professional.
Lucas, J. M.; van Baronaigien, D. R.; and Ruskey, F. 1993. On rotations and the generation of binary trees. J. Algorithms 15(3):343 366.
Panda, S.; Somenzi, F.; and Plessier, B. 1994. Symmetry detection and dynamic variable ordering of decision diagrams. In ICCAD, 628631.
Pipatsrisawat, K., and Darwiche, A. 2010. A lower bound on the size of decomposable negation normal form. In AAAI.
Prasad, M. R.; Chong, P.; and Keutzer, K. 1999. Why is ATPG easy? In DAC, 2228.
Rudell, R. 1993. Dynamic variable ordering for Ordered Binary Decision Diagrams. In ICCAD, 4247.
Somenzi, F. 2004. CUDD: CU decision diagram package. http: //vlsi.colorado.edu/?fabio/CUDD/.
Xue, Y.; Choi, A.; and Darwiche, A. 2012. Basing decisions on sentences in decision diagrams. In AAAI, 842849.
-----0
Asif, M., and Romberg, J. 2009. Dynamic updating for `1 minimization.
Beck, A., and Teboulle, M. 2009. A fast iterative shrinkage thresholding algorithm for linear inverse problems. In SIAM Journal of Imaging Sciences, volume 2, 183202.
Bertsekas, D. 2003. Nonlinear programming. Athena Scientific.
Buscema, M., and MetaNet. 1998. The theory of independent judges, in substance use and misuse.
Cai, X.; Nie, F.; Huang, H.; and Ding, C. 2011. Multi-class l2,1-norm support vector machine. In ICDM, 91100.
Cai, D.; He, X.; and Han, J. 2007. Spectral regression for efficient regularized subspace. In ICCV, 18.
Candes, E., and Tao, T. 2006. Near optimal signal recovery from random projections: universal encoding strategies? IEEE Transactions on Information Theory 52(12):5406 5425.
Candes, E., and Wakin, M. 2008. An introduction to compressive sampling. IEEE Signal Processing Magazine 25:2130.
Chen, S.; Donoho, D.; and Saunders, M. 1998. Atomic decomposition by basis pursuit. SIAM Journal on Scientific Computing 20:3361.
Donoho, D. 2004. For most large underdetermined systems of linear equations the minimal `1-norm solution is also the sparsest solution. Comm. Pure Appl. Math 59:797829.
Figueiredo, M.; Nowak, R.; and Wright, S. 2007. Gradient projection for sparse reconstruction: Application to compressed sensing and other inverse problems. 586597.
Georghiades, A.; Belhumeur, P.; and Kriegman, D. 2001.From few to many: illumination cone models for face recognition under variable lighting and pose. IEEE Transactions on PAMI 23(6):643660.
Goldberger, J.; Roweis, S.; Hinton, G.; and Salakhutdinov, R. 2004. Neighbourhood components analysis. In NIPS.
Kim, S.; Koh, K.; Lustig, M.; Boyd, S.; and Gorinevsky, D. 2007. An interior-point method for large-scale `1regularized least squares. In IEEE Journal of Selected Topics in Signal Processing, volume 1, 606617.
Liu, J.; Ji, S.; and Ye, J. 2009. SLEP: Sparse Learning with Efficient Projections. Arizona State University.
Martinez, A. 2002. Recognizing imprecisely localized, partially occluded and expression variant faces from a single sample per class. IEEE Transactions on PAMI 24(6).
Nie, F.; Huang, H.; Cai, X.; and Ding, C. 2010. Efficient and robust feature selection via joint l2,1-norms minimization. In NIPS.
Pentland, A.; Moghaddam, B.; and Starner, T. 1994. Viewbased and modular eigenspaces for face recognition. In CVPR, 8491.
Sim, T.; Baker, S.; and Bsat, M. 2002. The cmu pose, illumination, and expression (pie) database.
Wright, J.; Yang, Y.; Ganesh, A.; Sastry, S. S.; and Ma, Y.2008. Robust face recognition via sparse representation.31(2):210227.
Wright, S.; Nowak, R.; and Figueiredo, M. 2008.Sparse reconstruction by separable approximation. ICASSP 57(7):24792493.
Yang, J.; Yu, K.; and Huang, T. 2010. Supervised translation-invariant sparse coding. In CVPR, 35173524.
Yuan, M., and Lin, Y. 2006. Model selection and estimation in regression with grouped variables. Journal of the Royal Statistical Society, Series B 68:4967.
-----0
Bareinboim, E., and Pearl, J. 2012a. Causal inference by surrogate experiments: z-identifiability. In de Freitas, N., and Murphy, K., eds., Proceedings of the Twenty-Eighth Conference on Uncertainty in Artificial Intelligence (UAI), 113120. AUAI Press.
Bareinboim, E., and Pearl, J. 2012b. Transportability of causal effects: Completeness results. In Hoffmann., J., and Selman, B., eds., Proceedings of The Twenty-Sixth Conference on Artificial Intelligence (AAAI), 698704. AAAI Press.
Bareinboim, E., and Pearl, J. 2013a. Causal transportability with limited experiments. Technical Report R-408, Cognitive Systems Laboratory, Department of Computer Science, UCLA.
Bareinboim, E., and Pearl, J. 2013b. Meta-transportability of causal effects: A formal approach. In Proceedings of The Sixteenth International Conference on Artificial Intelligence and Statistics (AISTATS). JMLR (in press).
Huang, Y., and Valtorta, M. 2006. Identifiability in causal bayesian networks: A sound and complete algorithm. In Proceedings of the Twenty-First National Conference on Artificial Intelligence (AAAI), 11491156. AAAI Press.
Koller, D., and Friedman, N. 2009. Probabilistic Graphical Models: Principles and Techniques. MIT Press.
Kuroki, M., and Miyakawa, M. 1999. Identifiability criteria for causal effects of joint interventions. Journal of the Royal Statistical Society 29:105117.
Pearl, J., and Bareinboim, E. 2011. Transportability of causal and statistical relations: A formal approach. In Proceedings of the Twenty-Fifth National Conference on Artificial Intelligence (AAAI), 247254. AAAI Press.
Pearl, J., and Verma, T. 1991. A theory of inferred causation. In Allen, J.; Fikes, R.; and Sandewall, E., eds., Proceedings of the Second Conference on Principles of Knowledge Representation and Reasoning (KR). San Mateo, CA: Morgan Kaufmann. 441452.
Pearl, J. 1995. Causal diagrams for empirical research. Biometrika 82(4):669710.
Pearl, J. 2000. Causality: Models, Reasoning, and Inference. New York: Cambridge University Press. Second ed., 2009.
Pearl, J. 2012. Do-calculus revisited. In de Freitas, N., and Murphy, K., eds., Proceedings of the Twenty-Eighth Conference on Uncertainty in Artificial Intelligence (UAI), 411. AUAI Press.
Shpitser, I., and Pearl, J. 2006. Identification of joint interventional distributions in recursive semi-Markovian causal models. In Proceedings of the Twenty-First National Conference on Artificial Intelligence (AAAI), 12191226. AAAI Press.
Spirtes, P.; Glymour, C.; and Scheines, R. 2000. Causation, Prediction, and Search. Cambridge, MA: MIT Press, 2nd edition.
Tian, J., and Pearl, J. 2002. A general identification condition for causal effects. In Proceedings of the Eighteenth National Conference on Artificial Intelligence (AAAI), 567573. AAAI Press.
-----0
Agarwal, A.; Hazan, E.; Kale, S.; and Schapire, R. 2006.Algorithms for portfolio management based on the newton method. In Proceedings of the 23rd International Conference on Machine Learning, 916.
Agarwal, A.; Negahban, S.; and Wainwright, M. 2012.Stochastic optimization and sparse statistical recovery: Optimal algorithms for high dimensions. In NIPS, 15471555.
Beck, A., and Teboulle, M. 2003. Mirror descent and nonlinear projected subgradient methods for convex optimization.
Operations Research Letters 31(3):167175.Blum, A., and Kalai, A. 1997. Universal portfolios with and without transaction costs. In Proceedings of the 10th Annual Conference on Learning Theory.
Borodin, A.; El-Yaniv, R.; and Gogan, V. 2004. Can we learn to beat the best stock. Journal of Artificial Intelligence Research 21:579594.
Bottou, L. 1991. Stochastic gradient learning in neural networks. In Proceedings of Neuro-N?mes.
Bottou, L. 2010. Large-scale machine learning with stochastic gradient descent. In Proceedings of the 19th International Conference on Computational Statistics, 177187.
Boyd, S.; Parikh, N.; Chu, E.; Peleato, B.; and Eckstein, J.2011. Distributed optimization and statistical learning via the alternating direction method of multipliers. Foundations and Trends in Machine Learning 3(1):1122.
Cesa-Bianchi, N., and Lugosi, G. 2006. Prediction, Learning, and Games. Cambridge University Press.
Cover, T., and Ordentlich, E. 1996. Universal portfolios with side information. IEEE Transactions of Information Theory 42:348363.
Cover, T. 1991. Universal portfolios. Mathematical Finance 1:129.
Das, P., and Banerjee, A. 2011. Meta optimization and its application to portfolio selection. In Proceedings of the 17th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining.
Davis, M., and Norman, A. 1990. Portfolio selection with transaction costs. Mathematics of Operations Research 15(4):676713.
Duchi, J.; Singer, Y.; and Chandra, T. 2008. Efficient projections onto the L1-ball for learning in high dimensions. In Proceedings of the 25th International Conference on Machine Learning.
Helmbold, D.; Scahpire, E.; Singer, Y.; and Warmuth, M. 1998. Online portfolio selection using multiplicative weights. Mathematical Finance 8(4):325347.
Kelly, J. L. 1956. A new interpretation of information rate.Bell Systems Technical Journal 35:917926.
Li, B., and Hoi, S. 2012. On-line portfolio selection with moving average reversion. In International Conference of Machine Learning.
Magill, M., and Constantinides, G. 1976. Portfolio selection with transaction costs. Journal of Economic Theory 13(2):245263.
Markowitz, H. 1952. Portfolio selection. Journal of Finance 7:7791.
Ordentlich, E., and Cover, T. 1996. Online portfolio selection. In Proceedings of the 9th Annual Conference on Learning Theory.
Shalev-Shwartz, S.; Shamir, O.; Srebro, N.; and Sridharan, K. 2009. Stochastic convex optimization. In Proceedings of the Conference on Learning Theory (COLT).
Sharpe, W. 1964. A theory of market equilibrium. Journal of Finance 19:425442.
Tibshirani, R.; Saunders, M.; Rosset, S.; Zhu, J.; and Knight, K. 2005. Sparsity and smoothness via the fused lasso. Journal of the Royal Statistical Society Series B 91108.
-----0
Armando, A.; Castellini, C.; and Giunchiglia, E. 2000. SATbased procedures for temporal reasoning. In Proceedings of the European Conference on Planning (ECP).
Brucker, P.; Hilbig, T.; and Hurink, J. 1999. A branch and bound algorithm for a single-machine scheduling problem with positive and negative time-lags. Discrete Applied Mathematics 94(1):7799.
Cormen, T. H.; Leiserson, C. E.; Rivest, R. L.; and Stein, C.2001. Introduction to algorithms. MIT press.
Dechter, R.; Meiri, I.; and Pearl, J. 1991. Temporal constraint networks. Artificial Intelligence 49(1):6195.
Ji, M.; He, Y.; and Cheng, T. 2007. Single-machine scheduling with periodic maintenance to minimize makespan. Computers & Operations Research 34(6):17641770.
Khatib, L.; Morris, P.; Morris, R.; and Rossi, F. 2001. Temporal constraint reasoning with preferences. In Proceedings of the International Joint Conference on Artificial Intelligence (IJCAI).
Knight, R.; Rabideau, G.; Chien, S.; Engelhardt, B.; and Sherwood, R. 2001. Casper: Space exploration through continuous planning. IEEE Intelligent Systems 16(5):7075.
Kumar, T. K. S. 2003. Incremental computation of resourceenvelopes in producer-consumer models. In Proceedings of the International Conference on Principles and Practice of Constraint Programming (CP).
Kumar, T. K. S. 2004. A polynomial-time algorithm for simple temporal problems with piecewise constant domain preference functions. In Proceedings of the National Conference on Artificial Intelligence (AAAI).
Kumar, T. K. S. 2005a. On the tractability of restricted disjunctive temporal problems. In Proceedings of the International Conference on Planning and Scheduling (ICAPS).
Kumar, T. K. S. 2005b. On the tractability of smooth constraint satisfaction problems. In Proceedings of the Second International Conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (CPAIOR).
Nelson, B., and Kumar, T. K. S. 2008. CircuitTSAT: A solver for large instances of the disjunctive temporal problem. In Proceedings of the International Conference on Automated Planning and Scheduling (ICAPS).
Oddi, A., and Cesta, A. 2000. Incremental forward checking for the disjunctive temporal problem. In Proceedings of the European Conference on Artificial Intelligence (ECAI).
Pecora, F., and Cirillo, M. 2009. A constraint-based approach for plan management in intelligent environments. In Proceedings of the Workshop on Scheduling and Planning Applications at ICAPS 2009.
Planken, L.; De Weerdt, M.; and van der Krogt, R. 2008.P 3C: A new algorithm for the simple temporal problem. In Proceedings of the International Conference on Planning and Scheduling (ICAPS).
-----0
Allen, J.; Chambers, N.; Ferguson, G.; Galescu, L.; Jung, H.; Swift, M.; and Taysom, W. 2007. Plow: a collaborative task learning agent. In Proceedings of the 22nd national conference on Artificial intelligence Volume 2, AAAI07, 15141519. AAAI Press.
Chen, D. L., and Mooney, R. J. 2011. Learning to interpret natural language navigation instructions from observations.In AAAI.
Clarke, J.; Goldwasser, D.; Chang, M.-W.; and Roth, D.2010. Driving semantic parsing from the worlds response.
In Proceedings of the Fourteenth Conference on Computational Natural Language Learning (CoNLL-2010), 1827.
Dijkstra, E. W. 1979. On the foolishness of natural language programming. In Program Construction, International Summer School, 5153. London, UK: SpringerVerlag.
Gulwani, S. 2011. Automating string processing in spreadsheets using input-output examples. In Proceedings of the 38th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages, POPL 11, 317330. ACM.
Lau, T.; Wolfman, S. A.; Domingos, P.; and Weld, D. S.2003. Programming by demonstration using version space algebra. Machine Learning 53:111156.
Liang, P.; Jordan, M. I.; and Klein, D. 2010. Learning programs: A hierarchical bayesian approach. In ICML, 639 646.
Liang, P.; Jordan, M. I.; and Klein, D. 2011. Learning dependency-based compositional semantics. In ACL, 590 599.
Manshadi, M.; Keenan, C.; and Allen, J. 2012. Using the crowd to do natural language programming. In Proceeding of the Twenty-Sixth AAAI Conference on Artificial Intelligence, Workshop on Human-Computer Interaction (HCOMP-2012). AAAI.
Menon, A. K.; Tamuz, O.; Gulwani, S.; Lampson, B.; Jung, H.; and Kalai, A. T. 2013. A machine learning framework for programming by example. In the Proceedings of the 30th International Conference on Machine Learning, TO APPEAR.
Mitchell, T. M. 1982. Generalization as search. Artificial Intelligence 18.Vogel, A., and Jurafsky, D. 2010. Learning to follow navigational directions. In Proceedings of the 48th Annual Meeting of the Association for Computational Linguistics, 806814.
Zettlemoyer, L. S., and Collins, M. 2005. Learning to map sentences to logical form: Structured classification with probabilistic categorial grammars. In UAI, 658666.
Zettlemoyer, L. S., and Collins, M. 2009. Learning contextdependent mappings from sentences to logical form. In ACL/AFNLP, 976984.
-----0
Ernst, D.; Geurts, P.; and Wehenkel, L. 2005. Tree-based batch mode reinforcement learning. Journal of Machine Learning Research 6:503556.
Farahmand, A.; Ghavamzadeh, M.; Szepesvari, C.; and Mannor, S. 2009. Regularized policy iteration. Advances in Neural Information Processing Systems 21:441448.
Kroemer, O., and Peters, J. 2012. A non-parametric approach to dynamic programming. Advances in Neural Information Processing Systems 24:to appear.
Kveton, B., and Theocharous, G. 2012. Kernel-based reinforcement learning on representative states. In Proceedings of the Twenty-Sixth AAAI Conference on Artificial Intelligence, (AAAI).
Munos, R., and Moore, A. 2002. Variable resolution discretization in optimal control. Machine Learning 49(2):291 323.
Ormoneit, D., and Sen, S. 2002. Kernel-based reinforcement learning. Machine Learning 49(2):161178.
Pazis, J., and Parr, R. 2011a. Generalized value functions for large action sets. In ICML-11, 11851192. ACM.
Pazis, J., and Parr, R. 2011b. Non-Parametric Approximate Linear Programming for MDPs. In AAAI-11, 793800.AAAI Press.
Pazis, J., and Parr, R. 2013. PAC optimal exploration in continuous space markov decision processes. In AAAI-13.AAAI Press.
Petrik, M.; Taylor, G.; Parr, R.; and Zilberstein, S. 2010.Feature selection using regularization in approximate linear programs for Markov decision processes. In ICML-10, 871 878. Haifa, Israel: Omnipress.
Taylor, G., and Parr, R. 2009. Kernelized value function approximation for reinforcement learning. In ICML 09, 1017 1024. New York, NY, USA: ACM.
Wang, H.; Tanaka, K.; and Griffin, M. 1996. An approach to fuzzy control of nonlinear systems: Stability and design issues. IEEE Transactions on Fuzzy Systems 4(1):1423.
-----0
Bouveret, S., and Lang, J. 2011. A general elicitation-free protocol for allocating indivisible goods. In Walsh, T., ed., Proc. of 22nd International Joint Conference on Artificial Intelligence (IJCAI 2011). IJCAI/AAAI.
Brams, S., and Fishburn, P. 2000. Fair division of indivisible items between two people with identical preferences: Envyfreeness, Pareto-optimality, and equity. Social Choice and Welfare 17(2):247267.
Brams, S., and Kaplan, T. 2004. Dividing the indivisible.Journal of Theoretical Politics 16(2):143173.
Brams, S.; Edelman, P.; and Fishburn, P. 2003. Fair division of indivisible items. Theory and Decision 55(2):147180.
Brams, S., and Straffin, P. 1979. Prisoners dilemma and professional sports drafts. The American Mathematical Monthly 86(2):pp. 8088.
Budish, E., and Cantillon, E. 2007. Strategic behavior in multi-unit assignment problems: Theory and evidence from course allocations. In Cramton, P.; Muller, R.; Tardos, E.; and Tennenholtz, M., eds., Computational Social Systems and the Internet, number 07271 in Dagstuhl Seminar Proceedings. Internationales Begegnungsund Forschungszentrum fur Informatik (IBFI), Schloss Dagstuhl, Germany.
Budish, E.; Che, Y.-K.; Kojima, F.; and Milgrom, P. 2013.Designing random allocation mechanisms: Theory and applications. American Economic Review. Forthcoming.
Kohler, D., and Chandrasekaran, R. 1971. A Class of Sequential Games. Operations Research 19:270277.
Othman, A.; Sandholm, T.; and Budish, E. 2010. Finding approximate competitive equilibria: efficient and fair course allocation. In van der Hoek, W.; Kaminka, G.; Lesperance, 
Y.; Luck, M.; and Sen, S., eds., 9th International Conference on Autonomous Agents and Multiagent Systems (AAMAS 2010), 873880. IFAAMAS.
-----0
Alchourron, C. E.; Gardenfors, P.; and Makinson, D. 1985.On the logic of theory change: Partial meet contraction and revision functions. The Journal of Symbolic Logic 50(2):510530.
Baltag, A., and Smets, S. 2008. A qualitative theory of dynamic interactive belief revision. In Texts in Logic and Games, Vol 3. Amsterdam University Press. 958.
Darwiche, A., and Pearl, J. 1997. On the logic of iterated belief revision. Artificial Intelligence 89:129.
Delgrande, J. P., and Levesque, H. J. 2012. Belief revision with sensing and fallible actions. In Proc. KR-12, 148157.
Katsuno, H., and Mendelzon, A. O. 1991. On the difference between updating a knowledge base and revising it. In Proc.KR-91, 387394.
Levesque, H. J.; Reiter, R.; Lesperance, Y.; Lin, F.; and Scherl, R. B. 1997. GOLOG: A logic programming language for dynamic domains. J. Logic Programming 31(1-3).
Reiter, R. 1991. The frame problem in the situation calculus: a simple solution (sometimes) and a completeness result for goal regression. In Lifschitz, V., ed., Aritificial Intelligence and Mathematical Thoery of Computation: Papers in Honor of John McCarthy. Academic Press. 359380.
Reiter, R. 2001. Knowledge in Action: Logical Foundations for Specifying and Implementing Dynamical Systems. The MIT Press.
Scherl, R. B., and Levesque, H. J. 1993. The frame problem and knowledge-producing actions. In Proc. AAAI-93.
Scherl, R. B., and Levesque, H. J. 2003. Knowledge, action, and the frame problem. Artificial Intelligence 144(1-2):1 39.
Shapiro, S.; Pagnucco, M.; Lesperance, Y.; and Levesque, H. J. 2011. Iterated belief change in the situation calculus.Artificial Intelligence 175:165192.van Benthem, J. 2007. Dynamic logic for belief revision.Journal of Applied Non-classical Logics 17(2):129155.
van Ditmarsch, H.; van Der Hoek, W.; and Kooi, B. P. 2007.Dynamic epistemic logic. Springer.
-----0
Fellbaum., C. 1998. WordNet: An Electronic Lexical Database.  Cambridge, MA: MIT Press.  
Hassan, A., and Radev, D. 2010. Identifying Text Polarity Using  Random Walks. Proceeding in the Association for Computational  Linguistics (ACL). Pp: 395403.  
Islam, A., and Diana I. 2008. Semantic text similarity using  corpus-based word similarity and string similarity. ACM  Transactions on Knowledge Discovery from Data (TKDD).  
Izard, C. E. 1971. The face of emotion. New York: AppletonCentury-Crofts.  
Kim, S. M., and Hovy, E. 2004. Determining the sentiment of  opinions. Proceeding of the Conference on Computational  Linguistics (COLING). Pp: 13671373.  
Landauer, T. K., Foltz, P. W.,  and Laham, D. 1998. Introduction  to Latent Semantic Analysis. Discourse Processes. 259-284.  
Maas, A. L., Daly, R. E., Pham, P. T., Huang, D., Ng, A. Y., and  Potts, C. 2011. Learning Word Vectors for Sentiment Analysis.  Proceeding in the Association for Computational Linguistics  (ACL). Pp:142-150.  
Marneffe, M., Manning, C., and Potts, C. 2010. "Was it good? It  was provocative." Learning the meaning of scalar adjectives.  Proceeding in the Association for Computational Linguistics  (ACL). Pp: 167176.  
Mohtarami, M., Amiri, H., Lan, M., and Tan, C. L. 2011.  Predicting the Uncertainty of Sentiment Adjectives in Indirect  Answers. 20th ACM Conference on Information and Knowledge  Management (CIKM). Pp. 2485-2488.  
Mohtarami, M., Amiri, H., Lan, M., Tran, T. P., and Tan, C. L.  2012. Sense Sentiment Similarity: An Analysis. Proceeding of the  Conference on Artificial Intelligence (AAAI).
Neviarouskaya, A., Prendinger, H., and Ishizuka, M. 2009.  SentiFul: Generating a Reliable Lexicon for Sentiment Analysis.  Proceeding of the conference on Affective Computing and  Intelligent Interaction (ACII). 363-368.  
Neviarouskaya, A., Prendinger, H., and Ishizuka, M. 2007.  Textual Affect Sensing for Sociable and Expressive Online  Communication. Proceedings of the conference on Affective  Computing and Intelligent Interaction (ACII). Pp: 218-229.  
Ortony, A., and Turner, T. J. 1990. What's Basic About Basic  Emotions. American Psychological Association. 97(3), 315-331.   Potts, C. 2011. On the negativity of negation. In Nan Li and  David Lutz, eds., Proceedings of Semantics and Linguistic  Theory 20, 636-659.  
Turney, P., and Littman, M. 2003. Measuring Praise and  Criticism: Inference of Semantic Orientation from Association.  ACM Transactions on Information Systems, 21(4), 315346.  
Wilson, T., Wiebe, J., and Hoffmann, P. 2005. Recognizing  contextual polarity in phrase-level sentiment analysis. Human  Language Technology Conference and Conference on Empirical  Methods in Natural Language Processing (HLT-EMNLP). Pp:  347354.        
-----0
Adams, R. P.; Ghahramani, Z.; and Jordan, M. I. 2010. Treestructured stick breaking for hierarchical data. Advances in Neural Information Processing Systems 23:1927.
Blei, D. M.; Griffiths, T. L.; and Jordan, M. I. 2010. The nested chinese restaurant process and bayesian nonparametric inference of topic hierarchies. Journal of the ACM 57(2):7.
Blei, D. M.; Ng, A. Y.; and Jordan, M. I. 2003. Latent dirichlet allocation. the Journal of machine Learning research 3:9931022.
Bloom, K.; Garg, N.; and Argamon, S. 2007. Extracting appraisal expressions. In Proceedings of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies, 308315. Association for Computational Linguistics.
Chen, Y., and Xie, J. 2008. Online consumer review: Wordof-mouth as a new element of marketing communication mix.Management Science 54(3):477491.
Eguchi, K., and Lavrenko, V. 2006. Sentiment retrieval using generative models. In Proceedings of the Conference on Empirical Methods in Natural Language Processing, 345 354. Association for Computational Linguistics.
Jin, W.; Ho, H. H.; and Srihari, R. K. 2009. Opinionminer: a novel machine learning system for web opinion mining and extraction. In Proceedings of the 15th ACM SIGKDD international conference on Knowledge discovery and data mining, 11951204. ACM.
Jo, Y., and Oh, A. H. 2011. Aspect and sentiment unification model for online review analysis. In Proceedings of the fourth ACM international conference on Web search and data mining, 815824. ACM.
Kawamae, N. 2012. Hierarchical approach to sentiment analysis. In IEEE Sixth International Conference on Semantic Computing (ICSC), 138145. IEEE.
Kennedy, A., and Inkpen, D. 2006. Sentiment classification of movie reviews using contextual valence shifters. Computational Intelligence 22(2):110125.
Kessler, J. S., and Nicolov, N. 2009. Targeting sentiment expressions through supervised ranking of linguistic configurations. In Proceedings of the third international AAAI conference on weblogs and social media, 9097. AAAI.
Kim, J. H.; Kim, D.; Kim, S.; and Oh, A. 2012. Modeling topic hierarchies with the recursive chinese restaurant process.In Proceedings of the 21st ACM international conference on Information and knowledge management, 783792. ACM.
Li, W., and McCallum, A. 2006. Pachinko allocation: Dagstructured mixture models of topic correlations. In Proceedings of the 23rd international conference on Machine learning, 577584. ACM.
Li, F.; Huang, M.; and Zhu, X. 2010. Sentiment analysis with global topics and local dependency. In Proceedings of the Twenty-Fourth AAAI Conference on Artificial Intelligence, 13711376. AAAI.
Lin, C., and He, Y. 2009. Joint sentiment/topic model for sentiment analysis. In Proceedings of the 18th ACM conference on Information and knowledge management, 375384.ACM.
Lin, C.; He, Y.; Everson, R.; and Ruger, S. 2012.Weakly supervised joint sentiment-topic detection from text.Knowledge and Data Engineering, IEEE Transactions on 24(6):11341145.
Moghaddam, S., and Ester, M. 2012. Aspect-based opinion mining from online reviews. Tutorial at SIGIR Conference.
Mukherjee, A., and Liu, B. 2012. Aspect extraction through semi-supervised modeling. In Proceedings of the 50th Annual Meeting of the Association for Computational Linguistics, 339348. Association for Computational Linguistics.
San Pedro, J.; Yeh, T.; and Oliver, N. 2012. Leveraging user comments for aesthetic aware image search reranking. In Proceedings of the 21st international conference on World Wide Web, 439448. ACM.
Shi, B., and Chang, K. 2008. Generating a concept hierarchy for sentiment analysis. In IEEE International Conference on Systems, Man and Cybernetics, 312317. IEEE.
Titov, I., and McDonald, R. 2008. Modeling online reviews with multi-grain topic models. In Proceedings of the 17th international conference on World Wide Web, 111120. ACM.
Turney, P. D., and Littman, M. L. 2003. Measuring praise and criticism: Inference of semantic orientation from association.
In ACM Transactions on Information Systems, volume 21, 315346. ACM.Wei, W., and Gulla, J. A. 2010. Sentiment learning on product reviews via sentiment ontology tree. In Proceedings of the 48th Annual Meeting of the Association for Computational Linguistics, 404413. Association for Computational Linguistics.
Wilson, T.; Wiebe, J.; and Hoffmann, P. 2009. Recognizing contextual polarity: An exploration of features for phrase-level sentiment analysis. Computational linguistics 35(3):399433.
-----0
Bartholdi, J., and Orlin, J. 1991. Single transferable vote resists strategic voting. Social Choice and Welfare 8(4):341 354.
Bartholdi, J.; Tovey, C.; and Trick, M. 1989. The computational difficulty of manipulating an election. Social Choice and Welfare 6(3):227241.
Bartholdi, J.; Tovey, C.; and Trick, M. 1992. How hard is it to control an election. Mathematical and Computer Modeling 16(8-9):2740.
Betzler, N.; and Dorn B. 2010. Towards a dichotomy of finding possible winners in elections based on scoring rules.Journal of Computer and System Sciences 76(8):812836.
Betzler, N.; Niedermeier, R.; and Woeginger, G. 2011. Unweighted coalitional manipulation under the Borda rule is NP-hard. In Walsh, T., ed., Proceedings of the 22nd International Joint Conference on Artificial Intelligence (IJCAI 2011). International Joint Conference on Artificial Intelligence.
Davies, J.; Katsirelos, G.; Narodytska, N.; and Walsh, T.2011. Complexity of and algorithms for Borda manipulation. In Burgard, W., and Roth, D., eds., Proceedings of the Twenty-Fifth AAAI Conference on Artificial Intelligence (AAAI 2011). AAAI Press.
Duggan, J. 1996. A geometric proof of Gibbards random dictatorship theorem. Economic Theory 7(2):365369.
Faliszewski, P., and Procaccia, A. 2010. AIs war on manipulation: Are we winning? AI Magazine 31(4):5364.
Faliszewski, P.; Hemaspaandra, E.; and Hemaspaandra, L.2010. Using complexity to protect elections. Communications of the ACM 53(11):7482.
Faliszewski, P.; Hemaspaandra, E.; and Schnoor, H. 2008.Copeland voting: ties matter. In Padgham, L.; Parkes, D.; 
Muller, J.; and Parsons, S., eds., 7th International Joint Conference on Autonomous Agents and Multiagent Systems (AAMAS 2008), 983990.
Gaspers, S.; Kim, E. J.; Ordyniak, S.; Saurabh, S.; and Szeider, S. 2012. Dont be strict in local search! In Hoffmann, J., and Selman, B., eds., Proceedings of the 26th AAAI Conference on Artificial Intelligence (AAAI 2012). AAAI Press.
Kohli, R.; Krishnamurti, R.; and Mirchandani, P.: 1994. The Minimum Satisfiability Problem. SIAM J. Discrete Math.7(2): 275283.
McGarvey, D. 1953. A theorem on the construction of voting paradoxes. Econometrica 21(4):608610.
Obraztsova, S., and Elkind, E. 2011. On the complexity of voting manipulation under randomized tie-breaking. In Walsh, T., ed., Proceedings of the 22nd International Joint Conference on Artificial Intelligence (IJCAI 2011), 319 324. IJCAI/AAAI.
Obraztsova, S.; Elkind, E.; and Hazon, N. 2011. Ties matter: complexity of voting manipulation revisited. In Sonenberg, L.; Stone, P.; Tumer, K.; and Yolum, P., eds., 10th International Conference on Autonomous Agents and Multiagent Systems (AAMAS 2011), 7178.
Schaefer, T. J. 1978. The complexity of satisfiability problems. In Lipton, R. J.; Burkhard, W. A.; Savitch, W. J.; Friedman, E. P.; and Aho, A. V., eds., 10th Annual ACM Symposium on Theory of Computing (STOC 1978), 216 226.
Schulze, M. 2003. A new monotonic and clone-independent single-winner election method. Voting matters 17(1):919.
Tideman, N., and Plassmann, F. 2012. Modeling the outcomes of vote-casting in actual elections. In Felsenthal, D., and Machover, M., eds., Electoral Systems: Paradoxes, Assumptions, and Procedures. Springer.
Tideman, T. N. 1987. Independence of clones as a criterion for voting rules. Social Choice and Welfare 4(3):185206.
Walsh, T. 2010. An empirical study of the manipulability of single transferable voting. In Proceedings of the 19th European Conference on Artificial Intelligence, 257262.
Walsh, T., and Xia, L. 2012. Lot-based voting rules. In Proceedings of the 11th International Conference on Autonomous Agents and Multiagent Systems (AAMAS 2012), 603610.
Xia, L.; Zuckerman, M.; Procaccia, A.; Conitzer, V.; and Rosenschein, J. 2009. Complexity of unweighted coalitional manipulation under some common voting rules. In Boutilier, C., ed., Proceedings of the 21st International Joint Conference on Artificial Intelligence (IJCAI 2009), 348353. International Joint Conference on Artificial Intelligence.
Xia, L.; Conitzer, V.; and Procaccia, A. 2010. A scheduling approach to coalitional manipulation. In Parkes, D.; Dellarocas, C.; and Tennenholtz, M., eds., Proceedings 11th ACM Conference on Electronic Commerce (EC-2010), 275284.
Xia, L. 2011. Computational Voting Theory: GameTheoretic and Combinatorial Aspects. Ph.D. Dissertation, Department of Computer Science, Duke University.
-----0
Garey, M. R., and Johnson, D. S. 1979. Computers and Intractability: A Guide to the Theory of NP-Completeness.W. H. Freeman.
Goldreich, O. 1984. Finding the shortest move-sequence in the graph-generalized 15-puzzle is np-hard. Laboratory for Computer Science, Massachusetts Institute of Technology, unpublished manuscript.
Goraly, G., and Hassin, R. 2010. Multi-color pebble motion on graph. Algorithmica 58:610636.
Kornhauser, D.; Miller, G.; and Spirakis, P. 1984. Coordinating pebble motion on graphs, the diameter of permutation groups, and applications. In Proceedings of the 25th Annual Symposium on Foundations of Computer Science (FOCS 84), 241250.
Loyd, S. 1959. Mathematical Puzzles of Sam Loyd. New York: Dover.
Ratner, D., and Warmuth, M. 1990. The (n2 ? 1)-puzzle and related relocation problems. Journal of Symbolic Computation 10:111137.
Ryan, M. R. K. 2008. Exploiting subgraph structure in multi-robot path planning. Journal of Artificial Intelligence Research 31:497542.
Standley, T., and Korf, R. 2011. Complete algorithms for cooperative pathfinding problems. In Twenty-Second International Joint Conference on Artificial Intelligence, 668673.
Story, E. W. 1879. Note on the 15 puzzle. American Journal of Mathematics 2:399404.
Surynek, P. 2010. An optimization variant of multi-robot path planning is intractable. In The Twenty-Fourth AAAI Conference on Artificial Intelligence (AAAI-10), 1261 1263.
Yu, J., and LaValle, S. M. 2012. Multi-agent path planning and network flow. In The Tenth International Workshop on Algorithmic Foundations of Robotics.
Yu, J., and LaValle, S. M. 2013. Planning optimal paths for multiple robots on graphs. In Proceedings IEEE International Conference on Robotics & Automation. to appear.
Yu, J. 2012. Diameters of permutation groups on graphs and linear time feasibility test of pebble motion problems.arXiv:1205.5263.
-----0
Antoniak, C. E. 1974. Mixtures of Dirichlet processes with applications to Bayesian nonparametric problems. Ann.Statist. 2(6):11521174.
Blackwell, D., and MacQueen, J. B. 1973. Ferguson distributions via Polya urn schemes. Ann. Statist. 1(2):353355.
Calinon, S.; Li, Z.; Alizadeh, T.; Tsagarakis, N. G.; and Caldwell, D. G. 2012. Statistical dynamical systems for skills acquisition in humanoids. In Proc. IEEE Intl Conf. on Humanoid Robots (Humanoids), 323329.
Calinon, S.; Kormushev, P.; and Caldwell, D. G. 2013. Compliant skills acquisition and multi-optima policy search with em-based reinforcement learning. Robotics and Autonomous Systems 61(4):369379.
Calinon, S.; Pervez, A.; and Caldwell, D. G. 2012. Multioptima exploration with adaptive Gaussian mixture model.In Proc. Intl Conf. on Development and Learning (ICDLEpiRob).
Corke, P. I. 2011. Robotics, Vision & Control: Fundamental Algorithms in Matlab. Springer.
Daniel, C.; Neumann, G.; and Peters, J. 2012. Learning concurrent motor skills in versatile solution spaces. In Proc. IEEE/RSJ Intl Conf. on Intelligent Robots and Systems (IROS), 35913597.
Dayan, P., and Hinton, G. E. 1997. Using expectationmaximization for reinforcement learning. Neural Comput.9(2):271278.
Dempster, A. P.; Laird, N. M.; and Rubin, D. B. 1977. Maximum likelihood from incomplete data via the EM algorithm.Journal of the Royal Statistical Society B 39(1):138.
Doshi-Velez, F.; Wingate, D.; Roy, N.; and Tenenbaum, J.2010. Nonparametric bayesian policy priors for reinforcement learning. In Neural Information Processing Systems (NIPS).
Escobar, M. D., and West, M. 1995. Bayesian density estimation and inference using mixtures. J. Amer. Statist. Assoc.90(430):577588.
Ferguson, T. S. 1973. A Bayesian analysis of some nonparametric problems. Ann. Statist. 1:209230.
Ganesh, G., and Burdet, E. 2013. Motor planning explains human behaviour in tasks with multiple solutions. Robotics and Autonomous Systems 61(4):362368.
Ghahramani, Z., and Jordan, M. I. 1994. Supervised learning from incomplete data via an EM approach. In Cowan, J. D.; Tesauro, G.; and Alspector, J., eds., Advances in Neural Information Processing Systems, volume 6, 120127.Morgan Kaufmann Publishers, Inc.
Grollman, D. H., and Jenkins, O. C. 2010. Incremental learning of subtasks from unsegmented demonstration. In International Conference on Intelligent Robots and Systems (IROS 2010), 261266.
Kober, J., and Peters, J. 2011. Policy search for motor primitives in robotics. Machine Learning 84(1):171203.
Kobilarov, M. 2012. Cross-entropy motion planning. The International Journal of Robotics Research 31(7):855871.
Latash, M. L.; Scholz, J. P.; and Schoener, G. 2002. Motor control strategies revealed in the structure of motor variability. Exerc. Sport Sci. Rev. 30(1):2631.
Li, H.; Liao, X.; and Carin, L. 2009. Multi-task reinforcement learning in partially observable stochastic environments. The Journal of Machine Learning Research 10(May):11311186.
Muller, H., and Sternad, D. 2004. Decomposition of variability in the execution of goal-oriented tasks: three components of skill improvement. Journal of Experimental Psychology: Human Perception and Performance 30(1):212.
Neal, R. M. 2000. Markov chain sampling methods for Dirichlet process mixture models. Journal of Computational and Graphical Statistics 9(2):249265.
Neumann, G. 2011. Variational inference for policy search in changing situations. In Proceedings of the 28th International Conference on Machine Learning (ICML 2011), 817 824.
Peters, J., and Schaal, S. 2007. Using reward-weighted regression for reinforcement learning of task space control. In Proc. IEEE Intl Symp. on Adaptive Dynamic Programming and Reinforcement Learning (ADPRL), 262267.
Rasmussen, C. E. 2000. The infinite Gaussian mixture model. In Advances in Neural Information Processing Systems (NIPS) 12, 554560. MIT Press.
Rueckstiess, T.; Sehnke, F.; Schaul, T.; Wierstra, D.; Sun, Y.; and Schmidhuber, J. 2010. Exploring parameter space in reinforcement learning. Paladyn. Journal of Behavioral Robotics 1(1):1424.
Scholz, J. P., and Schoener, G. 1999. The uncontrolled manifold concept: identifying control variables for a functional task. Experimental Brain Research 126(3):289306.
Sternad, D.; Park, S.-W.; Mueller, H.; and Hogan, N. 2010.Coordinate dependence of variability analysis. PLoS Computational Biology 6(4):116.
Strens, M., and Moore, A. 2002. Policy search using paired comparisons. Journal of Machine Learning Research 3(1):921950.
Stulp, F., and Sigaud, O. 2012. Path integral policy improvement with covariance matrix adaptation. In Proc. Intl Conf.on Machine Learning (ICML).
Sutton, R., and Barto, A. 1998. Reinforcement learning: An introduction, volume 1. Cambridge Univ Press.
-----0
Albu-Schaffer, A.; Haddadin, S.; Ott, C.; Stemmer, A.; Wimbck, T.; and Hirzinger, G. 2007. The DLR lightweight robot design and control concepts for robots in human environments. Industrial Robot: An International Journal 34(5):376385.
Billard, A.; Calinon, S.; Dillmann, R.; and Schaal, S. 2008.Robot programming by demonstration. In Siciliano, B., and Khatib, O., eds., Springer Handbook of Robotics. Secaucus, NJ, USA: Springer. 13711394.
Burdet, E.; Osu, R.; Franklin, D.; Milner, T.; and Kawato, M.2001. The central nervous system stabilizes unstable dynamics by learning optimal impedance. Nature 414(6862):446 449.
Calinon, S.; Evrard, P.; Gribovskaya, E.; Billard, A.; and Kheddar, A. 2009. Learning collaborative manipulation tasks by demonstration using a haptic interface. In Intl. Conf.on Advanced Robotics, 16.
Calinon, S.; Li, Z.; Alizadeh, T.; Tsagarakis, N.; and Caldwell, D. 2012. Statistical dynamical systems for skills acquisition in humanoids. In Intl. Conf. on Humanoid Robots, 323329.
Calinon, S.; Sardellitti, I.; and Caldwell, D. 2010. Learningbased control strategy for safe human-robot interaction exploiting task and robot redundancies. In Intl. Conf. on Intelligent Robots and Systems, 249254.
Erickson, D.; Weber, M.; and Sharf, I. 2003. Contact stiffness and damping estimation for robotic systems. Intl. Journal of Robotics Research 22(1):4157.
Evrard, P., and Kheddar, A. 2009. Homotopy switching model for dyad haptic interaction in physical collaborative tasks. In EuroHaptics, 4550.
Flacco, F., and Luca, A. D. 2011. Residual-based stiffness estimation in robots with flexible transmissions. In Intl. Conf. on Robotics and Automation, 55415547.
Ganesh, G.; Albu-Schaffer, A.; Haruno, M.; Kawato, M.; and Burdet, E. 2010. Biomimetic motor behavior for simultaneous adaptation of force, impedance and trajectory in interaction tasks. In Intl. Conf. on Robotics and Automation, 27052711.
Gomi, H., and Kawato, M. 1996. Equilibrium-point control hypothesis examined by measured arm stiffness during multijoint movement. Science 272(5258):117120.
Gribovskaya, E.; Kheddar, A.; and Billard, A. 2011. Motion learning and adaptive impedance for robot control during physical interaction with humans. In Intl. Conf. on Robotics and Automation, 43264332.
Groten, R.; Feth, D.; Klatzky, R.; and Peer, A. 2013. The role of haptic feedback for the integration of intentions in shared task execution. Trans. on Haptics 6(1):94105.
Higham, N. 1988. Computing a nearest symmetric positive semidefinite matrix. Linear Algebra and its Applications 103:103118.
Hogan, N. 1985. Impedance control: An approach to manipulation: Part i, ii, iii. Journal of Dynamic Systems, Measurement, and Control 107(1):124.
Kalakrishnan, M.; Righetti, L.; Pastor, P.; and Schaal, S.2011. Learning force control policies for compliant manipulation. In Intl. Conf. on Intelligent Robots and Systems, 46394644.
Kronander, K., and Billard, A. 2012. Online learning of varying stiffness through physical human-robot interaction. In Intl. Conf. on Robotics and Automation, 18421849.
Lee, D., and Ott, C. 2011. Incremental kinesthetic teaching of motion primitives using the motion refinement tube.Autonomous Robots 31:115131.
Mutlu, B.; Terrell, A.; and Huang, C. 2013. Coordination mechanisms in human-robot collaboration. In ACM/IEEE Intl. Conf. on Human-Robot Interaction (HRI) Workshop on Collaborative Manipulation, 16.
Reed, K., and Peshkin, M. 2008. Physical collaboration of human-human and human-robot teams. Trans. on Haptics 1(2):108120.
Rooks, B. 2006. The harmonious robot. Industrial Robot: An International Journal 33(2):125130.
Rozo, L.; Jimenez, P.; and Torras, C. 2010. Sharpening haptic inputs for teaching a manipulation skill to a robot. In Intl. Conf. on Applied Bionics and Biomechanics, 370377.
Rozo, L.; Jimenez, P.; and Torras, C. 2013. A robot learning from demonstration framework to perform force-based manipulation tasks. Intelligent Service Robotics 6(1):3351.
Schreiber, G.; Stemmer, A.; and Bischoff, R. 2010. The fast research interface for the KUKA lightweight robot. In ICRA-Workshop on Innovative Robot Control Architectures for Demanding (Research) Applications, 1521.
Strabala, K.; Lee, M.; Dragan, A.; Forlizzi, J.; and Srinivasa, S. 2012. Learning the communication of intent prior to physical collaboration. In Intl. Symposium on Robot and Human Interactive Communication, 968973.
Thobbi, A.; Gu, Y.; and Sheng, W. 2011. Using human motion estimation for human-robot cooperative manipulation. In Intl. Conf. on Intelligent Robots and Systems, 28732878.
Wilson, A., and Bobick, A. 1999. Parametric hiddenMarkov models for gesture recognition. Pattern Analysis and Machine Intelligence 21(9):884900.
-----0
Berenson, D.; Srinivasa, S.; Ferguson, D.; Romea, A. C.; and Kuffner, J. 2009. Manipulation planning with workspace goal regions. In IEEE International Conference on Robotics and Automation, 618624.
Beygelzimer, A.; Kakade, S.; and Langford, J. 2006. Cover trees for nearest neighbor. In Interantional Conference on Machince Learning, 97104.
Choset, H.; Lynch, K. M.; Hutchinson, S.; Kantor, G.; Burgard, W.; Kavraki, L. E.; and Thrun, S. 2005. Principles of Robot Motion: Theory, Algorithms, and Implementations. MIT Press.
Sucan, I. A., and Kavraki, L. E. 2012. A sampling-based tree planner for systems with complex dynamics. IEEE Transactions on Robotics 28(1):116131.
Dalibard, S., and Laumond, J.-P. 2008. Control of probabilistic diffusion in motion planning. In International Workshop on Algorithmic Foundations of Robotics, volume 57 of Springer Tracts in Advanced Robotics. 467481.
de Berg, M.; Cheong, O.; van Kreveld, M.; and Overmars, M. H. 2008. Computational Geometry: Algorithms and Applications.Springer-Verlag, 3 edition.
Gochev, K.; Safonova, A.; and Likhachev, M. 2012. Planning with adaptive dimensionality for mobile manipulation. In IEEE International Conference on Robotics and Automation, 29442951.
Hsu, D.; Kindel, R.; Latombe, J. C.; and Rock, S. 2002. Randomized kinodynamic motion planning with moving obstacles. International Journal of Robotics Research 21(3):233255.
Jaillet, L.; Cortes, J.; and Simeon, T. 2008. Transition-based RRT for path planning in continuous cost spaces. In IEEE/RSJ International Conference on Intelligent Robots and Systems, 21452150.
Karaman, S., and Frazzoli, E. 2010. Optimal kinodynamic motion planning using incremental sampling-based methods. In IEEE Conference on Decision and Control, 76817687.
Kiesel, S.; Burns, E.; and Ruml, W. 2012. Abstraction-guided sampling for motion planning. In Symposium on Combinatorial Search. also as UNH CS Technical Report 12-01.
Ladd, A. M., and Kavraki, L. E. 2005. Motion planning in the presence of drift, underactuation and discrete system changes. In Robotics: Science and Systems, 233241.
LaValle, S. M., and Kuffner, J. J. 2001. Randomized kinodynamic planning. International Journal of Robotics Research 20(5):378 400.
LaValle, S. M. 2006. Planning Algorithms. Cambridge, MA: Cambridge University Press.
LaValle, S. M. 2011. Motion planning: The essentials. IEEE Robotics & Automation Magazine 18(1):7989.
Li, Y., and Bekris, K. E. 2011. Learning approximate cost-to-go metrics to improve sampling-based motion planning. In IEEE International Conference on Robotics and Automation, 41964201.
Likhachev, M., and Stentz, A. 2008. R* search. In National Conference on Artificial Intelligence, volume 1, 344350.
Plaku, E.; Kavraki, L. E.; and Vardi, M. Y. 2010. Motion planning with dynamics by a synergistic combination of layers of planning. IEEE Transactions on Robotics 26(3):469482.Plaku, E. 2012. Guiding sampling-based motion planning by forward and backward discrete search. In International Conference on Intelligent Robots and Applications, volume 7508 of Lecture Notes in Artificial Intelligence. 289300.
Shewchuk, J. R. 2002. Delaunay refinement algorithms for triangular mesh generation. Computational Geometry: Theory and Applications 22(1-3):2174.
Shkolnik, A.; Walter, M.; and Tedrake, R. 2009. Reachabilityguided sampling for planning under differential constraints. In IEEE International Conference on Robotics and Automation, 28592865.
-----0
Canny, J. 1987. A new algebraic method for robot motion planning and real geometry. In Foundations of Computer 
Science, 1987., 28th Annual Symposium on, 3948.Chazelle, B. 1987. Approximation and Decomposition of Shapes. Lawrence Erlbaum Associates. chapter 4, 145185.
Cimatti, A.; Roveri, M.; Schuppan, V.; and Tchaltsev, A.2008. Diagnostic information for realizability. In Verification, Model Checking, and Abstract Interpretation, 5267.
Culberson, J. C. 1997. Sokoban is pspace-complete. Technical Report TR 97-02, The University of Alberta, Edmonton, AB.
Dowling, W. F., and Gallier, J. H. 1984. Linear-time algorithms for testing the satisfiability of propositional horn formulae. The Journal of Logic Programming 1(3):267  284.
Gobelbecker, M.; Keller, T.; Eyerich, P.; Brenner, M.; and Nebel, B. 2010. Coming up with good excuses: What to do when no plan can be found. In Proceedings of the Twentieth International Conference on Automated Planning and Scheduling, 8188.
Hauser, K. 2012. The minimum constraint removal problem with three robotics applications. In Proc. Workshop on the Algorithmic Foundations of Robotics.
Hearn, R., and Demaine, E. 2005. Pspace-completeness of sliding-block puzzles and other problems through the nondeterministic constraint logic model of computation. Theoretical Computer Science 343(1):7296.
Jaumard, B., and Simeone, B. 1987. On the complexity of the maximum satisfiability problem for horn formulas. Information Processing Letters 26(1):1  4.LaValle, S. M. 2006. Planning Algorithms. Cambridge, UK: Cambridge University Press. Also available at http://msl.cs.uiuc.edu/planning/.
McCarthy, Z.; Bretl, T.; and Hutchinson, S. 2012. Proving path non-existence using sampling and alpha shapes. In Proc. IEEE International Conference on Robotics and Automation, 25632569.
Reif, J. 1979. Complexity of the movers problem and generalizations extended abstract. In Proceedings of the 20th Annual IEEE Conference on Foundations of Computer Science, 421427.
Zhang, L.; Kim, Y.; and Manocha, D. 2008. A simple path non-existence algorithm using c-obstacle query. In Proc. Workshop on the Algorithmic Foundations of Robotics, 269 284.
-----0
Abbeel, P.; Quigley, M.; and Ng, A. Y. 2006. Using Inaccurate Models in Reinforcement Learning. In Proceedings of the International Conference on Machine Learning.
Atkeson, C. G., and Santamar?a, J. C. 1997. A Comparison of Direct and Model-Based Reinforcement Learning. In Proceedings of the International Conference on Robotics and Automation.
Bagnell, J. A., and Schneider, J. G. 2001. Autonomous Helicopter Control using Reinforcement Learning Policy Search Methods. In Proceedings of the International Conference on Robotics and Automation.
Daniel, C.; Neumann, G.; and Peters, J. 2012. Hierarchical Relative Entropy Policy Search. In International Conference on Artificial Intelligence and Statistics.
Deisenroth, M. P., and Rasmussen, C. E. 2011. PILCO: A Model-Based and Data-Efficient Approach to Policy Search.In Proceedings of the International Conference on Machine Learning.
Deisenroth, M. P.; Turner, R.; Huber, M.; Hanebeck, U. D.; and Rasmussen, C. E. 2012. Robust Filtering and Smoothing with Gaussian Processes. IEEE Transactions on Automatic Control 57(7):18651871.
Deisenroth, M. P.; Rasmussen, C. E.; and Fox, D. 2011.Learning to Control a Low-Cost Manipulator using DataEfficient Reinforcement Learning. In Robotics: Science & Systems.
Ijspeert, A. J., and Schaal, S. 2003. Learning Attractor Landscapes for Learning Motor Primitives. In Advances in Neural Information Processing Systems.
Kober, J., and Peters, J. 2010. Policy Search for Motor Primitives in Robotics. Machine Learning 133.
Kober, J.; Mulling, K.; Kroemer, O.; Lampert, C. H.; Scholkopf, B.; and Peters, J. 2010. Movement Templates for Learning of Hitting and Batting. In Proceedings of the International Conference on Robotics and Automation.
Kober, J.; Oztop, E.; and Peters, J. 2010. Reinforcement Learning to adjust Robot Movements to New Situations. In Robotics: Science & Systems.
Kohl, N., and Stone, P. 2003. Policy Gradient Reinforcement Learning for Fast Quadrupedal Locomotion. In Proceedings of the International Conference on Robotics and Automation.
Kormushev, P.; Calinon, S.; and Caldwell, D. G. 2010.Robot Motor Skill Coordination with EM-based Reinforcement Learning. In Proceedings of the International Conference on Intelligent Robots and Systems.
Neumann, G. 2011. Variational Inference for Policy Search in Changing Situations. In Proceedings of the International Conference on Machine Learning.
Peters, J., and Schaal, S. 2008. Reinforcement Learning of Motor Skills with Policy Gradients. Neural Networks (4):68297.
Peters, J.; Mulling, K.; and Altun, Y. 2010. Relative Entropy Policy Search. In Proceedings of the National Conference on Artificial Intelligence.
Rasmussen, C. E. and Williams, C. K. I. 2006. Gaussian Processes for Machine Learning. MIT Press.
Schaal, S.; Peters, J.; Nakanishi, J.; and Ijspeert, A. J. 2003.Learning Movement Primitives. In International Symposium on Robotics Research.
Schneider, J. G. 1997. Exploiting Model Uncertainty Estimates for Safe Dynamic Control Learning. In Advances in Neural Information Processing Systems.
Snelson, E., and Ghahramani, Z. 2006. Sparse Gaussian Processes using Pseudo-Inputs. In Advances in Neural Information Processing Systems.
Theodorou, E.; Buchli, J.; and Schaal, S. 2010. Reinforcement Learning of Motor Skills in High Dimensions: a Path Integral Approach. In Proceedings of the International Conference on Robotics and Automation.
Williams, R. J. 1992. Simple Statistical Gradient-Following Algorithms for Connectionist Reinforcement Learning. Machine Learning 8:229256.
-----0
Abbeel, P.; Coates, A.; Quigley, M.; and Ng, A. Y. 2007. An application of reinforcement learning to aerobatic helicopter flight. In Proceedings of Neural Information Processing Systems 19.
Boer, P.-T. D.; Kroese, D. P.; Mannor, S.; and Rubinstein, R. Y. 2005. A tutorial on the cross-entropy method. Annals of Operations Research 134.
Bubeck, S., and Munos, R. 2010. Open loop optimistic planning. In Conference on Learning Theory.
Bubeck, S.; Munos, R.; Stoltz, G.; and Szepesvari, C. 2008.Online optimization of ?-armed bandits. In Proceedings of Advances in Neural Information Processing Systems 22, volume 22, 201208.
Costa, A.; Jones, O. D.; and Kroese, D. 2007. Convergence properties of the cross-entropy method for discrete optimization. Operations Research Letters 35(5):573  580.
Erez, T.; Tassa, Y.; and Todorov, E. 2011. Infinite-horizon model predictive control for periodic tasks with contacts. In Proceedings of Robotics: Science and Systems.
Erez, T. 2011. Optimal Control for Autonomous Motor Behavior. Ph.D. Dissertation, Washington University in Saint Louis.
Evans, G. E.; Keith, J. M.; and Kroese, D. P. 2007. Parallel cross-entropy optimization. In 2007 Winter Simulation Conference, 21962202. IEEE.
Gordon, G. J. 1995. Stable function approximation in dynamic programming. In The Twelfth International Conference on Machine Learning, 261268.
Kearns, M.; Mansour, S.; and Ng, A. 1999. A sparse sampling algorithm for near-optimal planning in large Markov decision processes. In Proceedings of International Joint Conference on Artificial Intelligence.
Kobilarov, M. 2011. Cross-entropy randomized motion planning. In Proceedings of Robotics: Science and Systems.
Kobilarov, M. 2012. Cross-entropy motion planning. International Journal of Robotics.
Ladd, A. M., and Kavraki, L. E. 2005. Motion planning in the presence of drift, underactuation and discrete system changes. In Proceedings of In Robotics: Science and Systems I, 233241.
Manchester, I.; Mettin, U.; Iida, F.; and Tedrake, R. 2009.Stable dynamic walking over rough terrain : Theory and experiment. In 14th International Symposium on Robotics Research : Lucerne, Switzerland, 116. Springer-Verlag.
Margolin, L. 2005. On the convergence of the cross-entropy method. Annals of Operations Research 134(1):201214.PyODE. 2010. version 2010-03-22.
Rubinstein, R. Y. 1997. Optimization of computer simulation models with rare events. European Journal of Operations Research 99:89112.
Rubinstein, R. Y. 1999. The cross entropy method for combinatorial and continuous optimization. Methodology And Computing In Applied Probability 1:127190.
Santamar?a, J. C.; Sutton, R. S.; and Ram, A. 1996. Experiments with reinforcement learning in problems with continuous state and action spaces. Adaptive Behavior.
Stulp, F., and Sigaud, O. 2012. Path integral policy improvement with covariance matrix adaptation. In Proceedings of the 29th International Conference on Machine Learning (ICML).
Szita, I., and Lo?rincz, A. 2006. Learning tetris using the noisy cross-entropy method. Neural Computation 2936 2941.
Tassa, Y., and Todorov, E. 2010. Stochastic complementarity for local control of discontinuous dynamics. In Proceedings of Robotics: Science and Systems.
Tassa, Y.; Erez, T.; and Smart, W. 2008. Receding horizon differential dynamic programming. In Platt, J.; Koller, D.; Singer, Y.; and Roweis, S., eds., Proceedings of Advances in Neural Information Processing Systems 20, 14651472.
Tesauro, G., and Galperin, G. R. 1996. On-line policy improvement using monte-carlo search. In NIPS, 10681074.
Wampler, K., and Popovic, Z. 2009. Optimal gait and form for animal locomotion. SIGGRAPH.
Weinstein, A., and Littman, M. L. 2012. Bandit-based planning and learning in continuous-action markov decision processes. In Proceedings of the 22nd International Conference on Automated Planning and Scheduling, 306314.
-----0
Barnes, M.; Chen, J.; Jentsch, F.; and Redden, E. 2011.Designing effective soldier-robot teams in complex environments: training, interfaces, and individual differences. In EPCE. Springer. 484493.
Casper, J., and Murphy, R. 2002. Workflow study on humanrobot interaction in usar. In IEEE ICRA, volume 2, 1997 2003.
Casper, J., and Murphy, R. 2003. Human-robot interactions during the robot-assisted urban search and rescue response at the world trade center. IEEE SMCS 33(3):367385.
Coles, A.; Fox, M.; Halsey, K.; Long, D.; and Smith, A.2009. Managing concurrency in temporal planning using planner-scheduler interaction. Artificial Intelligence 173(1):1  44.
Cummings, M. L.; Brzezinski, A. S.; and Lee, J. D.2007. Operator performance and intelligent aiding in unmanned aerial vehicle scheduling. IEEE Intelligent Systems 22(2):5259.
Di Ciaccio, R.; Pullen, J.; and Breimyer, P. 2011. Enabling distributed command and control with standardsbased geospatial collaboration. In IEEE International Conference on HST.Getoor, L., and Mihalkova, L. 2011. Learning statistical models from relational data. In International Conference on Management of data, 11951198. ACM.
Goodrich, M. A.; Morse, B. S.; Engh, C.; Cooper, J. L.; and Adams, J. A. 2009. Towards using UAVs in wilderness search and rescue: Lessons from field trials. Interaction Studies, Special Issue on Robots in the Wild: Exploring Human-Robot Interaction in Naturalistic Environments 10(3):453478.
Howey, R.; Long, D.; and Fox, M. 2004. Val: Automatic plan validation, continuous effects and mixed initiative planning using pddl. In IEEE ICTAI, 294301. IEEE.
Jones, H.; Rock, S.; Burns, D.; and Morris, S. 2002. Autonomous robots in swat applications: Research, design, and operations challenges. AUVSI.
Kim, B.; Bush, L.; and Shah, J. 2013. Quantitative estimation of the strength of agreements in goal-oriented meetings.In IEEE CogSIMA.
Koomen, P.; Punyakanok, V.; Roth, D.; and Yih, W. 2005.Generalized inference with multiple semantic role labeling systems. In CoNLL, 181184.
Kruijff, G.; Jan?cek, M.; and Lison, P. 2010. Continual processing of situated dialogue in human-robot collaborative activities. In IEEE Ro-Man.
Larochelle, B.; Kruijff, G.; Smets, N.; Mioch, T.; and Groenewegen, P. 2011. Establishing human situation awareness using a multi-modal operator control unit in an urban search & rescue human-robot team. In IEEE Ro-Man, 229234.IEEE.
Micire, M. 2002. Analysis of robotic platforms used at the world trade center disaster. Ph.D. Dissertation, MS thesis, Department Computer Science Engineering, Univ. South Florida.
Murphy, R. 2004. Human-robot interaction in rescue robotics. IEEE SMCS 34(2):138153.
Palmer, M.; Gildea, D.; and Xue, N. 2010. Semantic role labeling. Synthesis Lectures on Human Language Technologies 3(1):1103.
Poon, H., and Domingos, P. 2006. Sound and efficient inference with probabilistic and deterministic dependencies. In AAAI, volume 21, 458.
Poon, H., and Domingos, P. 2009. Unsupervised semantic parsing. In EMNLP.
Pradhan, S.; Ward, W.; Hacioglu, K.; Martin, J.; and Jurafsky, D. 2004. Shallow semantic parsing using support vector machines. In NAACL-HLT, 233.
Raedt, L. 2008. Probabilistic logic learning. Logical and Relational Learning 223288.
Richardson, M., and Domingos, P. 2006. Markov logic networks. Machine learning 62(1):107136.
Singla, P., and Domingos, P. Markov logic in infinite domains. In UAI.
Tellex, S.; Kollar, T.; Dickerson, S.; Walter, M.; Banerjee, A.; Teller, S.; and Roy, N. 2011. Understanding natural language commands for robotic navigation and mobile manipulation. In AAAI.
-----0
Aharon, M.; Elad, M.; and Bruckstein, A. 2006. K-svd: An algorithm for designing overcomplete dictionaries for sparse representation. IEEE TRANSACTIONS ON SIGNAL PROCESSING 54(11):4311.
Bo, L.; Ren, X.; and Fox, D. 2012. Unsupervised feature learning for RGB-D based object recognition. International Symposium on Experimental Robotics (ISER), June.
Elad, M., and Aharon, M. 2006. Image denoising via sparse and redundant representations over learned dictionaries. Image Processing, IEEE Transactions on 15(12):37363745.
Fairfield, N.; Kantor, G.; and Wettergreen, D. 2007. Realtime slam with octree evidence grids for exploration in underwater tunnels. Journal of Field Robotics 24(1-2):0321.
Feige, U. 1998. A threshold of ln n for approximating set cover. Journal of the ACM (JACM) 45(4):634652.
Henry, P.; Krainin, M.; Herbst, E.; Ren, X.; and Fox, D.2010. Rgb-d mapping: Using depth cameras for dense 3d modeling of indoor environments. In the 12th International Symposium on Experimental Robotics (ISER), volume 20, 2225.
Hyvarinen, A.; Hoyer, P.; and Oja, E. 2001. Image denoising by sparse code shrinkage. Intelligent Signal Processing 554568.
Kammerl, J.; Blodow, N.; Rusu, R. B.; Gedikli, S.; Beetz, M.; and Steinbach, E. 2012. Real-time compression of point cloud streams. In IEEE International Conference on Robotics and Automation (ICRA).
Newcombe, R.; Davison, A.; Izadi, S.; Kohli, P.; Hilliges, O.; Shotton, J.; Molyneaux, D.; Hodges, S.; Kim, D.; and Fitzgibbon, A. 2011. Kinectfusion: Real-time dense surface mapping and tracking. In Mixed and Augmented Reality (ISMAR), 2011 10th IEEE International Symposium on.
Olshausen, B.; Field, D.; et al. 1997. Sparse coding with an overcomplete basis set: A strategy employed by vi? Vision research 37(23):33113326.
Pati, Y.; Rezaiifar, R.; and Krishnaprasad, P. 1993. Orthogonal matching pursuit: Recursive function approximation with applications to wavelet decomposition. In Signals, Systems and Computers, 1993. 1993 Conference Record of The Twenty-Seventh Asilomar Conference on, 4044. IEEE.
Rubinstein, R.; Zibulevsky, M.; and Elad, M. 2008. Efficient implementation of the k-svd algorithm using batch orthogonal matching pursuit. CS Technion.
Rubinstein, R.; Zibulevsky, M.; and Elad, M. 2010. Double sparsity: Learning sparse dictionaries for sparse signal approximation. Signal Processing, IEEE Transactions on 58(3):15531564.
Ruhnke, M.; Steder, B.; Grisetti, G.; and Burgard, W. 2010.Unsupervised learning of compact 3d models based on the detection of recurrent structures. In Proc. of the IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS).
Wurm, K.; Hornung, A.; Bennewitz, M.; Stachniss, C.; and Burgard, W. 2010. Octomap: A probabilistic, flexible, and compact 3d map representation for robotic systems. In Proc.of the ICRA 2010 workshop on best practice in 3D perception and modeling for mobile manipulation, volume 2.
Yang, J.; Yu, K.; Gong, Y.; and Huang, T. 2009. Linear spatial pyramid matching using sparse coding for image classification. In Computer Vision and Pattern Recognition, 2009.
CVPR 2009. IEEE Conference on, 17941801. IEEE.
-----0
Becker, R.; Zilberstein, S.; and Goldman, C. 2004. Solving Transition Independent Decentralized Markov Decision Processes. Journal of Artificial Intelligence Research 22:423455.
Bernstein, D. S.; Givan, R.; Immerman, N.; and Zilberstein, S. 2002. The Complexity of Decentralized Control of Markov Decision Processes. Mathematics of Operations Research 27(4):819840.Boutilier, C. 1996. Planning, Learning and Coordination in Multiagent Decision Processes. In Proceedings of the 6th conference on Theoretical aspects of rationality and knowledge, 195210. Morgan Kaufmann Publishers Inc.
Bradtke, S., and Duff, M. 1995. Reinforcement Learning Methods for Continuous-Time Markov Decision Problems.Advances in neural information processing systems 7:393 400.
Howard, R. A. 1960. Dynamic Programming and Markov Processes. New York: John Wiley & Sons, Inc.
Messias, J.; Spaan, M. T. J.; and Lima, P. U. 2010. MultiRobot Planning under Uncertainty with Communication: a Case Study. In Multi-agent Sequential Decision Making in Uncertain Domains. Workshop at AAMAS10.
Messias, J.; Spaan, M. T. J.; and Lima, P. U. 2011. Efficient Offline Communication Policies for Factored Multiagent POMDPs. In Proceedings of the 25th Annual Conference on Neural Information Processing Systems.
Puterman, M. 1994. Markov Decision Processes: Discrete Stochastic Dynamic Programming. John Wiley & Sons, Inc.
Roth, M.; Simmons, R.; and Veloso, M. 2007. Exploiting Factored Representations for Decentralized Execution in Multi-Agent Teams. In Proc. of Int. Conference on Autonomous Agents and Multi Agent Systems.
Spaan, M. T. J.; Gordon, G.; and Vlassis, N. 2006. Decentralized Planning under Uncertainty for Teams of Communicating Agents. In Proc. of Int. Conference on Autonomous Agents and Multi Agent Systems, 249256. ACM.
Spaan, M. T. J.; Oliehoek, F. A.; and Vlassis, N. 2008. Multiagent Planning under Uncertainty with Stochastic Communication Delays. In Proc. of Int. Conf. on Automated Planning and Scheduling, 338345.
White, D. 1993. A Survey of Applications of Markov Decision Processes. Journal of the Operational Research Society 44(11):10731096.
Witwicki, S.; Melo, F. S.; Capitan, J.; and Spaan, M. T. J.2013. A Flexible Approach to Modeling Unpredictable Events in MDPs. In Proc. of Int. Conf. on Automated Planning and Scheduling.
Younes, H., and Simmons, R. 2004. Solving Generalized Semi-MArkov Decision Processes Using Continuous PhaseType Distributions. In Proceedings of the Nineteenth National Conference on Artificial Intelligence, 742747. San Jose, California. AAAI Press.
Younes, H. 2005. Planning and Execution with Phase Transitions. In Proceedings of the National Conference on Artificial Intelligence, 10301035.
-----0
Bai, H.; Hsu, D.; Kochenderfer, M.; and Lee, W. S. 2011. Unmanned Aircraft Collision Avoidance using ContinuousState POMDPs. In Robotics Science and Systems (RSS11).
Bonet, B., and Geffner, H. 2009. Solving POMDPs: RTDPbel vs. point-based algorithms. In Int. Joint Conf. on Artificial Intelligence (IJCAI09).
Candido, S., and Hutchinson, S. 2011. Minimum uncertainty robot navigation using information-guided POMDP planning. In Int. Conf. on Robotics and Automation (ICRA11).
Eidenberger, R.; Grundmann, T.; and Zoellner, R. 2009.Probabilistic action planning for active scene modeling in continuous high-dimensional domains. In Int. Conf. on Robotics and Automation (ICRA09). IEEE.
Kurniawati, H.; Hsu, D.; and Lee, W. 2008. SARSOP: Efficient point-based POMDP planning by approximating optimally reachable belief spaces. In Robotics Science and Systems (RSS08).
Miller, S. A.; Harris, Z. A.; and Chong, E. K. P. 2009.A POMDP framework for coordinated guidance of autonomous UAVs for multitarget tracking. EURASIP J. Adv.Signal Process 2:12:17.
Pineau, J.; Gordon, G.; and Thrun, S. 2003. Point-based value iteration: An anytime algorithm for POMDPs. In Int. Joint Conf. on Artificial Intelligence (IJCAI03).Ross, S., and Chaib-Draa, B. 2007. AEMS: An anytime online search algorithm for approximate policy refinement in large POMDPs. In Int. Joint Conf. on Artificial Intelligence (IJCAI07).
Sabbadin, R.; Lang, J.; and Ravoanjanahary, N. 2007. Purely epistemic Markov Decision Processes. In AAAI-07.
Saux, B., and Sanfourche, M. 2011. Robust vehicle categorization from aerial images by 3D-template matching and multiple classifier system. In Int. Symposium on Image and Signal Processing and Analysis (ISPA).
Schesvold, D.; Tang, J.; Ahmed, B.; Altenburg, K.; and Nygard, K. 2003. POMDP planning for high level UAV decisions: Search vs. strike. In Int. Conf. on Computer Applications in Industry and Enineering.
Smallwood, R., and Sondik, E. 1973. The optimal control of partially observable Markov processes over a finite horizon.Operations Research 10711088.
Smith, T., and Simmons, R. 2005. Point-based POMDP algorithms: Improved analysis and implementation. In Conf.on Uncertainty in Artificial Intelligence (UAI05).
Spaan, M. 2008. Cooperative Active Perception using POMDPs. Association for the Advancement of Artificial Intelligence AAAI.
Taha, T.; Mir, J. V.; and Dissanayake, G. 2011. A pomdp framework for modelling human interaction with assistive robots. In Int. Conf. on Robotics and Automation (ICRA11).
Teichteil-Konigsbuch, F.; Lesire, C.; and Infantes, G. 2011.A generic framework for anytime execution-driven planning in robotics. In Int. Conf. on Robotics and Automation (ICRA11).
Wang, J.; Zhang, Y.; Lu, J.; and Xu, W. 2012. A Framework for Moving Target Detection, Recognition and Tracking in UAV Videos. In Advances in Intelligent and Soft Computing, volume 137. Springer Berlin / Heidelberg. 6976.