• Skip to main content
  • Skip to primary sidebar
AAAI

AAAI

Association for the Advancement of Artificial Intelligence

    • AAAI

      AAAI

      Association for the Advancement of Artificial Intelligence

  • About AAAIAbout AAAI
    • AAAI Officers and Committees
    • AAAI Staff
    • Bylaws of AAAI
    • AAAI Awards
      • Fellows Program
      • Classic Paper Award
      • Dissertation Award
      • Distinguished Service Award
      • Allen Newell Award
      • Outstanding Paper Award
      • Award for Artificial Intelligence for the Benefit of Humanity
      • Feigenbaum Prize
      • Patrick Henry Winston Outstanding Educator Award
      • Engelmore Award
      • AAAI ISEF Awards
      • Senior Member Status
      • Conference Awards
    • AAAI Resources
    • AAAI Mailing Lists
    • Past AAAI Presidential Addresses
    • Presidential Panel on Long-Term AI Futures
    • Past AAAI Policy Reports
      • A Report to ARPA on Twenty-First Century Intelligent Systems
      • The Role of Intelligent Systems in the National Information Infrastructure
    • AAAI Logos
    • News
  • aaai-icon_ethics-diversity-line-yellowEthics & Diversity
  • Conference talk bubbleConferences & Symposia
    • AAAI Conference
    • AIES AAAI/ACM
    • AIIDE
    • IAAI
    • ICWSM
    • HCOMP
    • Spring Symposia
    • Summer Symposia
    • Fall Symposia
    • Code of Conduct for Conferences and Events
  • PublicationsPublications
    • AAAI Press
    • AI Magazine
    • Conference Proceedings
    • AAAI Publication Policies & Guidelines
    • Request to Reproduce Copyrighted Materials
  • aaai-icon_ai-magazine-line-yellowAI Magazine
    • Issues and Articles
    • Author Guidelines
    • Editorial Focus
  • MembershipMembership
    • Member Login
    • Developing Country List
    • AAAI Chapter Program

  • Career CenterCareer Center
  • aaai-icon_ai-topics-line-yellowAITopics
  • aaai-icon_contact-line-yellowContact

Home / Proceedings / Proceedings of the AAAI Conference on Artificial Intelligence, 18 /

Book One

Constraint Satisfaction

  • The Yard Allocation Problem

    Ping Chen, Zhaohui Fu, and Andrew Lim, National University of Singapore

    3

    PDF
  • Integrating Local Search and Network Flow to Solve the Inventory Routing Problem

    Hoong Chuin Lau, National University of Singapore; Qizhang Liu, ASPrecise Pte Ltd; Hirotaka Ono, Kyushu University

    9

    PDF
  • Generating Random Solutions for Constraint Satisfaction Problems

    Rina Dechter and Kalev Kask, University of California, Irvine; Eyal Bin and Roy Emek, IBM Research Laboratory in Haifa

    15

    PDF
  • Graph Coloring with Quantum Heuristics

    Alex Fabrikant, University of California, Berkeley; Tad Hogg, HP Labs

    22

    PDF
  • Reducing Search Space in Local Search for Constraint Satisfaction

    H. Fang, Yale University; Y. Kilani and J.H.M. Lee, The Chinese University of Hong Kong; P.J. Stuckey, University of Melbourne

    28

    PDF
  • Preference-Based Search and Multi-Criteria Optimization

    Ulrich Junker

    34

    PDF
  • Human-Guided Tabu Search

    Gunnar W. Klau, Vienna University of Technology; Neal Lesh and
    Joe Marks, Mitsubishi Electric Research Laboratories; Michael Mitzenmacher, Harvard University

    41

    PDF
  • Node and Arc Consistency in Weighted CSP

    Javier Larrosa, Universitat Politecnica de Catalunya

    48

    PDF
  • Model Induction: A New Source of CSP Model Redundancy

    Y. C. Law and J. H. M. Lee, The Chinese University of Hong Kong

    54

    PDF

