Sciweavers

1508 search results - page 60 / 302
» Efficient Path Profiling
Sort
View
4OR
2005
104views more  4OR 2005»
14 years 11 months ago
The robust shortest path problem with interval data via Benders decomposition
Many real problems can be modelled as robust shortest path problems on digraphs with interval costs, where intervals represent uncertainty about real costs and a robust path is not...
Roberto Montemanni, Luca Maria Gambardella
CGO
2003
IEEE
15 years 5 months ago
Dynamic Trace Selection Using Performance Monitoring Hardware Sampling
Optimizing programs at run-time provides opportunities to apply aggressive optimizations to programs based on information that was not available at compile time. At run time, prog...
Howard Chen, Wei-Chung Hsu, Dong-yuan Chen
BMVC
2001
15 years 2 months ago
Finding Paths in Video Sequences
This paper investigates the task of identifying frequently-used pathways from video sequences of natural outdoor scenes. Path models are adaptively learnt from the accumulation of...
Dimitrios Makris, Tim Ellis
TWC
2008
86views more  TWC 2008»
14 years 11 months ago
On the Spectral Efficiency of CDMA Downlink Cellular Mobile Networks
A new accurate mathematical analysis is presented for the efficient computation of the spectral efficiency of CDMA downlink wireless communication systems in the presence of multip...
Khairi Ashour Hamdi, Pongsatorn Sedtheetorn
INFOCOM
1997
IEEE
15 years 4 months ago
Re-Routing in Circuit Switched Networks
Abstract—Dynamic routing has been adopted in circuit-switched networks in many parts of the world. Most of the routing algorithms used are least loaded routing (LLR) based for it...
Eric W. M. Wong, Andy K. M. Chan, Tak-Shing Peter ...