Sciweavers

1594 search results - page 88 / 319
» An Algorithm to Compute Collusion Paths
Sort
View
NETWORKING
2000
15 years 4 months ago
An Algorithm for Multicast with Multiple QoS Constraints and Dynamic Membership
In this paper we present an algorithm to construct low-cost source trees for multicast with multiple QoS constraints and dynamic membership. Assuming the availability of link-state...
Aiguo Fei, Mario Gerla
GECCO
2003
Springer
112views Optimization» more  GECCO 2003»
15 years 8 months 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
GLOBECOM
2007
IEEE
15 years 9 months ago
LSP Setup Arrival Reordering Approach for MPLS-TE Routing
— In this paper, we evaluate a solution based on the preemption mechanism so as to improve performances of distributed Multi-Protocol Label Switching-Traffic Engineering (MPLS-T...
Imène Chaieb, Jean-Louis Le Roux, Bernard C...
111
Voted
LCN
2007
IEEE
15 years 9 months ago
Emergency Evacuation using Wireless Sensor Networks
—This paper presents a distributed algorithm to direct evacuees to exits through arbitrarily complex building layouts in emergency situations. The algorithm finds the safest pat...
Matthew Barnes, Hugh Leather, D. K. Arvind
CIKM
2010
Springer
15 years 1 months ago
Fast and accurate estimation of shortest paths in large graphs
Computing shortest paths between two given nodes is a fundamental operation over graphs, but known to be nontrivial over large disk-resident instances of graph data. While a numbe...
Andrey Gubichev, Srikanta J. Bedathur, Stephan Seu...