Knowledge Representation

  • Measuring Inconsistency in Knowledge via Quasi-Classical Models

    Anthony Hunter, University College London

    68

    PDF
  • A Hoare-Style Proof System for Robot Programs

    Yongmei Liu, University of Toronto

    74

    PDF
  • Representing and Reasoning about Mappings between Domain Models

    Jayant Madhavan, University of Washington; Philip A. Bernstein, Microsoft Research; Pedro Domingos and Alon Y. Halevy, University of Washington

    80

    PDF
  • A Regression Based Adaptation Strategy for Case-Based Reasoning

    David Patterson, Niall Rooney, and Mykola Galushka, University of Ulster at Jordanstown

    87

    PDF
  • Cluster Ensembles – A Knowledge Reuse Framework for Combining Partitionings

    Alexander Strehl and Joydeep Ghosh, The University of Texas at Austin Logic Programming

    93

    PDF
  • Logic Programming with Ordered Disjunction

    Gerhard Brewka, Universität Leipzig

    100

    PDF
  • A Three-Valued Characterization for Strong Equivalence of Logic Programs

    Pedro Cabalar, University of Corunna

    106

    PDF
  • ASSAT: Computing Answer Sets of a Logic Program by SAT Solvers

    Fangzhen Lin and Yuting Zhao, Hong Kong University of Science and Technology

    112

    PDF
  • On Computing all Abductive Explanations

    Thomas Eiter, Technische Universität Wien; Kazuhisa Makino, Osaka University

    62

    PDF

Learning

  • Reinforcement Learning for POMDPs Based on Action Values and Stochastic Optimization

    Theodore J. Perkins, University of Massachusetts Amherst

    199

    PDF
  • Polynomial-Time Reinforcement Learning of Near-Optimal Policies

    Karèn Pivazyan and Yoav Shoham, Stanford University

    205

    PDF
  • Constrained Formulations and Algorithms for Stock-Price Predictions Using Recurrent FIR Neural Networks

    Benjamin W. Wah and Minglun Qian, University of Illinois, Urbana-Champaign

    211

    PDF
  • Rule-Based Anomaly Pattern Detection for Detecting Disease Outbreaks

    Weng-Keen Wong and Andrew Moore, Carnegie Mellon University; Gregory Cooper and Michael Wagner, University of Pittsburgh

    217

    PDF
  • Extended Isomap for Pattern Classification

    Ming-Hsuan Yang, Honda Fundamental Research Labs

    224

    PDF
  • Hierarchical Latent Class Models for Cluster Analysis

    Nevin L. Zhang, Hong Kong University of Science and Technology

    230

    PDF
  • Data Perturbation for Escaping Local Maxima in Learning

    Gal Elidan, Matan Ninio, and Nir Friedman, Hebrew University; Dale Shuurmans, University of Waterloo

    132

    PDF
  • Progressive Rademacher Sampling

    Tapio Elomaa and Matti Kääriäinen, University of Helsinki

    140

    PDF
  • Pruning and Dynamic Scheduling of Cost-Sensitive Ensembles

    Wei Fan, IBM T.J. Watson Research; Fang Chu, University of California, Los Angeles; Haixun Wang and Philip S. Yu, IBM T.J. Watson Research

    146

    PDF
  • Specific-to-General Learning for Temporal Events

    Alan Fern, Robert Givan, and Jeffrey Mark Siskind, Purdue University

    152

    PDF
  • Learning Temporal, Relational, Force-Dynamic Event Definitions from Video

    Alan Fern, Jeffrey Mark Siskind, and Robert Givan, Purdue University

    159

    PDF
  • Structural Extension to Logistic Regression: Discriminative Parameter Learning of Belief Net Classifiers

    Russell Greiner, University of Alberta; Wei Zhou, University of Waterloo

    167

    PDF
  • Bootstrap Learning for Place Recognition

    Benjamin Kuipers and Patrick Beeson, The University of Texas at Austin

    174

    PDF
  • Minimum Majority Classification and Boosting

    Philip M. Long, Genome Institute of Singapore

    181

    PDF
  • Content-Boosted Collaborative Filtering for Improved Recommendations

    Prem Melville, Raymond J. Mooney, and Ramadass Nagarajan, University of Texas at Austin

    187

    PDF
  • Constructive Adaptive User Interfaces – Composing Music Based on Human Feelings

    Masayuki Numao, Shoichi Takagi, and Keisuke Nakamura, Tokyo Institute of Technology

    193

    PDF
  • State Abstraction for Programmable Reinforcement Learning Agents

    David Andre and Stuart J. Russell, University of California, Berkeley

    119

    PDF
  • Contentful Mental States for Robot Baby

    Paul R. Cohen, University of Massachusetts; Tim Oates, University of Maryland; Carole R. Beal, University of Massachusetts; Niall Adams, Imperial College, London

    126

    PDF

