The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
This paper addresses an ongoing experience in the design of an artificial agent
taking decisions
and combining them with the decisions taken by human agents.
The context is a serious game research project,
aimed at computer-based support for participatory management of protected areas
(and more specifically national parks)
in order to promote biodiversity conservation and social inclusion.
Its objective is
to help various stakeholders (e.g., environmentalist, tourism operator)
to collectively understand...
We apply Coevolutionary Temporal Difference Learning (CTDL) to learn small-board Go strategies represented as weighted piece counters. CTDL is a randomized learning technique which interweaves two search processes that operate in the intra-game and inter-game mode. Intra-game learning is driven by gradient-descent Temporal Difference Learning (TDL), a reinforcement learning method that updates the board evaluation function according to differences observed between its values for consecutively visited...
Cet article décrit une approche de la modélisation d'un système
d'acteurs, particulièrement adaptée à la modélisation des
entreprises, fondée sur la théorie des jeux [11] et sur
l'optimisation par apprentissage du comportement de ces acteurs. Cette
méthode repose sur la combinaison de trois techniques : la simulation
par échantillonnage (Monte-Carlo), la théorie des jeux pour ce qui
concerne la recherche d'équilibre entre les stratégies, et les
méthodes heuristiques d'optimisation locale,...
The minimum cost network flow problem, (MCNFP) constitutes a wide category of network flow problems. Recently a new dual network exterior point simplex algorithm (DNEPSA) for the MCNFP has been developed. This algorithm belongs to a special “exterior point simplex type” category. Similar to the classical dual network simplex algorithm (DNSA), this algorithm starts with a dual feasible tree-solution and after a number of iterations, it produces a solution that is both primal and dual feasible, i.e....
The minimum cost network flow problem, (MCNFP) constitutes a wide category of network
flow problems. Recently a new dual network exterior point simplex algorithm (DNEPSA) for
the MCNFP has been developed. This algorithm belongs to a special “exterior point simplex
type” category. Similar to the classical dual network simplex algorithm (DNSA), this
algorithm starts with a dual feasible tree-solution and after a number of iterations, it
produces a...
Currently displaying 1 –
6 of
6