Sciweavers

1503 search results - page 235 / 301
» Self-optimizing distributed trees
Sort
View
116
Voted
PGLDB
2003
151views Database» more  PGLDB 2003»
15 years 4 months ago
Web-service-based, Dynamic and Collaborative E-learning
This paper describes an on-going effort to investigate problems and approaches for achieving Web-service-based, dynamic and collaborative e-learning. In this work, a Learning Cont...
Stanley Y. W. Su, Gilliean Lee
156
Voted
ANOR
2007
165views more  ANOR 2007»
15 years 3 months ago
Financial scenario generation for stochastic multi-stage decision processes as facility location problems
The quality of multi-stage stochastic optimization models as they appear in asset liability management, energy planning, transportation, supply chain management, and other applicat...
Ronald Hochreiter, Georg Ch. Pflug
142
Voted
CG
2008
Springer
15 years 3 months ago
Fast, parallel, and asynchronous construction of BVHs for ray tracing animated scenes
Recent developments have produced several techniques for interactive ray tracing of dynamic scenes. In particular, bounding volume hierarchies (BVHs) are efficient acceleration st...
Ingo Wald, Thiago Ize, Steven G. Parker
CN
2006
74views more  CN 2006»
15 years 3 months ago
OMNI: An efficient overlay multicast infrastructure for real-time applications
We consider an overlay architecture (called OMNI) where service providers deploy a set of service nodes (called MSNs) in the network to efficiently implement media-streaming appli...
Suman Banerjee, Christopher Kommareddy, Koushik Ka...
118
Voted
CORR
2006
Springer
123views Education» more  CORR 2006»
15 years 3 months ago
Counting good truth assignments of random k-SAT formulae
We present a deterministic approximation algorithm to compute logarithm of the number of `good' truth assignments for a random k-satisfiability (k-SAT) formula in polynomial ...
Andrea Montanari, Devavrat Shah