Markov Decision Processes

  • A POMDP Formulation of Preference Elicitation Problems

    Craig Boutilier, University of Toronto

    239

    PDF
  • Segmenting Time Series with a Hybrid Neural Networks – Hidden Markov Model

    Laura Firoiu and Paul R. Cohen, University of Massachusetts Amherst

    247

    PDF
  • Context-Specific Multiagent Coordination and Planning with Factored MDPs

    Carlos Guestrin, Shobha Venkataraman, and Daphne Koller, Stanford University

    253

    PDF
  • Nearly Deterministic Abstractions of Markov Decision Processes

    Terran Lane and Leslie Pack Kaelbling, MIT Artificial Intelligence Laboratory

    260

    PDF
  • The Size of MDP Factored Policies

    Paolo Liberatore, Università di Roma "La Sapienza"

    267

    PDF
  • On Policy Iteration as a Newton’s Method and Polynomial Policy Iteration Algorithms

    Omid Madani, University of Alberta

    273

    PDF
  • Efficient Utility Functions for Ceteris Paribus Preferences

    Michael McGeachie, Massachusetts Institute of Technology; Jon Doyle, North Carolina State University

    279

    PDF
  • Greedy Linear Value-Approximation for Factored Markov Decision Processes

    Relu Patrascu, University of Waterloo; Pascal Poupart, University of Toronto; Dale Schuurmans, University of Waterloo; Craig Boutilier, University of Toronto; Carlos Guestrin, Stanford University

    285

    PDF
  • Piecewise Linear Value Function Approximation for Factored MDPs

    Pascal Poupart and Craig Boutilier, University of Toronto; Relu Patrascu and Dale Schuurmans, University of Waterloo

    292

    PDF
  • Bayesian Networks for Speech and Image Integration

    Sven Wachsmuth and Gerhard Sagerer, Bielefeld University

    300

    PDF
  • Value Iteration Working with Belief Subsets

    Weihong Zhang, Washington University; Nevin L. Zhang, Hong Kong University of Science and Technology

    307

    PDF

Multiagent Systems

  • The Design of Collectives of Agents to Control Non-Markovian Systems

    John W. Lawson and David H. Wolpert, NASA Ames Research Center

    332

    PDF
  • (Im)possibility of Safe Exchange Mechanism Design

    Tuomas Sandholm and XiaoFeng Wang, Carnegie Mellon University

    338

    PDF
  • Multi-Agent Algorithms for Solving Graphical Games

    David Vickrey and Daphne Koller, Stanford University

    345

    PDF
  • Distributed Breakout Revisited

    Weixiong Zhang and Lars Wittenburg, Washington University

    352

    PDF
  • Complexity of Manipulating Elections with Few Candidates

    Vincent Conitzer and Tuomas Sandholm, Carnegie Mellon University

    314

    PDF
  • A Logic-Based Model of Intentions for Multi-Agent Subcontracting

    John Grant, Towson University; Sarit Kraus, Bar-Ilan University and University of Maryland; Donald Perlis, University of Maryland

    320

    PDF
  • Reinforcement Learning of Coordination in Cooperative Multi-Agent Systems

    Spiros Kapetanakis and Daniel Kudenko, University of York

    326

    PDF

Auctions

  • Solving Concisely Expressed Combinatorial Auction Problems

    Craig Boutilier, University of Toronto

    359

    PDF
  • Partial-Revelation VCG Mechanism for Combinatorial Auctions

    Wolfram Conen, XONAR GmbH; Tuomas Sandholm, Carnegie Mellon University

    367

    PDF
  • Bidding Clubs in First-Price Auctions

    Kevin Leyton-Brown, Yoav Shoham, and Moshe Tennenholtz, Stanford University

    373

    PDF
  • Truthful Approximation Mechanisms for Restricted Combinatorial Auctions

    Ahuva Mu'alem and Noam Nisan, The Hebrew University of Jerusalem vi

    379

    PDF
  • Structural Leverage and Fictitious Play in Sequential Auctions

    Weili Zhu and Peter R. Wurman, North Carolina State University

    385

    PDF

Game Theory

  • Vote Elicitation: Complexity and Strategy-Proofness

    Vincent Conitzer and Tuomas Sandholm, Carnegie Mellon University

    392

    PDF
  • Dispersion Games: General Definitions and Some Specific Learning Results

    Trond Grenager, Rob Powers, and Yoav Shoham, Stanford University

    398

    PDF
  • Competitive Safety Analysis

    Moshe Tennenholtz, Stanford University

    404

    PDF

