Sciweavers

874 search results - page 4 / 175
» Optimal Scheduling of Contract Algorithms for Anytime Proble...
Sort
View
EUMAS
2006
14 years 11 months ago
Near-Optimal Anytime Coalition Structure Generation
Forming effective coalitions is a major research challenge in the field of multi-agent systems. Central to this endeavour is the problem of determining the best set of agents that...
Talal Rahwan, Sarvapali D. Ramchurn, Viet Dung Dan...
AAAI
2007
15 years 1 days ago
Anytime Optimal Coalition Structure Generation
A key problem when forming effective coalitions of autonomous agents is determining the best groupings, or the optimal coalition structure, to select to achieve some goal. To this...
Talal Rahwan, Sarvapali D. Ramchurn, Viet Dung Dan...
ATAL
2010
Springer
14 years 10 months ago
A distributed algorithm for anytime coalition structure generation
A major research challenge in multi-agent systems is the problem of partitioning a set of agents into mutually disjoint coalitions, such that the overall performance of the system...
Tomasz P. Michalak, Jacek Sroka, Talal Rahwan, Mic...
ICML
2004
IEEE
15 years 10 months ago
Lookahead-based algorithms for anytime induction of decision trees
The majority of the existing algorithms for learning decision trees are greedy--a tree is induced top-down, making locally optimal decisions at each node. In most cases, however, ...
Saher Esmeir, Shaul Markovitch
DSOM
2007
Springer
15 years 3 months ago
Managing Performance of Aging Applications Via Synchronized Replica Rejuvenation
Abstract. We investigate the problem of ensuring and maximizing performance guarantees for applications suering software aging. Our focus is the optimization of the minimum and av...
Artur Andrzejak, Monika Moser, Luís Moura S...