Sciweavers

1405 search results - page 40 / 281
» Popularity at Minimum Cost
Sort
View
67
Voted
INFOCOM
2008
IEEE
15 years 4 months ago
A Distributed Minimum-Distortion Routing Algorithm with In-Network Data Processing
—In many wired and wireless networks, nodes process input traffic to satisfy a network constraint (e.g. capacity constraints) and to increase the utility of data in the output ...
Ramin Khalili, James F. Kurose
EOR
2006
73views more  EOR 2006»
14 years 9 months ago
Enforcing minimum run length in the cutting stock problem
Deckling, cutting stock or trim loss problems arise when small units are to be fitted into large ones. One aims to reduce stock usage and setups, then favors long runs, surplus ov...
Adolf Diegel, Garth Miller, Edouard Montocchio, Si...
EWSN
2010
Springer
15 years 6 months ago
Querying Dynamic Wireless Sensor Networks with Non-revisiting Random Walks
The simplicity and low-overhead of random walks have made them a popular querying mechanism for Wireless Sensor Networks. However, most of the related work is of theoretical nature...
Marco Zuniga, Chen Avin, Manfred Hauswirth
67
Voted
MOR
2010
98views more  MOR 2010»
14 years 8 months ago
Sharing the Cost of a Capacity Network
We consider a communication network where each pair of users requests a connection guaranteeing a certain capacity. The cost of building capacity is identical across pairs. E cien...
Anna Bogomolnaia, Ron Holzman, Hervé Moulin
CATA
2010
14 years 11 months ago
Finding Good Paths: Applications of Least Cost Caloric Path Computations
As you walk around during your daily life, you commonly make path finding decisions based on the world around you. For example, when you are walking in the outdoors, you take the ...
Zoë J. Wood, Greg Hoffman, Mark Wazny