Sciweavers

AI
2010
Springer
13 years 11 months ago
Understanding the scalability of Bayesian network inference using clique tree growth curves
Bayesian networks (BNs) are used to represent and ef ciently compute with multi-variate probability distributions in a wide range of disciplines. One of the main approaches to per...
Ole J. Mengshoel
AI
2008
Springer
13 years 11 months ago
Multi-agent Framework for a Virtual Enterprise of Demand-Responsive Transportation
Abstract. This work presents a multiagent framework design for DemandResponsive Transportation, considering a virtual enterprise domain. The agent architecture obtained provides a ...
Daniel Cabrera, Claudio Cubillos
AI
2010
Springer
13 years 11 months ago
Learning conditional preference networks
We investigate the problem of eliciting CP-nets in the well-known model of exact learning with equivalence and membership queries. The goal is to identify a preference ordering wi...
Frédéric Koriche, Bruno Zanuttini
AI
2010
Springer
13 years 11 months ago
Updating action domain descriptions
How can an intelligent agent update her knowledge base about an action domain, relative to some conditions (possibly obtained from earlier observations)? We study this question in...
Thomas Eiter, Esra Erdem, Michael Fink, Ján...
AI
2010
Springer
13 years 11 months ago
Interactive semantics
instruments. A melody expresses abstract artistic conception or emotion. The explanation ability plays the key role in the externalization and internalization from one form of expr...
Hai Zhuge
AI
2010
Springer
13 years 11 months ago
Elicitation strategies for soft constraint problems with missing preferences: Properties, algorithms and experimental studies
We consider soft constraint problems where some of the preferences may be unspecified. This models, for example, settings where agents are distributed and have privacy issues, or ...
Mirco Gelain, Maria Silvia Pini, Francesca Rossi, ...
AI
2010
Springer
13 years 11 months ago
A logic of delegation
Delegation is a foundational concept for understanding and engineering systems that interact and execute tasks autonomously. By extending recent work on tensed action logic, it be...
Timothy J. Norman, Chris Reed
AI
2010
Springer
13 years 11 months ago
Hidden semi-Markov models
Shun-Zheng Yu
AI
2010
Springer
13 years 11 months ago
Optimal query complexity bounds for finding graphs
We consider the problem of finding an unknown graph by using two types of queries with an additive property. Given a graph, an additive query asks the number of edges in a set of ...
Sung-Soon Choi, Jeong Han Kim