9842 search results - page 1627 / 1969 » The Complexity of the Matching-Cut Problem |
183
click to vote
IPPS
2007
IEEE
16 years 1 months ago
2007
IEEE
A comparative study of parallel metaheuristics executed in grid environments is proposed, having as case study a genetic algorithm, a simulated annealing algorithm and a random se...
181
click to vote
IPPS
2007
IEEE
16 years 1 months ago
2007
IEEE
Driven by the increasing componentization of scientific codes, the deployment of high-end system infrastructures such as the Grid, and the desire to support high level problem so...
159
click to vote
IPPS
2007
IEEE
16 years 1 months ago
2007
IEEE
In this paper, we discuss and compare several policies to place replicas in tree networks, subject to server capacity constraints. The client requests are known beforehand, while ...
149
Voted
NCA
2007
IEEE
16 years 1 months ago
2007
IEEE
The Internet is an extremely complex system, and it is essential that we be able to make accurate measurements in order to understand its underlying behavior or to detect improper...
179
click to vote
SIPS
2007
IEEE
16 years 1 months ago
2007
IEEE
System-on-Chip (SoC) designs become more complex nowadays. The communication between each processing element often suffers challenges due to the wiring problem. Networks-on-Chip (...