Natural Language Processing

  • Learning Pattern Rules for Chinese Named Entity Extraction

    Tat-Seng Chua and Jimin Liu, National University of Singapore

    411

    PDF
  • Language Modeling for Soft Keyboards

    Joshua Goodman and Gina Venolia, Microsoft Research; Keith Steury, Microsoft Corporation; Chauncey Parker, University of Washington

    419

    PDF
  • CobotDS: A Spoken Dialogue System for Chat

    Michael Kearns, University of Pennsylvania; Charles Isbell, Georgia Institute of Technology; Satinder Singh, Syntek Capital; Diane Litman, University of Pittsburgh; Jessica Howe, Massachussetts Institute of Technology

    425

    PDF
  • Exploiting Auditory Fovea in Humanoid-Human Interaction

    Kazuhiro Nakadai, Kitano Symbiotic Systems Project, ERATO; Hiroshi G. Okuno, Kitano Symbiotic Systems Project, ERATO and Kyoto University; Hiroaki Kitano, Kitano Symbiotic Systems Project, ERATO and Sony Computer Science Laboratories, Inc.

    431

    PDF
  • Towards CST-Enhanced Summarization

    Zhu Zhang, Sasha Blair-Goldensohn, and Dragomir R. Radev, University of Michigan

    439

    PDF

Planning

  • Algorithms for a Temporal Decoupling Problem in Multi-Agent Planning

    Luke Hunsberger, Harvard University

    468

    PDF
  • D*Lite

    Sven Koenig, Georgia Institute of Technology; Maxim Likhachev, Carnegie Mellon University

    476

    PDF
  • Speeding Up the Calculation of Heuristics for Heuristic Search-Based Planning

    Yaxin Liu, Sven Koenig and David Furcy, Georgia Institute of Technology

    484

    PDF
  • Iterative-Refinement for Action Timing Discretization

    Todd W. Neller, Gettysburg College

    492

    PDF
  • A Logical Measure of Progress for Planning

    Aarati Parmar, Stanford University

    498

    PDF
  • Planning with a Language for Extended Goals

    Ugo Dal Lago, Marco Pistore, and Paolo Traverso, ITC-IRST

    447

    PDF
  • Symbolic Heuristic Search for Factored Markov Decision Processes

    Zhengzhu Feng, University of Massachusetts; Eric A. Hansen, Mississippi State University

    455

    PDF
  • Plan Evaluation with Incomplete Action Descriptions

    Andrew Garland and Neal Lesh, Cambridge Research Laboratory, MERL

    461

    PDF

Actions and Temporal Reasoning

  • Reasoning about Actions in a Probabilistic Setting

    Chitta Baral, Nam Tran, and Le-Chi Tuan, Arizona State University

    507

    PDF
  • A Method for Metric Temporal Reasoning

    Mathias Broxvall, Linköpings Universitet

    513

    PDF
  • Non-Markovian Control in the Situation Calculus

    Alfredo Gabaldon, University of Toronto

    519

    PDF

Probabilistic and Causal Reasoning

  • Visual Exploration and Incremental Utility Elicitation

    Jim Blythe, USC Information Sciences Institute

    526

    PDF
  • A Graphical Criterion for the Identification of Causal Effects in Linear Models

    Carlos Brito and Judea Pearl, University of California, Los Angeles

    533

    PDF
  • A Distance Measure for Bounding Probabilistic Belief Change

    Hei Chan and Adnan Darwiche, University of California, Los Angeles

    539

    PDF
  • Strategies for Determining Causes of Events

    Mark Hopkins, University of California, Los Angeles

    546

    PDF
  • Tree Approximation for Belief Updating

    Robert Mateescu, Rina Dechter, and Kalev Kask, University of California, Irvine

    553

    PDF
  • Accuracy Versus Efficiency Trade-offs in Probabilistic Diagnosis

    Irina Rish, Mark Brodie, and Sheng Ma, IBM T.J. Watson Research Center

    560

    PDF
  • A General Identification Condition for Causal Effects

    Jin Tian and Judea Pearl, University of California, Los Angeles

    567

    PDF
  • A New Characterization of the Experimental Implications of Causal Bayesian Networks

    Jin Tian and Judea Pearl, University of California, Los Angeles

    574

    PDF

