159 search results - page 12 / 32 » Computational Complexity of Fundamental Problems in Social C... |
SIGECOM
2005
ACM
15 years 5 months ago
2005
ACM
We study two problems, that of computing social optimum and that of finding fair allocations, in the congestion game model of Milchtaich[8] Although we show that the general prob...
CSE
2009
IEEE
15 years 6 months ago
2009
IEEE
—Multi-agent systems are difficult to develop. One reason for this is that agents are embedded in a society where all agents must agree to obey certain social norms in order for...
105
click to vote
SODA
2000
ACM
15 years 1 months ago
2000
ACM
We present a model that enables us to analyze the running time of an algorithm on a computer with a memory hierarchy with limited associativity, in terms of various cache parameter...
121
click to vote
WSNA
2003
ACM
15 years 5 months ago
2003
ACM
One fundamental issue in sensor networks is the coverage problem, which reflects how well a sensor network is monitored or tracked by sensors. In this paper, we formulate this pr...
111
click to vote
SOFSEM
2000
Springer
15 years 3 months ago
2000
Springer
For half a century since computers came into existence, the goal of finding elegant and efficient algorithms to solve "simple" (welldefined and well-structured) problems ...