680 search results - page 17 / 136 » Complexity of Strict Implication |
CNSR
2008
IEEE
14 years 2 months ago
2008
IEEE
Localizing tiny sensor nodes in large wireless sensor networks is extremely complex, due to the node’s strict resource limitations regarding memory size, processor performance a...
ICALP
2007
Springer
14 years 1 months ago
2007
Springer
This paper studies the gap between classical one-way communication complexity C(f) and its quantum counterpart Q(f), under the unbounded-error setting, i.e., it is enough that the ...
STACS
2001
Springer
14 years 1 days ago
2001
Springer
Langton’s ant is a simple discrete dynamical system, with a surprisingly complex behavior. We study its extension to general planar graphs. First we give some relations between c...
TAMC
2009
Springer
14 years 2 months ago
2009
Springer
In this paper we define the notion of an f(k)-uniform parameterized exponential time scheme. We show that a problem can be solved in parameterized O(2o(f(k)) p(n)) time if and on...
SAMOS
2009
Springer
14 years 2 months ago
2009
Springer
Abstract. In this paper, we present a particularly lightweight, integrative approach to programming and executing applications targeting heterogeneous, dynamically reconfigurable ...