7228 search results - page 396 / 1446 » From Algorithmic to Subjective Randomness |
221
click to vote
SIAMSC
2011
15 years 2 months ago
2011
In a recent paper [Rojas, Santos, Sorensen: ACM ToMS 34 (2008), Article 11] an efficient method for solving the Large-Scale Trust-Region Subproblem was suggested which is based on ...
177
click to vote
CHI
2006
ACM
16 years 7 months ago
2006
ACM
Although speech is a potentially rich information source, a major barrier to exploiting speech archives is the lack of useful tools for efficiently accessing lengthy speech record...
223
click to vote
SAGA
2007
Springer
16 years 1 months ago
2007
Springer
We consider applications of probabilistic techniques in the framework of algorithmic game theory. We focus on three distinct case studies: (i) The exploitation of the probabilistic...
200
click to vote
ICALP
2010
Springer
15 years 12 months ago
2010
Springer
Some of the currently best-known approximation algorithms for network design are based on random sampling. One of the key steps of such algorithms is connecting a set of source nod...
183
click to vote
SODA
2001
ACM
15 years 8 months ago
2001
ACM
In the bus network problem, the goal is to generate a plan for getting from point X to point Y within a city using buses in the smallest expected time. Because bus arrival times a...