Sciweavers

194 search results - page 21 / 39
» Gathering Algorithms on Paths Under Interference Constraints
Sort
View
MMNS
2003
102views Multimedia» more  MMNS 2003»
13 years 9 months ago
A Heuristic Algorithm for the Multi-constrained Multicast Tree
Multicasting is an important communication mechanism for implementing real-time multimedia applications, which usually require the underlying network to provide a number of quality...
Wen-Lin Yang
GECCO
2003
Springer
112views Optimization» more  GECCO 2003»
14 years 25 days ago
Limits in Long Path Learning with XCS
The development of the XCS Learning Classifier System [26] has produced a stable implementation, able to consistently identify the accurate and optimally general population of cla...
Alwyn Barry
ICDCS
2010
IEEE
13 years 11 months ago
Deployment of a Reinforcement Backbone Network with Constraints of Connection and Resources
In recent years, we have seen a surge of interest in enabling communications over meshed wireless networks. Particularly, supporting peer-to-peer communications over a multi-hop w...
Peng Wei, Shan Chu, Xin Wang, Yu Zhou
ICDCS
2005
IEEE
14 years 1 months ago
A Spatiotemporal Query Service for Mobile Users in Sensor Networks
This paper presents MobiQuery, a spatiotemporal query service that allows mobile users to periodically gather information from their surrounding areas through a wireless sensor ne...
Chenyang Lu, Guoliang Xing, Octav Chipara, Chien-L...
SPAA
2003
ACM
14 years 26 days ago
Short length menger's theorem and reliable optical routing
In the minimum path coloring problem, we are given a graph and a set of pairs of vertices of the graph and we are asked to connect the pairs by colored paths in such a way that pa...
Amitabha Bagchi, Amitabh Chaudhary, Petr Kolman