667 search results - page 79 / 134 » Approximation algorithms for connected facility location pro... |
183
Voted
JMMA
2002
15 years 5 months ago
2002
Convex polygons in the plane can be defined explicitly as an ordered list of vertices, or given implicitly, for example by a list of linear constraints. The latter representation h...
197
click to vote
IPSN
2009
Springer
16 years 26 days ago
2009
Springer
This paper exploits recent developments in sparse approximation and compressive sensing to efficiently perform localization in a sensor network. We introduce a Bayesian framework...
156
click to vote
DIALM
2004
ACM
15 years 11 months ago
2004
ACM
In many applications of wireless ad hoc and sensor networks, position-awareness is of great importance. Often, as in the case of geometric routing, it is sufficient to have virtua...
173
click to vote
DAGSTUHL
2006
15 years 7 months ago
2006
We consider the computational complexity of producing the best possible offspring in a crossover, given two solutions of the parents. The crossover operators are studied on the cla...
163
click to vote
IPPS
2005
IEEE
15 years 11 months ago
2005
IEEE
Title of thesis: BOOTSTRAPPING FREE-SPACE OPTICAL NETWORKS Fang Liu, Master of Science, 2004 Thesis directed by: Professor Uzi Vishkin Department of Electrical and Computer Engine...