Robotics

  • CD*: A Real-Time Resolution Optimal Re-Planner for Globally Constrained Problems

    Anthony Stentz, Carnegie Mellon University

    605

    PDF
  • Robust Global Localization Using Clustered Particle Filtering

    Adam Milstein, Javier Nicolás Sánchez, and Evan Tang Williamson, Stanford University

    581

    PDF
  • Experiences with a Mobile Robotic Guide for the Elderly

    Michael Montemerlo, Joelle Pineau, Nicholas Roy, Sebastian Thrun, and Vandi Verma, Carnegie Mellon University

    587

    PDF
  • FastSLAM: A Factored Solution to the Simultaneous Localization and Mapping Problem

    Michael Montemerlo and Sebastian Thrun, Carnegie Mellon University; Daphne Koller and Ben Wegbreit, Stanford Universit

    593

    PDF
  • Watch Their Moves: Applying Probabilistic Multiple Object Tracking to Autonomous Robot Soccer

    Thorsten Schmitt, Michael Beetz, Robert Hanek, and Sebastian Buck, Munich University of Technology

    599

    PDF

Satisfiability

  • Enhancing Davis Putnam with Extended Binary Clause Reasoning

    Fahiem Bacchus, University of Toronto

    613

    PDF
  • Comparing Phase Transitions and Peak Cost in PP-Complete Satisfiability Problems

    Delbert D. Bailey, Víctor Dalmau, and Phokion G. Kolaitis, University of California, Santa Cruz

    620

    PDF
  • A Compiler for Deterministic, Decomposable Negation Normal Form

    Adnan Darwiche, University of California, Los Angeles

    627

    PDF
  • Inference Methods for a Pseudo-Boolean Satisfiability Solver

    Heidi E. Dixon and Matthew L. Ginsberg, CIRL / University of Oregon

    635

    PDF
  • Automated Discovery of Composite SAT Variable-Selection Heuristics

    Alex Fukunaga, University of California, Los Angeles

    641

    PDF
  • Learning for Quantified Boolean Logic Satisfiability

    Enrico Giunchiglia, Massimo Narizzano, and Armando Tacchella, DIST - Università di Genova

    649

    PDF
  • An Adaptive Noise Mechanism for WalkSAT

    Holger H. Hoos, University of British Columbia

    655

    PDF
  • A Mixture-Model for the Behaviour of SLS Algorithms for SAT

    Holger H. Hoos, University of British Columbia

    661

    PDF
  • SetA*: An Efficient BDD-Based Heuristic Search Algorithm

    Rune M. Jensen, Randal E. Bryant, and Manuela M. Veloso, Carnegie Mellon University

    668

    PDF
  • Dynamic Restart Policies

    Henry Kautz, University of Washington; Eric Horvitz, Microsoft Research; Yongshao Ruan, University of Washington; Carla Gomes and Bart Selman, Cornell University

    674

    PDF
  • Using Weighted MAX-SAT Engines to Solve MPE

    James D. Park, University of California, Los Angeles

    682

    PDF
  • Easy Predictions for the Easy-Hard-Easy Transition

    Andrew J. Parkes, CIRL / University of Oregon

    688

    PDF
  • The Interface between P and NP: COL, XOR, NAE, 1-in-k, and Horn SAT

    Toby Walsh, University College Cork

    695

    PDF

Search

  • Memory-Efficient A* Heuristics for Multiple Sequence Alignment

    Matthew McNaughton, Paul Lu, Jonathan Schaeffer, and Duane Szafron, University of Alberta

    737

    PDF
  • PROMPTDIFF: A Fixed-Point Algorithm for Comparing Ontology Versions

    Natalya F. Noy and Mark A. Musen, Stanford University

    744

    PDF
  • On Preference-Based Search in State Space Graphs

    Patrice Perny, LIP6 - University of Paris VI; Olivier Spanjaard, LAMSADE - University of Paris IX

    751

    PDF
  • An Average-Case Analysis of Graph Search

    Anup K. Sen, Indian Institute of Management Calcutta; Amitava Bagchi, University of Texas at Dallas; Weixiong Zhang, Washington University

    757

    PDF
  • Scheduling Contract Algorithms on Multiple Processors

    Daniel S. Bernstein, Theodore J. Perkins, and Shlomo Zilberstein, University of Massachusetts; Lev Finkelstein, Technion - Israel Institute of Technology

    702

    PDF
  • Searching for Backbones and Fat: A Limit-Crossing Approach with Applications

    Sharlee Climer and Weixiong Zhang, Washington University

    707

    PDF
  • Multiple-Goal Search Algorithms and their Application to Web Crawling

    Dmitry Davidov and Shaul Markovitch, Technion

    713

    PDF
  • Optimal Schedules for Parallelizing Anytime Algorithms: The Case of Independent Processes

    Lev Finkelstein, Shaul Markovitch, and Ehud Rivlin, Technion

    719

    PDF
  • Optimal Depth-First Strategies for And-Or Trees

    Russell Greiner and Ryan Hayward, University of Alberta; Michael Molloy, University of Toronto

    725

    PDF
  • A New Algorithm for Optimal Bin Packing

    Richard E. Korf, University of California, Los Angeles

    731

    PDF

