14548 search results - page 2796 / 2910 » The Optimal Path-Matching Problem |
COCOON
2010
Springer
15 years 4 months ago
2010
Springer
We study algorithms for clustering data that were recently proposed by Balcan, Blum and Gupta in SODA’09 [4] and that have already given rise to two follow-up papers. The input f...
149
click to vote
AGENTS
2001
Springer
15 years 4 months ago
2001
Springer
In this paper, we investigate the use of hierarchical reinforcement learning (HRL) to speed up the acquisition of cooperative multi-agent tasks. We introduce a hierarchical multi-a...
SIGGRAPH
2000
ACM
15 years 4 months ago
2000
ACM
The traditional high-level algorithms for rigid body simulation work well for moderate numbers of bodies but scale poorly to systems of hundreds or more moving, interacting bodies...
PODC
1999
ACM
15 years 4 months ago
1999
ACM
We study the memory requirements of self-stabilizing leader election (SSLE) protocols. We are mainly interested in two types of systems: anonymous systems and id-based systems. We...
STOC
1999
ACM
15 years 4 months ago
1999
ACM
We considered non-clairvoyant multiprocessor scheduling of jobs with arbitrary arrival times and changing execution characteristics. The problem has been studied extensively when ...