Sciweavers

697 search results - page 22 / 140
» On the Theory of Average Case Complexity
Sort
View
CLUSTER
2005
IEEE
14 years 1 months ago
A Case for Cooperative and Incentive-Based Coupling of Distributed Clusters
Interest in Grid computing has grown significantly over the past five years. Management of distributed cluster resources is a key issue in Grid computing. Central to management ...
Rajiv Ranjan, Rajkumar Buyya, Aaron Harwood
CIKM
2009
Springer
14 years 2 months ago
Role of weak ties in link prediction of complex networks
Plenty of algorithms for link prediction have been proposed and were applied to various real networks. Among these works, the weights of links are rarely taken into account. In th...
Linyuan Lu, Tao Zhou
SAGT
2010
Springer
181views Game Theory» more  SAGT 2010»
13 years 6 months ago
On the Complexity of Pareto-optimal Nash and Strong Equilibria
We consider the computational complexity of coalitional solution concepts in scenarios related to load balancing such as anonymous and congestion games. In congestion games, Paret...
Martin Hoefer, Alexander Skopalik
COMPGEOM
2009
ACM
14 years 14 days ago
Visibility maps of realistic terrains have linear smoothed complexity
We study the complexity of the visibility map of terrains whose triangles are fat, not too steep and have roughly the same size. It is known that the complexity of the visibility ...
Mark de Berg, Herman J. Haverkort, Constantinos P....
KCAP
2003
ACM
14 years 1 months ago
FONTE: factorizing ONTology engineering complexity
Because it is difficult to engineer a complex ontology with time, we here consider a method that allows for factorizing the complexity of the engineering process, FONTE (Factoriz...
Jorge Santos, Steffen Staab