1242 search results - page 79 / 249 » A Computational Complexity Theory in Membrane Computing |
138
click to vote
SIGECOM
2005
ACM
15 years 11 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...
180
click to vote
COMPGEOM
2003
ACM
15 years 11 months ago
2003
ACM
We address the problem of curvature estimation from sampled smooth surfaces. Building upon the theory of normal cycles, we derive a definition of the curvature tensor for polyhed...
170
click to vote
CORR
2007
Springer
15 years 6 months ago
2007
Springer
It is well known that, in theory, the general secure multiparty computation problem is solvable using circuit evaluation protocols. However, the communication complexity of the re...
148
click to vote
PODC
2009
ACM
16 years 6 months ago
2009
ACM
We define and study the bandwidth determination problem in adhoc P2P environments. Using point-to-point bandwidth probes, the goal is to quickly determine each host's upload ...
182
click to vote
GECCO
2005
Springer
15 years 11 months ago
2005
Springer
Many real-world problems are multi-objective optimization problems and evolutionary algorithms are quite successful on such problems. Since the task is to compute or approximate t...