We consider a stochastic variant of the NP-hard 0/1 knapsack problem in which item values are deterministic and item sizes are independent random variables with known, arbitrary d...
Brian C. Dean, Michel X. Goemans, Jan Vondrá...
Understanding how the structure of a network evolves over time is one of the most interesting and complex topics in the field of social networks. In our attempt to model the dynam...
In this paper we present a new technique for rendering very large datasets representing point-sampled surfaces. Rendering efficiency is considerably improved by using stochastic s...
Abstract. We address the problem of continuous stochastic optimal control in the presence of hard obstacles. Due to the non-smooth character of the obstacles, the traditional appro...
Security defense tools like firewalls and antivirus softwares are not sufficient to defend against dynamic threats to database systems. Successful attacks could not only seriously ...