Sciweavers

15485 search results - page 444 / 3097
» Computing Optimal Subsets
Sort
View
ICNS
2007
IEEE
16 years 1 months ago
On Maximizing Provider Revenue in Market-Based Compute Grids
Market-based compute grids encompass service providers offering limited resources to potential users with varying demands and willingness to pay. Providers face difficult decisions...
Vladimir Marbukh, Kevin Mills
GECCO
2007
Springer
179views Optimization» more  GECCO 2007»
16 years 1 months ago
XCSF with computed continuous action
Wilson introduced XCSF as a successor to XCS. The major development of XCSF is the concept of a computed prediction. The efficiency of XCSF in dealing with numerical input and con...
Trung Hau Tran, Cédric Sanza, Yves Duthen, ...
CCGRID
2006
IEEE
16 years 28 days ago
Exploit Failure Prediction for Adaptive Fault-Tolerance in Cluster Computing
As the scale of cluster computing grows, it is becoming hard for long-running applications to complete without facing failures on large-scale clusters. To address this issue, chec...
Yawei Li, Zhiling Lan
GECCO
2005
Springer
108views Optimization» more  GECCO 2005»
16 years 11 days ago
Some theoretical results about the computation time of evolutionary algorithms
This paper focuses on the computation time of evolutionary algorithms. First, some exact expressions of the mean first hitting times of general evolutionary algorithms in finite...
Lixin X. Ding, Jinghu Yu
ICDT
2005
ACM
102views Database» more  ICDT 2005»
16 years 11 days ago
Selecting and Using Views to Compute Aggregate Queries (Extended Abstract)
d abstract) Foto Afrati1 and Rada Chirkova2 1 Electrical and Computing Eng., National Technical University of Athens, 157 73 Athens, Greece 2 Computer Science Department, North Car...
Foto N. Afrati, Rada Chirkova