Sciweavers

1941 search results - page 286 / 389
» On Generalizations of Network Design Problems with Degree Bo...
Sort
View
NETWORK
2007
167views more  NETWORK 2007»
14 years 9 months ago
Sensor Localization under Limited Measurement Capabilities
If we abstract a sensor network as a network graph consisting of vertices and edges, where vertices represent sensor nodes and edges represent distance measurements between neighbo...
Chen Wang, Li Xiao
TRIDENTCOM
2008
IEEE
15 years 4 months ago
Performance analysis of a lightweight NEMO implementation for low-end devices
IETF Network Mobility (NEMO) Basic Support Protocol is an IP mobility management protocol designed to provide seamless IP mobility to complete networks. This protocol is of crucia...
J. L. Almodovar, Antonio de la Oliva, C. Lazo Ram,...

Publication
303views
13 years 8 months ago
Evolutionary synthesis of analog networks
he significant increase in the available computational power that took place in recent decades has been accompanied by a growing interest in the application of the evolutionary ap...
Claudio Mattiussi
SOCO
2010
Springer
14 years 4 months ago
Taximeter verification with GPS and soft computing techniques
Until recently, local governments in Spain were using machines with rolling cylinders for verifying taximeters. However, the condition of the tires can lead to errors in the proces...
José Villar, Adolfo Otero, José Oter...
SODA
1998
ACM
157views Algorithms» more  SODA 1998»
14 years 11 months ago
A Polynomial Time Approximation Scheme for Minimum Routing Cost Spanning Trees
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...
Bang Ye Wu, Giuseppe Lancia, Vineet Bafna, Kun-Mao...