12194 search results - page 2403 / 2439 » Numberings Optimal for Learning |
102
click to vote
SODA
1992
ACM
15 years 1 months ago
1992
ACM
Given a family of disjoint polygons P1, P2, : : :, Pk in the plane, and an integer parameter m, it is NP-complete to decide if the Pi's can be pairwise separated by a polygon...
110
Voted
ATAL
2010
Springer
15 years 1 months ago
2010
Springer
We introduce a novel case study in which a group of miniaturized robots screen an environment for undesirable agents, and destroy them. Because miniaturized robots are usually end...
99
Voted
ATAL
2010
Springer
15 years 1 months ago
2010
Springer
The coordination of emergency responders and robots to undertake a number of tasks in disaster scenarios is a grand challenge for multi-agent systems. Central to this endeavour is...
110
click to vote
ATAL
2010
Springer
15 years 1 months ago
2010
Springer
We investigate the problem of allocating items (private goods) among competing agents in a setting that is both prior-free and paymentfree. Specifically, we focus on allocating mu...
110
Voted
HPDC
2010
IEEE
15 years 1 months ago
2010
IEEE
In this paper we present a multi-GPU parallel volume rendering implemention built using the MapReduce programming model. We give implementation details of the library, including s...