1282 search results - page 111 / 257 » Algorithms for Large, Sparse Network Alignment Problems |
153
click to vote
ICC
2011
IEEE
14 years 2 months ago
2011
IEEE
—Location information of nodes is the basis for many applications in wireless sensor networks (WSNs). However, most previous localization methods make the unrealistic assumption:...
135
Voted
SECON
2007
IEEE
15 years 8 months ago
2007
IEEE
—Wireless Sensor Networks (WSNs) require robustness against channel induced errors while retransmission based schemes prove too costly for energy constrained sensor nodes. Channe...
132
Voted
SODA
1998
ACM
15 years 3 months ago
1998
ACM
Given an undirected graph with nonnegative costs on the edges, the routing cost of any of its spanning trees is the sum over all pairs of vertices of the cost of the path between t...
255
click to vote
OL
2011
14 years 9 months ago
2011
We consider sequential quadratic programming (SQP) methods for solving constrained nonlinear programming problems. It is generally believed that SQP methods are sensitive to the a...
106
click to vote
GLOBECOM
2006
IEEE
15 years 8 months ago
2006
IEEE
— We address the problem of connection preemption in a multi-class network environment. Our objective is: i) to minimize the number of preempted connections, and ii) to minimize ...