952 search results - page 123 / 191 » Computational complexity of stochastic programming problems |
140
click to vote
ATAL
2008
Springer
15 years 5 months ago
2008
Springer
Mixed multi-unit combinatorial auctions are combinatorial auctions in which the auctioneer and the bidders negotiate over transformations rather than over simple goods. By proposi...
108
click to vote
COCO
2005
Springer
15 years 8 months ago
2005
Springer
We continue the study of noncommutative polynomial identity testing initiated by Raz and Shpilka and present efficient algorithms for the following problems in the noncommutative...
156
click to vote
BMCBI
2010
15 years 3 months ago
2010
Background: Mathematical modeling is being applied to increasingly complex biological systems and datasets; however, the process of analyzing and calibrating against experimental ...
139
click to vote
NCA
2003
IEEE
15 years 8 months ago
2003
IEEE
This paper studies the optimal placement of web files for en-route web caching. It is shown that existing placement policies are all solving restricted partial problems of the ...
119
click to vote
ICALP
2007
Springer
15 years 9 months ago
2007
Springer
d Abstract) Marcin Jurdzi´nski and Ashutosh Trivedi Department of Computer Science, University of Warwick, UK In a reachability-time game, players Min and Max choose moves so that...