12707 search results - page 377 / 2542 » A Distributed Arc-Consistency Algorithm |
177
click to vote
ISHPC
2003
Springer
16 years 23 hour ago
2003
Springer
Most cluster systems used in high performance computing do not allow process relocation at run-time. Finding an allocation that results in minimal completion time is NP-hard and (n...
193
click to vote
PPSN
1998
Springer
15 years 11 months ago
1998
Springer
Several methods have been proposed for handling nonlinear constraints by evolutionary algorithms for numerical optimization problems; a survey paper [7] provides an overview of var...
194
click to vote
PPSN
1998
Springer
15 years 11 months ago
1998
Springer
The facility design problem is a common one in manufacturing and service industries and has been studied extensively in the literature. However, restrictions on the scope of the de...
160
click to vote
IPPS
1997
IEEE
15 years 11 months ago
1997
IEEE
The 0 1 MultidimensionalKnapsack Problem (0 1 MKP) is a NP-complete problem. Its resolution for large scale instances requires a prohibitive processing time. In this paper we prop...
170
Voted
ICPP
1995
IEEE
15 years 10 months ago
1995
IEEE
If G is a connected graph with N nodes, its r dimensional product contains Nr nodes. We present an algorithm which sorts Nr keys stored in the rdimensional product of any graph G ...