1512 search results - page 52 / 303 » When Suboptimal Rules |
IPPS
1998
IEEE
14 years 2 months ago
1998
IEEE
Interprocessor communication times can be a significant fraction of the overall execution time required for data parallel applications. Large communication to computation ratios o...
ICC
2007
IEEE
14 years 1 months ago
2007
IEEE
Prefetching has been shown to be an effective technique for reducing resource cost and delay in heterogeneous wireless networks. However, in modern wireless local area networks, th...
AIPS
2010
14 years 8 days ago
2010
Anytime search algorithms solve optimisation problems by quickly finding a usually suboptimal solution and then finding improved solutions when given additional time. To deliver a...
CORR
2007
Springer
13 years 10 months ago
2007
Springer
— The distributed source coding problem is considered when the sensors, or encoders, are under Byzantine attack; that is, an unknown number of sensors have been reprogrammed by a...
SIAMCO
2008
13 years 9 months ago
2008
In a sequential Bayesian ranking and selection problem with independent normal populations and common known variance, we study a previously introduced measurement policy which we ...