11740 search results - page 275 / 2348 » More Problems in Rewriting |
220
click to vote
HIS
2009
15 years 4 months ago
2009
Scheduling is a key problem in distributed heterogeneous computing systems in order to benefit from the large computing capacity of such systems and is an NP-complete problem. In ...
285
click to vote
SIAMCOMP
2011
14 years 9 months ago
2011
We consider the Minimum Linear Arrangement problem and the (Uniform) Sparsest Cut problem. So far, these two notorious NP-hard graph problems have resisted all attempts to prove in...
161
click to vote
MODELS
2007
Springer
16 years 22 days ago
2007
Springer
Abstract. Since the seminal book by the Gang of Four, design patterns have proven an important tool in software development. Over time, more and more patterns have been discovered ...
190
click to vote
DGCI
2006
Springer
15 years 10 months ago
2006
Springer
Tomography deals with the reconstruction of images from their projections. In this paper we focus on tomographic reconstruction of binary images (i.e., black-and-white) that do not...
167
click to vote
GECCO
2006
Springer
15 years 10 months ago
2006
Springer
In this paper, we present an empirical comparison of some Differential Evolution variants to solve global optimization problems. The aim is to identify which one of them is more s...