Sciweavers

2300 search results - page 359 / 460
» Maximally Concurrent Programs
Sort
View
ANOR
2007
73views more  ANOR 2007»
15 years 2 months ago
A sample-path approach to optimal position liquidation
We consider the problem of optimal position liquidation with the aim of maximizing the expected cash flow stream from the transaction in the presence of temporary or permanent ma...
Pavlo A. Krokhmal, Stan Uryasev
AUTOMATICA
2008
134views more  AUTOMATICA 2008»
15 years 2 months ago
Probabilistic reachability and safety for controlled discrete time stochastic hybrid systems
In this work, probabilistic reachability over a finite horizon is investigated for a class of discrete time stochastic hybrid systems with control inputs. A suitable embedding of ...
Alessandro Abate, Maria Prandini, John Lygeros, Sh...
COR
2008
97views more  COR 2008»
15 years 2 months ago
To be fair or efficient or a bit of both
Introducing a new concept of (, )-fairness, which allows for a bounded fairness compromise, so that a source is allocated a rate neither less than 0 1, nor more than 1, times...
Moshe Zukerman, Musa Mammadov, Liansheng Tan, Irad...
123
Voted
CORR
2010
Springer
154views Education» more  CORR 2010»
15 years 2 months ago
Algorithmic Thermodynamics
Algorithmic entropy can be seen as a special case of entropy as studied in statistical mechanics. This viewpoint allows us to apply many techniques developed for use in thermodyna...
John C. Baez, Mike Stay
111
Voted
EOR
2008
109views more  EOR 2008»
15 years 2 months ago
Basin-wide cooperative water resources allocation
The Cooperative Water Allocation Model (CWAM) is designed within a general mathematical programming framework for modeling equitable and efficient water allocation among competing...
Lizhong Wang, Liping Fang, Keith W. Hipel