Sciweavers

929 search results - page 170 / 186
» heuristics 2008
Sort
View
TON
2002
117views more  TON 2002»
13 years 7 months ago
Generalized loop-back recovery in optical mesh networks
Current means of providing loop-back recovery, which is widely used in SONET, rely on ring topologies, or on overlaying logical ring topologies upon physical meshes. Loop-back is d...
Muriel Médard, Richard A. Barry, Steven G. ...
CCR
2008
85views more  CCR 2008»
13 years 7 months ago
On cycles in AS relationships
y be more complex than the course modeling abstraction we adopted in [2]. Real AS relationships may depend on a peering point, prefix, and even time [2]. For example, ISPs that dom...
Xenofontas A. Dimitropoulos, M. Ángeles Ser...
PVLDB
2008
126views more  PVLDB 2008»
13 years 7 months ago
Parallelizing query optimization
Many commercial RDBMSs employ cost-based query optimization exploiting dynamic programming (DP) to efficiently generate the optimal query execution plan. However, optimization tim...
Wook-Shin Han, Wooseong Kwak, Jinsoo Lee, Guy M. L...
SADM
2008
178views more  SADM 2008»
13 years 7 months ago
Fast Projection-Based Methods for the Least Squares Nonnegative Matrix Approximation Problem
: Nonnegative matrix approximation (NNMA) is a popular matrix decomposition technique that has proven to be useful across a diverse variety of fields with applications ranging from...
Dongmin Kim, Suvrit Sra, Inderjit S. Dhillon
SCHEDULING
2008
67views more  SCHEDULING 2008»
13 years 7 months ago
Exact train pathing
Suppose we are given a schedule of train movements over a rail network into which a new train is to be included. The origin and the destination are specified for the new train; it...
Viswanath Nagarajan, Abhiram G. Ranade