Sciweavers

AAAI
2006
13 years 11 months ago
Analysis of Privacy Loss in Distributed Constraint Optimization
Distributed Constraint Optimization (DCOP) is rapidly emerging as a prominent technique for multiagent coordination. However, despite agent privacy being a key motivation for appl...
Rachel Greenstadt, Jonathan P. Pearce, Milind Tamb...
AAAI
2004
13 years 11 months ago
Analogical Path Planning
We present a probabilistic method for path planning that considers trajectories constrained by both the environment and an ensemble of restrictions or preferences on preferred mot...
Saul Simhon, Gregory Dudek
AAAI
2006
13 years 11 months ago
Towards a Validated Model of "Emotional Intelligence"
1 This article summarizes recent progress in developing a validated computational account of the cognitive antecedents and consequences of emotion. We describe the potential of thi...
Jonathan Gratch, Stacy Marsella, Wenji Mao
AAAI
2004
13 years 11 months ago
Self-Organizing Visual Maps
This paper deals with automatically learning the spatial distribution of a set of images. That is, given a sequence of images acquired from well-separated locations, how can they ...
Robert Sim, Gregory Dudek
AAAI
2006
13 years 11 months ago
TempoExpress: An Expressivity-Preserving Musical Tempo Transformation System
The research described in this paper focuses on global tempo transformations of monophonic audio recordings of saxophone jazz performances. More concretely, we have investigated t...
Maarten Grachten, Josep Lluís Arcos, Ramon ...
AAAI
2004
13 years 11 months ago
The Practice of Approximated Consistency for Knapsack Constraints
Knapsack constraints are a key modeling structure in discrete optimization and form the core of many real-life problem formulations. Only recently, a cost-based filtering algorith...
Meinolf Sellmann
AAAI
2006
13 years 11 months ago
Bounded Treewidth as a Key to Tractability of Knowledge Representation and Reasoning
Several forms of reasoning in AI
Georg Gottlob, Reinhard Pichler, Fang Wei
AAAI
2004
13 years 11 months ago
Continuous Time in a SAT-Based Planner
Ji-Ae Shin, Ernest Davis
AAAI
2006
13 years 11 months ago
Model Counting: A New Strategy for Obtaining Good Bounds
Model counting is the classical problem of computing the number of solutions of a given propositional formula. It vastly generalizes the NP-complete problem of propositional satis...
Carla P. Gomes, Ashish Sabharwal, Bart Selman