475 search results - page 45 / 95 » Feasible distributed CSP models for scheduling problems |
145
click to vote
FOCS
2007
IEEE
15 years 10 months ago
2007
IEEE
We present a near-optimal reduction from approximately counting the cardinality of a discrete set to approximately sampling elements of the set. An important application of our wo...
165
click to vote
TC
2002
15 years 4 months ago
2002
We investigate whether asynchronous computational models and asynchronous algorithms can be considered for designing real-time distributed fault-tolerant systems. A priori, the lac...
133
click to vote
MAGS
2008
15 years 4 months ago
2008
This paper is about business modelling and negotiation protocol design in distributed scheduling, where individual agents have individual (potentially conflicting) interests. It i...
150
click to vote
INFOCOM
2011
IEEE
14 years 8 months ago
2011
IEEE
—This paper considers the problem of designing scheduling algorithms for multi-channel (e.g., OFDM-based) wireless downlink systems. We show that the Server-Side Greedy (SSG) rul...
105
click to vote
SPAA
2009
ACM
16 years 5 months ago
2009
ACM
In this paper, we explore the problem of mapping filtering streaming applications on large-scale homogeneous platforms, with a particular emphasis on communication models and thei...