Sciweavers

2796 search results - page 291 / 560
» The coolest path problem
Sort
View
ICDCS
2010
IEEE
15 years 8 months ago
Minimizing Probing Cost and Achieving Identifiability in Network Link Monitoring
Continuously monitoring the link performance is important to network diagnosis. Recently, active probes sent between end systems are widely used to monitor the link performance. I...
Qiang Zheng, Guohong Cao
ISCAS
1994
IEEE
117views Hardware» more  ISCAS 1994»
15 years 10 months ago
Design of a Fast Sequential Decoding Algorithm Based on Dynamic Searching Strategy
This paper presents a new sequential decoding algorithm based on dynamic searching strategy to improve decoding efficiency. The searching strategy is to exploit both sorting and p...
Wen-Wei Yang, Li-Fu Jeng, Chen-Yi Lee
GECCO
2000
Springer
168views Optimization» more  GECCO 2000»
15 years 10 months ago
A Fault-tolerant Multicast Routing Algorithm in ATM Networks
This paper presents a genetic algorithm based method to solve the capacity and routing assignment problem arising in the design of selfhealing networks using the Virtual Path (VP)...
Sam Kwong, S. S. Chan
PUK
2003
15 years 8 months ago
Accelerating Heuristic Search in Spatial Domains
This paper exploits the spatial representation of state space problem graphs to preprocess and enhance heuristic search engines. It combines classical AI exploration with computati...
Stefan Edelkamp, Shahid Jabbar, Thomas Willhalm
AUTOMATICA
2010
99views more  AUTOMATICA 2010»
15 years 6 months ago
Continuous trajectory planning of mobile sensors for informative forecasting
This paper addresses planning of continuous paths for mobile sensors to reduce uncertainty in some quantities of interest in the future. The mutual information between the measure...
Han-Lim Choi, Jonathan P. How