Vision

  • Detection and Classification of Motion Boundaries

    Richard Mann, University of Waterloo; Allan D. Jepson, University of Toronto

    764

    PDF
  • Recognizing Multitasked Activities from Video Using Stochastic Context-Free Grammar

    Darnell Moore, Texas Instruments; Irfan Essa, Georgia Institute of Technology

    770

    PDF
  • The OD Theory of TOD: The Use and Limits of Temporal Information for Object Discovery

    Brandon C. S. Sanders and Randal C. Nelson, University of Rochester; Rahul Sukthankar, Compaq Research (CRL)

    777

    PDF

Web and Information Extraction

  • A Maximum Entropy Approach to Information Extraction from Semi-Structured and Free Text

    Hai Leong Chieu, DSO National Laboratories; Hwee Tou Ng, National University of Singapore

    786

    PDF
  • Reviewing the Design of DAML+OIL: An Ontology Language for the Semantic Web

    Ian Horrocks, University of Manchester; Peter F. Patel-Schneider, Bell Labs Research; Frank van Harmelen, Vrije Universiteit

    792

    PDF
  • Stochastic Link and Group Detection

    Jeremy Kubica, Andrew Moore, Jeff Schneider, and Yiming Yang, Carnegie Mellon University

    798

    PDF

Innovative Applications of Artificial Intelligence Papers Deployed Applications

  • MiTAP, Text and Audio Processing for Bio-Security: A Case Study

    Laurie Damianos, Jay Ponte, Steve Wohlever, Florence Reeder, David Day, George Wilson, and Lynette Hirschman, The MITRE Coporation

    807

    PDF
  • RightNow eService Center: Internet Customer Service Using a Self-Learning Knowledge Base

    Stephen D. Durbin, Doug Warner, J. Neal Richter, and Zuzana Gedeon, RightNow Technologies, Inc.

    815

    PDF
  • Staff Scheduling for Inbound Call Centers and Customer Contact Centers

    Alex Fukunaga, Ed Hamilton, Jason Fama, David Andre, Ofer Matan, and Illah Nourbakhsh, Blue Pumpkin Software

    822

    PDF
  • A Decision-Support System for Quote Generation

    Richard Goodwin, Rama Akkiraju, and Fred Wu, IBM T.J. Watson Research Center

    830

    PDF
  • UTTSExam: A Campus-Wide University Exam-Timetabling System

    Andrew Lim, Juay-Chin Ang, Wee-Kit Ho, and Wee-Chong Oon, National University of Singapore

    838

    PDF
  • A Structure Based Configuration Tool: Drive Solution Designer – DSD

    Christoph Ranze, encoway GmbH and Co KG; Thorsten Scholz and Thomas Wagner, University of Bremen, TZI; Andreas Günter, University of Hamburg; Otthein Herzog, University of Bremen, TZI; Oliver Hollmann, encoway GmbH and Co Inc.; Christoph Schlieder, University of Bremen, Lenze AG, TZI; Volker Arlt

    845

    PDF
  • Development and Deployment of a Disciple Agent for Center of Gravity Analysis

    Gheorghe Tecuci, George Mason University and US Army War College; Mihai Boicu, Dorin Marcu, Bogdan Stanescu, and Cristina Boicu, George Mason University; Jerry Comello and Antonio Lopez, US Army War College; James Donlon, George Mason University and US Army War College; William Cleckner, US Army War College

    853

    PDF

