841 search results - page 120 / 169 » Approximability of Minimum AND-Circuits |
JSAC
2006
13 years 10 months ago
2006
Abstract--In this paper, we consider a many-to-one sensor network where a large number of sensors are deployed to monitor a physical environment. We explore sensor activity managem...
IJRR
2007
13 years 10 months ago
2007
Efficient algorithms for collision-free energy sub-optimal path planning for formations of spacecraft flying in deep space are presented. The idea is to introduce a set of way-poi...
TSP
2008
13 years 10 months ago
2008
The problem of optimal node density maximizing the Neyman-Pearson detection error exponent subject to a constraint on average (per node) energy consumption is analyzed. The spatial...
ICALP
2010
Springer
14 years 2 months ago
2010
Springer
Computing a minimum vertex cover in graphs and hypergraphs is a well-studied optimizaton problem. While intractable in general, it is well known that on bipartite graphs, vertex c...
INFOCOM
2009
IEEE
14 years 4 months ago
2009
IEEE
—We develop diverse routing schemes for dealing with multiple, possibly correlated, failures. While disjoint path protection can effectively deal with isolated single link failur...