674 search results - page 48 / 135 » The computational complexity of the parallel knock-out probl... |
129
click to vote
KES
1999
Springer
15 years 5 months ago
1999
Springer
Abstract—Dynamic Demes is a new method for the parallelisation of evolutionary algorithms. It was derived as a combination of two other parallelisation algorithms: the master-sla...
ISPDC
2007
IEEE
15 years 7 months ago
2007
IEEE
The problem of optimal matrix partitioning for parallel linear algebra on p heterogeneous processors is typically reduced to the geometrical problem of partitioning a unit square ...
IPPS
2008
IEEE
15 years 7 months ago
2008
IEEE
Emerging configurable infrastructures (large-scale overlays, grids, distributed testbeds, and sensor networks among others) comprise diverse sets of computing resources and netwo...
PPSN
2000
Springer
15 years 5 months ago
2000
Springer
Domain knowledge is essential for successful problem solving and optimization. This paper introduces a framework in which a form of automatic domain knowledge extraction can be im...
103
click to vote
PDPTA
2010
14 years 11 months ago
2010
- Complex business service systems, such as SOA system, are prone to suffer from reliability problem. Various legend applications compatible in SOA system make things worse. Softwa...