Sciweavers

12659 search results - page 2221 / 2532
» The distributed breakout algorithms
Sort
View
CGF
2008
200views more  CGF 2008»
15 years 6 months ago
Deep Opacity Maps
We present a new method for rapidly computing shadows from semi-transparent objects like hair. Our deep opacity maps method extends the concept of opacity shadow maps by using a d...
Cem Yuksel, John Keyser
156
Voted
CGF
2008
167views more  CGF 2008»
15 years 6 months ago
Illustrative Parallel Coordinates
Illustrative parallel coordinates (IPC) is a suite of artistic rendering techniques for augmenting and improving parallel coordinate (PC) visualizations. IPC techniques can be use...
Kevin T. McDonnell, Klaus Mueller
COR
2010
177views more  COR 2010»
15 years 6 months ago
Hybridization of very large neighborhood search for ready-mixed concrete delivery problems
Companies in the concrete industry are facing the following scheduling problem on a daily basis: concrete produced at several plants has to be delivered at customers' constru...
Verena Schmid, Karl F. Doerner, Richard F. Hartl, ...
CORR
2010
Springer
80views Education» more  CORR 2010»
15 years 6 months ago
Multi-path Probabilistic Available Bandwidth Estimation through Bayesian Active Learning
Knowing the largest rate at which data can be sent on an end-to-end path such that the egress rate is equal to the ingress rate with high probability can be very practical when ch...
Frederic Thouin, Mark Coates, Michael Rabbat
CORR
2010
Springer
121views Education» more  CORR 2010»
15 years 6 months ago
Asynchronous Bounded Expected Delay Networks
We propose a natural generalisation of asynchronous bounded delay (ABD) network models. The commonly used ABD models assume a known bound on message delay. This assumption is ofte...
Rena Bakhshi, Jörg Endrullis, Wan Fokkink, Ju...
« Prev « First page 2221 / 2532 Last » Next »