1257 search results - page 118 / 252 » Near-Optimal Scheduling of Distributed Algorithms |
111
click to vote
SC
2003
ACM
15 years 7 months ago
2003
ACM
We present GridSAT, a parallel and complete satisfiability solver designed to solve non-trivial SAT problem instances using a large number of widely distributed and heterogeneous...
141
Voted
ATAL
2008
Springer
15 years 3 months ago
2008
Springer
Complete algorithms have been proposed to solve problems modelled as distributed constraint optimization (DCOP). However, there are only few attempts to address real world scenari...
140
click to vote
INFOCOM
2007
IEEE
15 years 8 months ago
2007
IEEE
— In this work, we study the problem of minimizing the total power consumption in a multi-hop wireless network subject to a given offered load. It is well-known that the total po...
114
click to vote
ISORC
2005
IEEE
15 years 7 months ago
2005
IEEE
Heuristic algorithms have enjoyed increasing interests and success in the context of Utility Accrual (UA) scheduling. However, few analytical results, such as bounds on task-level...
141
Voted
CCGRID
2006
IEEE
15 years 3 months ago
2006
IEEE
In this paper, we propose a novel resource scheduling strategy, referred to as the Multi-Resource Scheduling (MRS) algorithm, which is capable of handling several resources to be u...