Sciweavers

4817 search results - page 845 / 964
» Learning Models of Intelligent Agents
Sort
View
134
Voted
ATAL
2003
Springer
15 years 9 months ago
An asynchronous complete method for distributed constraint optimization
We present a new polynomial-space algorithm, called Adopt, for distributed constraint optimization (DCOP). DCOP is able to model a large class of collaboration problems in multi-a...
Pragnesh Jay Modi, Wei-Min Shen, Milind Tambe, Mak...
128
Voted
ATAL
2007
Springer
15 years 7 months ago
Model-based belief merging without distance measures
Merging operators try to define the beliefs of a group of agents according to the beliefs of each member of the group. Several model-based propositional belief merging operators h...
Verónica Borja Macías, Pilar Pozos P...
117
Voted
ATAL
2006
Springer
15 years 7 months ago
A context-aware approach for service selection using ontologies
Selecting the right parties to interact with is a fundamental problem in open and dynamic environments. The problem is exemplified when the number of interacting parties is high a...
Murat Sensoy, Pinar Yolum
154
Voted
ECRA
2002
180views more  ECRA 2002»
15 years 3 months ago
vCOM: Electronic commerce in a collaborative virtual world
Existing e-commerce applications on the web provide the users a relatively simple, browser-based interface to access available products. Customers are not provided with the same s...
Xiaojun Shen, T. Radakrishnan, Nicolas D. Georgana...
152
Voted
AI
2010
Springer
15 years 14 days ago
Robust solutions to Stackelberg games: Addressing bounded rationality and limited observations in human cognition
How do we build algorithms for agent interactions with human adversaries? Stackelberg games are natural models for many important applications that involve human interaction, such...
James Pita, Manish Jain, Milind Tambe, Fernando Or...