1242 search results - page 76 / 249 » A Computational Complexity Theory in Membrane Computing |
204
click to vote
MOBICOM
2006
ACM
15 years 12 months ago
2006
ACM
We consider the problem of throughput-optimal scheduling in wireless networks subject to interference constraints. We model the interference using a family of K-hop interference m...
159
click to vote
AI
2010
Springer
15 years 6 months ago
2010
Springer
We consider the problem of finding an unknown graph by using two types of queries with an additive property. Given a graph, an additive query asks the number of edges in a set of ...
188
click to vote
JSAC
2008
15 years 6 months ago
2008
In this paper, we investigate the coverage problem in wireless sensor networks using a game theory method. We assume that nodes are randomly scattered in a sensor field and the goa...
153
click to vote
SIGECOM
2003
ACM
15 years 11 months ago
2003
ACM
Coalition formation is a key problem in automated negotiation among self-interested agents, and other multiagent applications. A coalition of agents can sometimes accomplish thing...
179
click to vote
JCC
2006
15 years 6 months ago
2006
: This article describes a method for solving the geometric closure problem for simplified models of nucleic acid structures by using the constant bond lengths approximation. The r...