1059 search results - page 180 / 212 » Improved Algorithms via Approximations of Probability Distri... |
GLOBECOM
2007
IEEE
14 years 3 months ago
2007
IEEE
— A relay selection approach has previously been shown to outperform repetition-based scheduling for both amplify-and-forward (AF) and decode-and-forward (DF) cooperative network...
STOC
2006
ACM
14 years 9 months ago
2006
ACM
We study rerouting policies in a dynamic round-based variant of a well known game theoretic traffic model due to Wardrop. Previous analyses (mostly in the context of selfish routi...
GECCO
2005
Springer
14 years 2 months ago
2005
Springer
Several ways of using singular value decomposition (SVD), a linear algebra technique typically used for information retrieval, to decompose problems into subproblems are investiga...
ISAAC
2007
Springer
14 years 3 months ago
2007
Springer
Social networks support efficient decentralized search: people can collectively construct short paths to a specified target in the network. Rank-based friendship—where the prob...
ATAL
2003
Springer
14 years 2 months ago
2003
Springer
Despite the success of the BDI approach to agent teamwork, initial role allocation (i.e. deciding which agents to allocate to key roles in the team) and role reallocation upon fai...