5889 search results - page 894 / 1178 » Graph Layout Problems |
189
click to vote
CSL
2009
Springer
16 years 1 months ago
2009
Springer
Abstract. One-counter processes are pushdown processes over a singleton stack alphabet (plus a stack-bottom symbol). We study the problems of model checking asynchronous products o...
191
click to vote
MDM
2009
Springer
16 years 1 months ago
2009
Springer
— This work aims at minimize the cost of answering snapshot multi-predicate queries in high-communication-cost networks. High-communication-cost (HCC) networks is a family of net...
163
click to vote
TAMC
2009
Springer
16 years 1 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...
190
click to vote
CISS
2008
IEEE
16 years 1 months ago
2008
IEEE
— In this paper, we present a distributed algorithm for detecting redundancies in a sensor network with no location information. We demonstrate how, in the absence of localizatio...
143
click to vote
INFOCOM
2008
IEEE
16 years 1 months ago
2008
IEEE
—A fundamental problem in wireless networks is to estimate its throughput capacity - given a set of wireless nodes, and a set of connections, what is the maximum rate at which da...