9842 search results - page 1297 / 1969 » The Complexity of the Matching-Cut Problem |
120
click to vote
IPPS
2003
IEEE
16 years 21 days ago
2003
IEEE
We present in this work a wide spectrum of results on analyzing the behavior of parallel heuristics for solving optimization problems. We focus on evolutionary algorithms as well ...
219
click to vote
IPPS
2003
IEEE
16 years 21 days ago
2003
IEEE
Real-time systems usually operate in an environment that changes continuously. These changes cause the performance of the system to vary during run time. An allocation of resource...
212
click to vote
NCA
2003
IEEE
16 years 21 days ago
2003
IEEE
This paper studies the optimal placement of web files for en-route web caching. It is shown that existing placement policies are all solving restricted partial problems of the ...
169
click to vote
COMPGEOM
2003
ACM
16 years 21 days ago
2003
ACM
Randomized incremental constructions are widely used in computational geometry, but they perform very badly on large data because of their inherently random memory access patterns...
175
click to vote
SIGECOM
2003
ACM
16 years 21 days ago
2003
ACM
We consider the problem of minimizing preference elicitation in efficient multiattribute auctions, that support dynamic negotiation over non-price based attributes such as qualit...