Sciweavers

62
Voted
ATAL
2010
Springer
15 years 21 days ago
Logic of information flow on communication channels
Yanjing Wang, Floor Sietsma, Jan van Eijck
71
Voted
ATAL
2010
Springer
15 years 21 days ago
A BDI architecture for normative decision making
Natalia Criado, Estefania Argente, Vicente J. Bott...
ATAL
2010
Springer
15 years 21 days ago
Using answer set programming to model multi-agent scenarios involving agents' knowledge about other's knowledge
One of the most challenging aspects of reasoning, planning, and acting in a multi-agent domain is reasoning about what the agents know about the knowledge of their fellows, and to...
Chitta Baral, Gregory Gelfond, Tran Cao Son, Enric...
86
Voted
ATAL
2010
Springer
15 years 21 days ago
Local search for distributed asymmetric optimization
Distributed Constraints Optimization (DCOP) is a powerful framework for representing and solving distributed combinatorial problems, where the variables of the problem are owned b...
Alon Grubshtein, Roie Zivan, Tal Grinshpoun, Amnon...
53
Voted
ATAL
2010
Springer
15 years 21 days ago
An investigation of representations of combinatorial auctions
David Loker, Kate Larson
ATAL
2010
Springer
15 years 21 days ago
Evaluating models of speaker head nods for virtual agents
Virtual human research has often modeled nonverbal behaviors based on the findings of psychological research. In recent years, however, there have been growing efforts to use auto...
Jina Lee, Zhiyang Wang, Stacy Marsella
92
Voted
AAAI
2010
15 years 21 days ago
Biped Walk Learning Through Playback and Corrective Demonstration
Developing a robust, flexible, closed-loop walking algorithm for a humanoid robot is a challenging task due to the complex dynamics of the general biped walk. Common analytical ap...
Çetin Meriçli, Manuela M. Veloso
114
Voted
AAAI
2010
15 years 21 days ago
Computing Cost-Optimal Definitely Discriminating Tests
The goal of testing is to discriminate between multiple hypotheses about a system--for example, different fault diagnoses--by applying input patterns and verifying or falsifying t...
Anika Schumann, Jinbo Huang, Martin Sachenbacher
AAAI
2010
15 years 21 days ago
Algorithms for Finding Approximate Formations in Games
Many computational problems in game theory, such as finding Nash equilibria, are algorithmically hard to solve. This limitation forces analysts to limit attention to restricted su...
Patrick R. Jordan, Michael P. Wellman
99
Voted
AAAI
2010
15 years 21 days ago
Inducing Probability Distributions from Knowledge Bases with (In)dependence Relations
When merging belief sets from different agents, the result is normally a consistent belief set in which the inconsistency between the original sources is not represented. As proba...
Jianbing Ma, Weiru Liu, Anthony Hunter