Sciweavers

570 search results - page 69 / 114
» Approximating Some Network Design Problems with Node Costs
Sort
View
COCOA
2009
Springer
14 years 5 days ago
An Effective Hybrid Algorithm for the Circles and Spheres Packing Problems
stract to be announcedPlenary session 09:00-10:00 Panos M, Pardalos, University of Florida, USA Tea Break 10:00-10:20 At the 1st floor 10:20-10:45 Polynomial Approximation Schemes ...
Jingfa Liu, Yonglei Yao, Yu Zheng, Huantong Geng, ...
WETICE
2006
IEEE
14 years 2 months ago
Exploiting the TTL Rule in Unstructured Peer-to-Peer Networks
Peer-to-Peer networks exist with the volunteering cooperation of various entities on the Internet. Their self-structure nature has the important characteristic that they make no u...
Georgios Pitsilis, Panayiotis Periorellis
ICC
2007
IEEE
104views Communications» more  ICC 2007»
14 years 3 months ago
A Novel Graph Model for Maximum Survivability in Mesh Networks under Multiple Generic Risks
— This paper investigates the path protection problem in mesh networks under multiple generic risks. Disjoint logical links may fail simultaneously if they share the same compone...
Qingya She, Xiaodong Huang, Jason P. Jue
EWSN
2004
Springer
14 years 8 months ago
Lessons from a Sensor Network Expedition
Habitat monitoring is an important driving application for wireless sensor networks (WSNs). Although researchers anticipate some challenges arising in the real-world deployments of...
Robert Szewczyk, Joseph Polastre, Alan M. Mainwari...
HEURISTICS
2000
127views more  HEURISTICS 2000»
13 years 8 months ago
Fast, Efficient Equipment Placement Heuristics for Broadband Switched or Internet Router Networks
Planning and designing the next generation of IP router or switched broadband networks seems a daunting challenge considering the many complex, interacting factors affecting the p...
Joel W. Gannett