Sciweavers

402 search results - page 75 / 81
» Maximal Introspection of Agents
Sort
View
92
Voted
ATAL
2009
Springer
15 years 4 months ago
Adaptive price update in distributed Lagrangian relaxation protocol
Distributed Lagrangian Relaxation Protocol (DisLRP) has been proposed to solve a distributed combinatorial maximization problem called the Generalized Mutual Assignment Problem (G...
Katsutoshi Hirayama, Toshihiro Matsui, Makoto Yoko...
ATAL
2007
Springer
15 years 4 months ago
Bidding algorithms for a distributed combinatorial auction
Distributed allocation and multiagent coordination problems can be solved through combinatorial auctions. However, most of the existing winner determination algorithms for combina...
Benito Mendoza García, José M. Vidal
ECML
2004
Springer
15 years 3 months ago
Batch Reinforcement Learning with State Importance
Abstract. We investigate the problem of using function approximation in reinforcement learning where the agent’s policy is represented as a classifier mapping states to actions....
Lihong Li, Vadim Bulitko, Russell Greiner
CEC
2003
IEEE
15 years 3 months ago
A note on general adaptation in populations of painting robots
A population of virtual robots is evolved to perform the task of competitively painting the floor of a toroidal room. Two robots are present in any given room and paint using dis...
Dan Ashlock, Elizabeth Blankenship, Jonathan Gandr...
EAGC
2003
Springer
15 years 3 months ago
Decentralized vs. Centralized Economic Coordination of Resource Allocation in Grids
Application layer networks are software architectures that allow the provisioning of services requiring a huge amount of resources by connecting large numbers of individual compute...
Torsten Eymann, Michael Reinicke, Oscar Ardaiz, Pa...