Sciweavers

23589 search results - page 173 / 4718
» Uncheatable Distributed Computations
Sort
View
TPDS
1998
118views more  TPDS 1998»
14 years 9 months ago
Optimizing Computing Costs Using Divisible Load Analysis
—A bus oriented network where there is a charge for the amount of divisible load processed on each processor is investigated. A cost optimal processor sequencing result is found ...
Jeeho Sohn, Thomas G. Robertazzi, Serge Luryi
TC
2002
14 years 9 months ago
Performance Modeling and Prediction of Nondedicated Network Computing
The low cost and wide availability of networks of workstations have made them an attractive solution for high performance computing. However, while a network of workstations may be...
Linguo Gong, Xian-He Sun, Edward F. Watson
107
Voted
IAT
2010
IEEE
14 years 8 months ago
Continuous Double Auction in Grid Computing: An Agent Based Approach to Maximize Profit for Providers
Economic models are found efficient in managing heterogeneous computer resources such as storage, CPU and memory for grid computing. Commodity market, double auction and contract-n...
S. M. Aminul Haque, Saadat M. Alhashmi, Rajendran ...
95
Voted
ITIIS
2010
150views more  ITIIS 2010»
14 years 8 months ago
Computational Trust and Its Impact over Rational Purchasing Decisions of Internet Users
As web-based online communities are rapidly growing, the agents in the communities need to know their measurable belief of trust for safe and successful interactions. In this pape...
Sanguk Noh
93
Voted
CORR
2011
Springer
144views Education» more  CORR 2011»
14 years 5 months ago
On Properties of the Minimum Entropy Sub-tree to Compute Lower Bounds on the Partition Function
— Computing the partition function and the marginals of a global probability distribution are two important issues in any probabilistic inference problem. In a previous work, we ...
Mehdi Molkaraie, Payam Pakzad