16596 search results - page 239 / 3320 » Generalized Assignment Problems |
165
click to vote
ENC
2005
IEEE
16 years 8 days ago
2005
IEEE
Generally, evolutionary algorithms require a large number of evaluations of the objective function in order to obtain a good solution. This paper presents a simple approach to sav...
178
click to vote
ISCAS
2005
IEEE
16 years 7 days ago
2005
IEEE
: Assume that each vertex of a graph G is either a supply vertex or a demand vertex and is assigned a positive integer, called a supply or a demand. Each demand vertex can receive ...
183
click to vote
SIGIR
2004
ACM
16 years 2 days ago
2004
ACM
Organizing Web search results into clusters facilitates users' quick browsing through search results. Traditional clustering techniques are inadequate since they don't g...
156
click to vote
SAT
2004
Springer
16 years 24 min 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...
181
click to vote
IPPS
2003
IEEE
15 years 12 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 ...