61 search results - page 12 / 13 » Optimal Task Migration in Service-Oriented Systems: Algorith... |
HPDC
1999
IEEE
13 years 10 months ago
1999
IEEE
Efficient and robust metacomputing requires the decomposition of complex jobs into tasks that must be scheduled on distributed processing nodes. There are various ways of creating...
GECCO
2005
Springer
13 years 11 months ago
2005
Springer
Research in collective robotics is motivated mainly by the possibility of achieving an efficient solution to multi-objective navigation tasks when multiple robots are employed, in...
ATAL
2003
Springer
13 years 11 months ago
2003
Springer
Coalition formation methods allow agents to join together and are thus necessary in cases where tasks can only be performed cooperatively by groups. This is the case in the Reques...
KDD
2009
ACM
14 years 6 months ago
2009
ACM
: ? Improving Clustering Stability with Combinatorial MRFs Bekkerman, Ron; Scholz, Martin; Viswanathan, Krishnamurthy HP Laboratories HPL-2009-46 Clustering stability, combinatoria...
ATAL
2006
Springer
13 years 9 months ago
2006
Springer
Distributing scarce resources among agents in a way that maximizes the social welfare of the group is a computationally hard problem when the value of a resource bundle is not lin...