ICMAS
2000
13 years 11 months ago
2000
This paper describes a multiagent variant of Dyna-Q called M-Dyna-Q. Dyna-Q is an integrated single-agent framework for planning, reacting, and learning. Like DynaQ, M-Dyna-Q empl...
AAAI
1997
13 years 11 months ago
1997
The problem of counting the number of solutions to a constraint satisfaction problem (CSP) is rephrased in terms of probability updating in Bayes networks. Approximating the proba...
ICMAS
2000
13 years 11 months ago
2000
In automated negotiation systems consisting of self-interested agents, contracts have traditionally been binding. Leveled commitment contracts--i.e., contracts where each party ca...
ICMAS
2000
13 years 11 months ago
2000
Safe exchange is a key issue in multiagent systems, especially in electronic transactions where nondelivery is a major problem. In this paper we present a unified framework for mo...
AAAI
1997
13 years 11 months ago
1997
Thisresearchfocusesona specific class of agentscalled "situated agents", which use minimalcommunication and rely mostlyon changesin the environmentas their cue for actio...
ICMAS
2000
13 years 11 months ago
2000
AAAI
1997
13 years 11 months ago
1997
It is well known that the performance of a stochastic local search procedure depends upon the setting of its noise parameter, and that the optimal setting varies with the problem ...
ICMAS
2000
13 years 11 months ago
2000
Multi-agent systems exploiting case based reasoning techniques have to deal with the problem of retrieving episodes that are themselves distributed across a set of agents. From a ...
AAAI
1997
13 years 11 months ago
1997
In this paper, tabu search for SAT is investigated from an experimental point of view. To this end, TSAT, a basic tabu search algorithm for SAT, is introduced and compared with Se...
AAAI
1997
13 years 11 months ago
1997