147 search results - page 20 / 30 » Optimal Scheduling of Dynamic Progressive Processing |
GECCO
2007
Springer
14 years 2 months ago
2007
Springer
When facing dynamic optimization problems the goal is no longer to find the extrema, but to track their progression through the space as closely as possible. Over these kind of ov...
RTCSA
2000
IEEE
14 years 25 days ago
2000
IEEE
This paper introduces an exact schedulability analysis for the optional computation model urider a specified failure hypothesis. From this analysis, we propose a solutionfor deter...
PAMI
2010
13 years 3 months ago
2010
In this paper, we propose a particle filtering approach for the problem of registering two point sets that differ by a rigid body transformation. Typically, registration algorithms...
SIGMOD
2004
ACM
14 years 8 months ago
2004
ACM
Ranking is an important property that needs to be fully supported by current relational query engines. Recently, several rank-join query operators have been proposed based on rank...
SAGT
2009
Springer
14 years 3 months ago
2009
Springer
In a scheduling game, each player owns a job and chooses a machine to execute it. While the social cost is the maximal load over all machines (makespan), the cost (disutility) of ...