663 search results - page 31 / 133 » Algorithms for Computing Minimal Unsatisfiable Subsets of Co... |
TWC
2008
13 years 7 months ago
2008
In this paper, the problem of choosing constellation size and transmit power that minimizes the energy-per-goodbit in a frequency-flat, long-term static fading channel is considere...
IPPS
2005
IEEE
14 years 1 months ago
2005
IEEE
In this paper we propose two price-based job allocation schemes for computational grids. A grid system tries to solve problems submitted by various grid users by allocating the jo...
CLUSTER
2006
IEEE
14 years 1 months ago
2006
IEEE
The paper addresses the problem of matching and scheduling of DAG-structured application to both minimize the makespan and maximize the robustness in a heterogeneous computing sys...
ICDE
2008
IEEE
14 years 9 months ago
2008
IEEE
Aggregate measures summarizing subsets of data are valuable in exploratory analysis and decision support, especially when dependent aggregations can be easily specified and compute...
DAC
2007
ACM
14 years 8 months ago
2007
ACM
A key step in the design of cyclo-static real-time systems is the determination of buffer capacities. In our multi-processor system, we apply back-pressure, which means that tasks...