485 search results - page 64 / 97 » Iterative Bounding LAO |
95
Voted
APPROX
2009
Springer
15 years 4 months ago
2009
Springer
Abstract. Scheduling jobs on unrelated parallel machines so as to minimize the makespan is one of the basic, well-studied problems in the area of machine scheduling. In the first ...
ICC
2007
IEEE
15 years 4 months ago
2007
IEEE
— Exploiting signal space diversity (SSD) to improve the error performance of communications systems over fading channels has been shown to be a very effective technique. The app...
INFOCOM
2007
IEEE
15 years 4 months ago
2007
IEEE
— We consider a collocated wireless network where all links contend for a given channel and each link can hear others’ transmissions. Due to channel fading, the link condition ...
RTA
2005
Springer
15 years 3 months ago
2005
Springer
We present a new method for proving termination of term rewriting systems automatically. It is a generalization of the match bound method for string rewriting. To prove that a term...
SIGGRAPH
1994
ACM
15 years 2 months ago
1994
ACM
In this paper we identify sources of error in global illumination algorithms and derive bounds for each distinct category. Errors arise from three sources: inaccuracies in the bou...