Sciweavers

2173 search results - page 290 / 435
» On the Values of Reducibility Candidates
Sort
View
SAGA
2009
Springer
16 years 1 months ago
Bounds for Multistage Stochastic Programs Using Supervised Learning Strategies
We propose a generic method for obtaining quickly good upper bounds on the minimal value of a multistage stochastic program. The method is based on the simulation of a feasible dec...
Boris Defourny, Damien Ernst, Louis Wehenkel
ISCA
2007
IEEE
90views Hardware» more  ISCA 2007»
16 years 23 days ago
Transparent control independence (TCI)
AL-ZAWAWI, AHMED SAMI. Transparent Control Independence (TCI). (Under the direction of Dr. Eric Rotenberg). Superscalar architectures have been proposed that exploit control indep...
Ahmed S. Al-Zawawi, Vimal K. Reddy, Eric Rotenberg...
ICNP
2006
IEEE
16 years 16 days ago
On the Practical and Security Issues of Batch Content Distribution Via Network Coding
— File distribution via network coding has received a lot of attention lately. However, direct application of network coding may have security problems. In particular, attackers ...
Qiming Li, Dah-Ming Chiu, John C. S. Lui
SMA
2003
ACM
173views Solid Modeling» more  SMA 2003»
15 years 11 months ago
Automating the CAD/CAE dimensional reduction process
Dimensional reduction is a simplification technique that eliminates one or more dimensions from a boundary value problem. It results in significant computational savings with mini...
Krishnan Suresh
ICNP
2000
IEEE
15 years 11 months ago
General AIMD Congestion Control
Instead of the increase-by-onedecrease-to-halfstrategy used in TCP Reno for congestion window adjustment, we consider the general case such that the increase value and decrease ra...
Yang Richard Yang, Simon S. Lam