Emerging Applications

  • Applying Perceptually Driven Cognitive Mapping to Virtual Urban Environments

    Randall W. Hill, Jr., Changhee Han, and Michael van Lent, USC Institute for Creative Technologies

    886

    PDF
  • Toward Practical Knowledge-Based Tools for Battle Planning and Scheduling

    Alexander Kott, Larry Ground, and Ray Budd, BBN Technologies; Lakshmi Rebbapragada, U.S. Army CECOM/RDEC/C2D; John Langston, Austin Information Systems

    894

    PDF
  • Knowledge Formation and Dialogue Using the KRAKEN Toolset

    Kathy Panton, Pierluigi Miraglia, Nancy Salay, Robert C. Kahlert, David Baxter, and Roland Reagan, Cycorp, Inc.

    900

    PDF
  • AI on the Battlefield: An Experimental Exploration

    Robert Rasch, Battle Command Battle Lab; Alexander Kott, BBN Technologies; Kenneth D. Forbus, Northwestern University

    906

    PDF
  • Intelligent Control of Auxiliary Ship Systems

    David Scheidt, Christopher McCubbin, Michael Pekala, Shon Vick, and David Alger, The Johns Hopkins University

    913

    PDF
  • Computational Vulnerability Analysis for Information Survivability

    Howard Shrobe, Massachusetts Institute of Technology

    919

    PDF
  • A Web-Based Ontology Browsing and Editing System

    Jérôme Thoméré, SRI International; Ken Barker, University of Texas at Austin; Vinay Chaudhri, SRI International; Peter Clark, Boeing Research and Technology; Michael Eriksen and Sunil Mishra, SRI International; Bruce Porter, University of Texas at Austin; Andres Rodriguez, SRI International

    927

    PDF
  • The 2001 Trading Agent Competition

    Michael P. Wellman, University of Michigan; Amy Greenwald, Brown University; Peter Stone, AT&T Labs - Research; Peter R. Wurman, North Carolina State University

    935

    PDF
  • Getting from Here to There: Interactive Planning and Agent Execution for Optimizing Travel

    José Luis Ambite, Greg Barish, Craig A. Knoblock, Maria Muslea, and Jean Oh, University of Southern California; Steven Minton, Fetch Technologies

    862

    PDF
  • WhyNot: Debugging Failed Queries in Large Knowledge Bases

    Hans Chalupsky and Thomas A. Russ, University of Southern California

    870

    PDF
  • An Analogy Ontology for Integrating Analogical Processing and First-Principles Reasoning

    Kenneth D. Forbus and Thomas Mostek, Northwestern University; Ron Ferguson, Georgia Institute of Technology

    878

    PDF

Student Abstracts

  • Student Modeling for a Web-Based Learning Environment: A Data Mining Approach

    Tiffany Y. Tang and Gordon McCalla, University of Saskatchewan

    967

    PDF
  • An Extended Alternating-Offers Bargaining Protocol for Automated Negotiation in Multi-Agent Systems

    Pinata Winoto, Gordon McCalla, and Julita Vassileva, University of Saskatchewan

    969

    PDF
  • Consistency and Set Intersection

    Yuanlin Zhang and Roland H. C. Yap, National University of Singapore

    971

    PDF
  • Incrementally Solving Functional Constraints

    Yuanlin Zhang and Roland H.C. Yap, National University of Singapore

    973

    PDF
  • Multiple Sequence Alignment Using Anytime A*

    Rong Zhou and Eric A. Hansen, Mississippi State University

    975

    PDF
  • Multiple Instance Learning with Generalized Support Vector Machines

    Stuart Andrews, Thomas Hofmann, and Ioannis Tsochantaridis, Brown University

    943

    PDF
  • Toward a Framework for Assembling Broken Pottery Vessels

    Stuart Andrews and David H. Laidlaw, Brown University

    945

    PDF
  • Mixed-Initiative Exception-Based Learning for Knowledge Base Refinement

    Cristina Boicu, Gheorghe Tecuci, and Mihai Boicu, George Mason University

    947

    PDF
  • Fuzzy Numbers for the Improvement of Causal Knowledge Representation in Fuzzy Cognitive Maps

    Otto X. Cordero and Enrique Peláez, Information Technology Center - ESPOL

    949

    PDF
  • A Genetic Algorithm for Tuning Variable Orderings in Bayesian Network Structure Learning

    Haipeng Guo, Benjamin B. Perry, Julie A. Stilson, and William H. Hsu, Kansas State University

    951

    PDF
  • A Model Checker for Verifying ConGolog Programs

    Leila Kalantari and Eugenia Ternovska, Simon Fraser University

    953

    PDF
  • Analogical Inference over a Common Sense Database

    Thomas Lin, MIT Media Laboratory

    955

    PDF
  • MAKEBELIEVE: Using Commonsense Knowledge to Generate Stories

    Hugo Liu and Push Singh, MIT Media Laboratory

    957

    PDF
  • Localizing while Mapping: A Segment Approach

    Andrew J. Martignoni III and William D. Smart, Washington University

    959

    PDF
  • Multi-Player Game Approach to Solving Multi-Entity Problems

    Wee-Chong Oon and Andrew Lim, National University of Singapore

    961

    PDF
  • BN-Tools: A Software Toolkit for Experimentation in BBNs

    Benjamin Perry and Julie Stilson, Kansas State University

    963

    PDF
  • Optimizing Parameter Learning Using Temporal Differences

    James F. Swafford II, East Carolina University

    965

    PDF

