Sciweavers

5214 search results - page 854 / 1043
» The Online Specialization Problem
Sort
View
SAGT
2010
Springer
181views Game Theory» more  SAGT 2010»
15 years 5 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
SCN
2010
Springer
145views Communications» more  SCN 2010»
15 years 5 months ago
Distributed Private-Key Generators for Identity-Based Cryptography
An identity-based encryption (IBE) scheme can greatly reduce the complexity of sending encrypted messages. However, an IBE scheme necessarily requires a private-key generator (PKG)...
Aniket Kate, Ian Goldberg
SDM
2010
SIAM
166views Data Mining» more  SDM 2010»
15 years 5 months ago
Directed Network Community Detection: A Popularity and Productivity Link Model
In this paper, we consider the problem of community detection in directed networks by using probabilistic models. Most existing probabilistic models for community detection are ei...
Tianbao Yang, Yun Chi, Shenghuo Zhu, Yihong Gong, ...
SPRINGSIM
2010
15 years 5 months ago
GTNA: a framework for the graph-theoretic network analysis
Concise and reliable graph-theoretic analysis of complex networks today is a cumbersome task, consisting essentially of the adaptation of intricate libraries for each specific pr...
Benjamin Schiller, Dirk Bradler, Immanuel Schweize...
SUTC
2010
IEEE
15 years 5 months ago
Resource-Aware Scheduling of Distributed Ontological Reasoning Tasks in Wireless Sensor Networks
Abstract—As the number of wireless sensor network applications continues to grow, the need for specialized task scheduling mechanisms, aware of the sensor devices’ capabilities...
Tim De Pauw, Stijn Verstichel, Bruno Volckaert, Fi...