Sciweavers

1224 search results - page 131 / 245
» Theory decision by decomposition
Sort
View
123
Voted
ALDT
2009
Springer
207views Algorithms» more  ALDT 2009»
15 years 7 months ago
Anytime Self-play Learning to Satisfy Functional Optimality Criteria
We present an anytime multiagent learning approach to satisfy any given optimality criterion in repeated game self-play. Our approach is opposed to classical learning approaches fo...
Andriy Burkov, Brahim Chaib-draa
ALDT
2009
Springer
155views Algorithms» more  ALDT 2009»
15 years 7 months ago
Insuring Risk-Averse Agents
Abstract. In this paper we explicitly model risk aversion in multiagent interactions. We propose an insurance mechanism that be can used by risk-averse agents to mitigate against r...
Greg Hines, Kate Larson
94
Voted
CIE
2007
Springer
15 years 7 months ago
Binary Trees and (Maximal) Order Types
Concerning the set of rooted binary trees, one shows that Higman’s Lemma and Dershowitz’s recursive path ordering can be used for the decision of its maximal order type accordi...
Gyesik Lee
97
Voted
GLOBECOM
2006
IEEE
15 years 6 months ago
Dynamic Wavelength Sharing Policies for Absolute QoS in OBS Networks
— We consider the problem of providing absolute QoS guarantees to multiple classes of users of an OBS network in terms of the end-to-end burst loss. We employ Markov decision pro...
Li Yang, George N. Rouskas
102
Voted
FOSSACS
2005
Springer
15 years 6 months ago
Third-Order Idealized Algol with Iteration Is Decidable
The problems of contextual equivalence and approximation are studied for the third-order fragment of Idealized Algol with iteration (IA∗ 3). They are approached via a combination...
Andrzej S. Murawski, Igor Walukiewicz