3049 search results - page 441 / 610 » On the Convergence of Bound Optimization Algorithms |
136
click to vote
SPAA
1995
ACM
15 years 8 months ago
1995
ACM
We study the problem of sorting on a parallel computer with limited communication bandwidth. By using the PRAM(m) model, where p processors communicate through a globally shared me...
144
click to vote
CORR
2006
Springer
15 years 4 months ago
2006
Springer
In set-system auctions, there are several overlapping teams of agents, and a task that can be completed by any of these teams. The auctioneer's goal is to hire a team and pay...
186
click to vote
ANTSW
2010
Springer
15 years 2 months ago
2010
Springer
We introduce a novel multi-agent patrolling strategy. By assumption, the swarm of agents performing the task consists of very low capability ant-like agents. The agents have littl...
149
click to vote
DC
2007
15 years 4 months ago
2007
Abstract Many reliable distributed systems are consensusbased and typically operate under two modes: a fast normal mode in failure-free synchronous periods, and a slower recovery m...
122
click to vote
JC
2007
15 years 4 months ago
2007
We construct simple algorithms for high-dimensional numerical integration of function classes with moderate smoothness. These classes consist of square-integrable functions over t...