SIGART/AAAI Doctoral Consortium

  • Decision-Theoretic Planning for Intelligent User Interfaces

    Thorsten Bohnenberger, Saarland University

    978

    PDF
  • Efficient Modeling of Temporally Variable User Properties with Dynamic Bayesian Networks

    Boris Brandherm, Saarland University

    979

    PDF
  • Learning in Open-Ended Dynamic Distributed Environments

    Doina Caragea, Iowa State University

    980

    PDF
  • Dynamic Bayesian Networks for Automatic Speech Recognition

    Murat Deviren, INRIA-LORIA

    981

    PDF
  • Combining Inference and Search for the Propositional Satisfiability Problem

    Lyndon Drake and Alan Frisch, University of York; Toby Walsh, University College Cork

    982

    PDF
  • A Bayesian Metareasoner for Algorithm Selection for Real-Time Bayesian Network Inference Problems

    Haipeng Guo, Kansas State University

    983

    PDF
  • An Agent Approach to Security in Pervasive Environments

    Lalana Kagal, University of Maryland Baltimore County

    984

    PDF
  • Generalized Features: Their Application to Classification

    Svetlana Kiritchenko and Stan Matwin, SITE, University of Ottawa

    985

    PDF
  • Organizations of Self-Interested Agents

    Foster McGeary, University of Delaware

    986

    PDF
  • Distributed Constraint Optimization and Its Application to Multiagent Resource Allocation

    Pragnesh Jay Modi, University of Southern California/Information Sciences Institute

    987

    PDF
  • Generating Trading Agent Strategies

    Daniel Reeves, University of Michigan

    988

    PDF
  • A Reputation-Oriented Reinforcement Learning Approach for Agents in Electronic Marketplaces

    Thomas Tran, University of Waterloo

    989

    PDF
  • A Dialogue System with Digression Handling – An Ontology-Based Approach

    Tzong-Han Tsai, National Taiwan University

    990

    PDF

Intelligent Systems Demonstrations

  • Research Applications of the MAGNET Multi-Agent Contracting Testbed

    John Collins and Maria Gini, University of Minnesota

    996

    PDF
  • SpeechWeb: A Web of Natural-Language Speech Applications

    R. A. Frost, University of Windsor

    998

    PDF
  • FlexBot, Groo, Patton and Hamlet: Research Using Computer Games as a Platform

    Aaron Khoo, Robin Hunicke, Greg Dunham, Nick Trienens, and Muon Van, Northwestern University

    1002

    PDF
  • UTTSExam: A University Examination Timetable Scheduler

    Andrew Lim, Juay-Chin Ang, Wee-Kit Ho, and Wee-Chong Oon, National University of Singapore

    1004

    PDF
  • Multi-ViewPoint Clustering Analysis (MVP-CA) Tool

    Mala Mehrotra, Pragati Synergetic Research Inc.; Dmitri Bobrovnikoff, Intelligent Software Solutions

    1006

    PDF
  • Fuzzy Neural Networks in a Palm Environment

    Samuel Moyle and Michael Watts, University of Otago School of Business

    1008

    PDF
  • CAUI Demonstration — Composing Music Based on Human Feelings

    Masayuki Numao, Shoichi Takagi, and Keisuke Nakamura, Tokyo Institute of Technology

    1010

    PDF
  • An Automated Negotiator for an International Crisis

    Penina Hoz-Weiss, Bar-Ilan University; Sarit Kraus, Bar-Ilan University and University of Maryland; Jonathan Wilkenfeld and Tara E. Santmire, University of Maryland

    1174

    PDF
  • Disciple-RKF/COG: Agent Teaching by Subject Matter Experts

    Mihai Boicu, George Mason University; Gheorghe Tecuci, George Mason University and US Army War College; Dorin Marcu, Bogdan Stanescu, Cristina Boicu, Catalin Balan, Marcel Barbulescu, and Xianjun Hao, George Mason University

    992

    PDF
  • JYAG and IDEY: A Template-Based Generator and Its Authoring Tool

    Songsak Channarukul, Susan W. McRoy, and Syed S. Ali, University of Wisconsin - Milwaukee

    994

    PDF

Primary Sidebar