251 search results - page 42 / 51 » Distributed algorithms for edge dominating sets |
124
click to vote
ICASSP
2011
IEEE
14 years 1 months ago
2011
IEEE
We design two different strategies for computing the unknown content preferences in an online social network based on a small set of nodes in the corresponding social graph for wh...
130
click to vote
CP
2004
Springer
15 years 3 months ago
2004
Springer
The success of stochastic algorithms is often due to their ability to effectively amplify the performance of search heuristics. This is certainly the case with stochastic sampling ...
WSNA
2003
ACM
15 years 2 months ago
2003
ACM
Efficiently self organizing a network hierarchy with specific assignment of roles (or tasks) to sensors based on their physical wireless connectivity and sensing characteristics ...
ATAL
2006
Springer
15 years 1 months ago
2006
Springer
Distributed Constraint Satisfaction Problems (DCSPs) provide a model to capture a broad range of cooperative multiagent problem solving settings. Researchers have generally propos...
DIS
2006
Springer
14 years 11 months ago
2006
Springer
Knowledge discovery systems are constrained by three main limited resources: time, memory and sample size. Sample size is traditionally the dominant limitation, but in many present...