2168 search results - page 417 / 434 » Using Approximation Hardness to Achieve Dependable Computati... |
ICS
2007
Tsinghua U.
14 years 1 months ago
2007
Tsinghua U.
Grid Workflows are emerging as practical programming models for solving large e-scientific problems on the Grid. However, it is typically assumed that the workflow components eith...
FCCM
2006
IEEE
14 years 1 months ago
2006
IEEE
FPGAs are becoming more and more attractive for high precision scientific computations. One of the main problems in efficient resource utilization is the quadratically growing r...
MOBISYS
2010
ACM
13 years 10 months ago
2010
ACM
Most current methods for 802.11-based indoor localization depend on surveys conducted by experts or skilled technicians. Some recent systems have incorporated surveying by users. ...
DCOSS
2008
Springer
13 years 9 months ago
2008
Springer
Abstract. It is an undeniable fact that people want information. Unfortunately, even in today's highly automated society, a lot of the information we desire is still manually ...
CORR
2010
Springer
13 years 7 months ago
2010
Springer
Multiprocessor task scheduling is an important and computationally difficult problem. This paper proposes a comparison study of genetic algorithm and list scheduling algorithm. Bo...