1484 search results - page 130 / 297 » Ants meeting algorithms |
CORR
2010
Springer
14 years 10 months ago
2010
Springer
The problem of finding "small" sets that meet every straight-line which intersects a given convex region was initiated by Mazurkiewicz in 1916. We call such a set an opa...
ACL
2010
14 years 8 months ago
2010
We explore how to improve machine translation systems by adding more translation data in situations where we already have substantial resources. The main challenge is how to buck ...
APPROX
2005
Springer
15 years 3 months ago
2005
Springer
The field of stochastic optimization studies decision making under uncertainty, when only probabilistic information about the future is available. Finding approximate solutions to...
IJHPCA
2010
14 years 8 months ago
2010
We describe and evaluate a new, pipelined algorithm for large, irregular all-gather problems. In the irregular all-gather problem each process in a set of processes contributes in...
100
click to vote
ICPP
1999
IEEE
1999
IEEE
Multi-Capacity Bin Packing Algorithms with Applications to Job Scheduling under Multiple Constraints
15 years 2 months ago
In past massively parallel processing systems, such as the TMC CM-5 and the CRI T3E, the scheduling problem consisted of allocating a single type of resource among the waiting job...