154 search results - page 31 / 31 » On Boosting with Polynomially Bounded Distributions |
COCO
2010
Springer
14 years 2 months ago
2010
Springer
Abstract—We consider two natural extensions of the communication complexity model that are inspired by distributed computing. In both models, two parties are equipped with synchr...
AI
2008
Springer
13 years 11 months ago
2008
Springer
The notion of maintenance often appears in the AI literature in the context of agent behavior and planning. In this paper, we argue that earlier characterizations of the notion of...
SIAMCOMP
2000
13 years 10 months ago
2000
This paper describes a scheme to implement a shared address space of size m on an n-node mesh, with m polynomial in n, where each mesh node hosts a processor and a memory module. A...
INFOCOM
2010
IEEE
13 years 9 months ago
2010
IEEE
—Efficient operation of wireless networks and switches requires using simple (and in some cases distributed) scheduling algorithms. In general, simple greedy algorithms (known a...