Sciweavers

334 search results - page 47 / 67
» Inapproximability of Survivable Networks
Sort
View
JCP
2008
117views more  JCP 2008»
13 years 8 months ago
Selfish Constraint Satisfaction Genetic Algorithm for Planning a Long-distance Transportation Network
To build a cooperative logistics network covering multiple enterprises, a planning method that can build a long-distance transportation network is required. Many strict constraints...
Takashi Onoyama, Takuya Maekawa, Yoshitaka Sakurai...
JCO
2006
64views more  JCO 2006»
13 years 8 months ago
Traffic engineering of tunnel-based networks with class specific diversity requirements
Tunnel-based networks such as Multi-protocol Label switching (MPLS) are suitable for providing diversity guarantees to different service classes or customers. Based on the number ...
Shekhar Srivastava, Deep Medhi
AAMAS
2004
Springer
13 years 8 months ago
MARP: A Multi-Agent Routing Protocol for Mobile Wireless Ad Hoc Networks
ACT Supporting mobility in a multi hop wireless environment like the MANET still remains a point of research, especially in the context of time-constrained applications. The incapa...
Romit Roy Choudhury, Krishna Paul, Somprakash Band...
GLOBECOM
2008
IEEE
14 years 3 months ago
A Mobility Prediction-Based Adaptive Data Gathering Protocol for Delay Tolerant Mobile Sensor Network
— The basic operation of Delay Tolerant Mobile Sensor Network (DTMSN) is for pervasive data gathering in networks with intermittent connectivity, where traditional data gathering...
Jinqi Zhu, Jiannong Cao, Ming Liu, Yuan Zheng, Hai...
FOCI
2007
IEEE
14 years 2 months ago
Random Hypergraph Models of Learning and Memory in Biomolecular Networks: Shorter-Term Adaptability vs. Longer-Term Persistency
Recent progress in genomics and proteomics makes it possible to understand the biological networks at the systems level. We aim to develop computational models of learning and memo...
Byoung-Tak Zhang