Sciweavers

874 search results - page 46 / 175
» Practical Algorithms for Selection on Coarse-Grained Paralle...
Sort
View
IJHPCA
2006
99views more  IJHPCA 2006»
13 years 10 months ago
A Pragmatic Analysis Of Scheduling Environments On New Computing Platforms
Today, large scale parallel systems are available at relatively low cost. Many powerful such systems have been installed all over the world and the number of users is always incre...
Lionel Eyraud
PPOPP
2005
ACM
14 years 3 months ago
A sampling-based framework for parallel data mining
The goal of data mining algorithm is to discover useful information embedded in large databases. Frequent itemset mining and sequential pattern mining are two important data minin...
Shengnan Cong, Jiawei Han, Jay Hoeflinger, David A...
SAGT
2010
Springer
160views Game Theory» more  SAGT 2010»
13 years 8 months ago
How Do You Like Your Equilibrium Selection Problems? Hard, or Very Hard?
The PPAD-completeness of Nash equilibrium computation is taken as evidence that the problem is computationally hard in the worst case. This evidence is necessarily rather weak, in ...
Paul W. Goldberg
HPDC
1999
IEEE
14 years 2 months ago
Resource Co-Allocation in Computational Grids
Applications designed to execute on "computational grids" frequently require the simultaneous co-allocation of multiple resources in order to meet performance requiremen...
Karl Czajkowski, Ian T. Foster, Carl Kesselman
IPPS
1999
IEEE
14 years 2 months ago
The Computational Co-op: Gathering Clusters into a Metacomputer
We explore the creation of a metacomputer by the aggregation of independent sites. Joining a metacomputer is voluntary, and hence it has to be an endeavor that mutually benefits a...
Walfredo Cirne, Keith Marzullo