1566 search results - page 142 / 314 » On a Cone Covering Problem |
155
click to vote
TCS
2010
15 years 3 months ago
2010
The Correlation Clustering problem, also known as the Cluster Editing problem, seeks to edit a given graph by adding and deleting edges to obtain a collection of disconnected cliq...
181
click to vote
STOC
2010
ACM
15 years 8 months ago
2010
ACM
Consider the following two-player communication process to decide a language L: The first player holds the entire input x but is polynomially bounded; the second player is computa...
303
click to vote
Publication
Location discovery is a fundamental problem in wireless ad hoc networks. Most of the ad hoc routing protocols use some form of flooding to discover the location and route of a mobi...
154
click to vote
PETRA
2009
ACM
15 years 11 months ago
2009
ACM
Given a 3D environment, a set of constraints, and a set of sensor models, this paper addresses the problem of finding the set of sensors and their corresponding placement that cov...
163
click to vote
ISCC
2005
IEEE
2005
IEEE
Preserving Area Coverage in Wireless Sensor Networks by Using Surface Coverage Relay Dominating Sets
15 years 10 months ago
— Sensor networks consist of autonomous nodes with limited battery and of base stations with theoritical infinite energy. Nodes can be sleep to extend the lifespan of the networ...