2354 search results - page 321 / 471 » Assignment Problems |
148
click to vote
PVM
2004
Springer
15 years 10 months ago
2004
Springer
Abstract. To practically solve NP-hard combinatorial optimization problems, local search algorithms and their parallel implementations on PVM or MPI have been frequently discussed....
124
click to vote
SAT
2004
Springer
15 years 10 months ago
2004
Springer
We propose and study a technique to improve the performance of those local-search SAT solvers that proceed by executing a prespecified number of tries, each starting with an eleme...
145
click to vote
ICNP
2003
IEEE
15 years 10 months ago
2003
IEEE
This paper targets the problem of optimal resource allocation in overlay multicast, which poses both theoretical and practical challenges. Theoretically, resource allocation among...
145
click to vote
IPPS
2003
IEEE
15 years 10 months ago
2003
IEEE
In a distributed heterogeneous computing system, the resources have different capabilities and tasks have different requirements. To maximize the performance of the system, it is ...
150
click to vote
CP
2003
Springer
15 years 10 months ago
2003
Springer
A binary constraints network consists of a set of n variables, defined on domains of size at most d, and a set of e binary constraints. The binary constraint satisfaction problem ...