1242 search results - page 48 / 249 » A Computational Complexity Theory in Membrane Computing |
MOBIHOC
2007
ACM
14 years 9 months ago
2007
ACM
In this paper we study the problem of scheduling wireless links in the geometric SINR model, which explicitly uses the fact that nodes are distributed in the Euclidean plane. We p...
SAGT
2010
Springer
13 years 8 months ago
2010
Springer
We investigate the computational aspects of safe manipulation, a new model of coalitional manipulation that was recently put forward by Slinko and White [11]. In this model, a pot...
COMPGEOM
2001
ACM
14 years 1 months ago
2001
ACM
We present algorithms for constructing a hierarchy of increasingly coarse Morse complexes that decompose a piecewise linear 2-manifold. While Morse complexes are defined only in t...
DCC
2006
IEEE
14 years 9 months ago
2006
IEEE
So far there is no systematic attempt to construct Boolean functions with maximum annihilator immunity. In this paper we present a construction keeping in mind the basic theory of...
ICAART
2010
INSTICC
14 years 6 months ago
2010
INSTICC
There has been a lot of recent work on Bayesian methods for reinforcement learning exhibiting near-optimal online performance. The main obstacle facing such methods is that in most...