Sciweavers

952 search results - page 11 / 191
» Computational complexity of stochastic programming problems
Sort
View
CORR
2008
Springer
208views Education» more  CORR 2008»
13 years 11 months ago
Equilibria, Fixed Points, and Complexity Classes
Many models from a variety of areas involve the computation of an equilibrium or fixed point of some kind. Examples include Nash equilibria in games; market equilibria; computing o...
Mihalis Yannakakis
CPE
1994
Springer
170views Hardware» more  CPE 1994»
14 years 3 months ago
Automatic Scalability Analysis of Parallel Programs Based on Modeling Techniques
When implementingparallel programs forparallel computer systems the performancescalability of these programs should be tested and analyzed on different computer configurations and...
Allen D. Malony, Vassilis Mertsiotakis, Andreas Qu...
DAM
2011
13 years 5 months ago
An integer L-shaped algorithm for the Dial-a-Ride Problem with stochastic customer delays
This paper considers a single-vehicle Dial-a-Ride problem in which customers may experience stochastic delays at their pickup locations. If a customer is absent when the vehicle s...
Géraldine Heilporn, Jean-François Co...
ACCV
2006
Springer
14 years 2 months ago
Complex Activity Representation and Recognition by Extended Stochastic Grammar
Stochastic grammar has been used in many video analysis and event recognition applications as an efficient model to represent large-scale video activity. However, in previous works...
Zhang Zhang, Kaiqi Huang, Tieniu Tan
CSL
2009
Springer
14 years 5 months ago
Decision Problems for Nash Equilibria in Stochastic Games
We analyse the computational complexity of finding Nash equilibria in stochastic multiplayer games with ω-regular objectives.While the existence of an equilibrium whose payoff fal...
Michael Ummels, Dominik Wojtczak