16404 search results - page 93 / 3281 » A set coverage problem |
106
click to vote
ADHOCNOW
2008
Springer
15 years 9 months ago
2008
Springer
Abstract. A wireless ad-hoc network is a collection of transceivers positioned in the plane. Each transceiver is equipped with a limited, nonreplenishable battery charge. The batte...
115
click to vote
LREC
2010
15 years 4 months ago
2010
As the data for more and more languages is finding its way into digital form, with an increasing amount of this data being posted to the Web, it has become possible to collect lan...
174
click to vote
APPROX
2000
Springer
15 years 7 months ago
2000
Springer
Given a graph (directed or undirected) with costs on the edges, and an integer k, we consider the problem of nding a k-node connected spanning subgraph of minimum cost. For the ge...
109
click to vote
COMBINATORICS
2006
15 years 3 months ago
2006
We present both probabilistic and constructive lower bounds on the maximum size of a set of points S Rd such that every angle determined by three points in S is acute, considerin...
100
Voted
JSCIC
2008
15 years 3 months ago
2008
Abstract In this paper, we present a ghost cell/level set method for the evolution of interfaces whose normal velocity depend upon the solutions of linear and nonlinear quasi-stead...