Sciweavers

8540 search results - page 1542 / 1708
» The Dynamic Servers Problem
Sort
View
150
Voted
ATAL
2010
Springer
15 years 4 months ago
Point-based backup for decentralized POMDPs: complexity and new algorithms
Decentralized POMDPs provide an expressive framework for sequential multi-agent decision making. Despite their high complexity, there has been significant progress in scaling up e...
Akshat Kumar, Shlomo Zilberstein
124
Voted
ATAL
2010
Springer
15 years 4 months ago
Agent interaction, multiple perspectives, and swarming simulation
Agents in a multi-agent system do not act in a vacuum. The outcome of their efforts depends on the environment in which they seek to act, and in particular on the efforts of other...
H. Van Dyke Parunak, Robert Bisson, Sven A. Brueck...
117
Voted
ATVA
2010
Springer
125views Hardware» more  ATVA 2010»
15 years 4 months ago
Using Redundant Constraints for Refinement
Abstract. This paper is concerned with a method for computing reachable sets of linear continuous systems with uncertain input. Such a method is required for verification of hybrid...
Eugene Asarin, Thao Dang, Oded Maler, Romain Testy...
135
Voted
CEC
2010
IEEE
15 years 4 months ago
Geometric Nelder-Mead Algorithm for the permutation representation
The Nelder-Mead Algorithm (NMA) is an almost half-century old method for numerical optimization, and it is a close relative of Particle Swarm Optimization (PSO) and Differential Ev...
Alberto Moraglio, Julian Togelius
159
Voted
CCGRID
2009
IEEE
15 years 4 months ago
Efficient Grid Task-Bundle Allocation Using Bargaining Based Self-Adaptive Auction
To address coordination and complexity issues, we formulate a grid task allocation problem as a bargaining based self-adaptive auction and propose the BarSAA grid task-bundle alloc...
Han Zhao, Xiaolin Li
« Prev « First page 1542 / 1708 Last » Next »