227 search results - page 40 / 46 » Complexity Results for Compressing Optimal Paths |
101
click to vote
SAC
2005
ACM
15 years 4 months ago
2005
ACM
In parallel and distributed processing, tasks are ordinarily clustered and assigned to different processors or machines before they are scheduled. The assignment of tasks to proc...
88
Voted
SIGGRAPH
2010
ACM
15 years 3 months ago
2010
ACM
We describe a framework for the automatic synthesis of biped locomotion controllers that adapt to uneven terrain at run-time. The framework consists of two components: a per-foots...
SIAMDM
2008
14 years 11 months ago
2008
Let G be a connected graph, and let V and V two n-element subsets of its vertex set V (G). Imagine that we place a chip at each element of V and we want to move them into the posi...
TPDS
2008
14 years 11 months ago
2008
In this paper, we discuss and compare several policies to place replicas in tree networks, subject to server capacity and Quality of Service (QoS) constraints. The client requests ...
IPPS
2007
IEEE
15 years 5 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...