12659 search results - page 375 / 2532 » The distributed breakout algorithms |
202
click to vote
ATAL
2010
Springer
15 years 8 months ago
2010
Springer
Service coordination in domains involving temporal constraints and duration uncertainty has previously been solved with a greedy algorithm that attempts to satisfy service requests...
192
click to vote
ICGI
2010
Springer
15 years 8 months ago
2010
Springer
Angluin showed that the class of regular languages could be learned from a Minimally Adequate Teacher (mat) providing membership and equivalence queries. Clark and Eyraud (2007) sh...
192
click to vote
IPPS
2007
IEEE
16 years 1 months ago
2007
IEEE
Computational grids clusters, provide powerful computing resources for executing applications of large scale. In Grid (clusters) usually several applications run simultaneously.Th...
180
Voted
IPPS
2007
IEEE
16 years 1 months ago
2007
IEEE
The Cray MTA-2 system provides exceptional performance on a variety of sparse graph algorithms. Unfortunately, it was an extremely expensive platform. Cray is preparing an Eldorad...
182
Voted
PDCAT
2007
Springer
16 years 1 months ago
2007
Springer
The high-performance supercomputers will consist of several millions of CPUs in the next decade. The interconnection networks (INs) in such supercomputers play an important role. ...