Sciweavers

279 search results - page 16 / 56
» Reduction approaches for robust shortest path problems
Sort
View
PVLDB
2008
122views more  PVLDB 2008»
14 years 9 months ago
Identifying robust plans through plan diagram reduction
Estimates of predicate selectivities by database query optimizers often differ significantly from those actually encountered during query execution, leading to poor plan choices a...
Harish D., Pooja N. Darera, Jayant R. Haritsa
CN
2007
154views more  CN 2007»
14 years 9 months ago
Disjoint multipath routing using colored trees
— Multipath routing (MPR) is an effective strategy to achieve robustness, load balancing, congestion reduction, and increased throughput in computer networks. Disjoint multipath ...
Srinivasan Ramasubramanian, Harish Krishnamoorthy,...
WOWMOM
2009
ACM
128views Multimedia» more  WOWMOM 2009»
15 years 4 months ago
A queuing modeling approach for Load-Aware Route Selection in heterogeneous mesh networks
Wireless mesh networks are primarily used to provide Internet access by sharing the Internet connections of a limited number of gateways. If traffic is routed in the mesh without...
Raffaele Bruno, Marco Conti, Antonio Pinizzotto
ICCD
2006
IEEE
137views Hardware» more  ICCD 2006»
15 years 6 months ago
Reduction of Crosstalk Pessimism using Tendency Graph Approach
— Accurate estimation of worst-case crosstalk effects is critical for a realistic estimation of the worst-case behavior of deep sub-micron circuits. Crosstalk analysis models usu...
Murthy Palla, Klaus Koch, Jens Bargfrede, Manfred ...
CORR
2007
Springer
113views Education» more  CORR 2007»
14 years 9 months ago
Fast paths in large-scale dynamic road networks
Efficiently computing fast paths in large-scale dynamic road networks (where dynamic traffic information is known over a part of the network) is a practical problem faced by sever...
Giacomo Nannicini, Philippe Baptiste, Gilles Barbi...