1016 search results - page 91 / 204 » Parallelism Constraints |
126
Voted
EUROPAR
2010
Springer
15 years 3 months ago
2010
Springer
This paper introduces a set object, namely a shared object that allows processes to add and remove values as well as take a snapshot of its content. A new consistency condition su...
136
Voted
PPSN
2010
Springer
15 years 29 days ago
2010
Springer
Abstract. The rooted delay-constrained minimum spanning tree problem is an NP-hard combinatorial optimization problem arising for example in the design of centralized broadcasting ...
137
Voted
IPPS
2010
IEEE
15 years 14 days ago
2010
IEEE
In this paper, we investigate the roles of replication vs. repair to achieve durability in large-scale distributed storage systems. Specifically, we address the fundamental questio...
111
click to vote
IC3
2009
15 years 10 days ago
2009
Abstract. This paper describes a hybrid grouping genetic algorithm for a multiprocessor scheduling problem, where a list of tasks has to be scheduled on identical parallel processo...
112
Voted
ICASSP
2011
IEEE
14 years 6 months ago
2011
IEEE
Algorithms based on the minimization of the Total Variation are prevalent in computer vision. They are used in a variety of applications such as image denoising, compressive sensi...