316 search results - page 37 / 64 » On Approximate Majority and Probabilistic Time |
GECCO
2007
Springer
15 years 3 months ago
2007
Springer
In the longest common subsequence problem the task is to find the longest sequence of letters that can be found as subsequence in all members of a given finite set of sequences....
ANOR
2010
14 years 9 months ago
2010
We study some mathematical programming formulations for the origin-destination model in airline revenue management. In particular, we focus on the traditional probabilistic model ...
MA
2010
Springer
14 years 8 months ago
2010
Springer
Model selection by the predictive least squares (PLS) principle has been thoroughly studied in the context of regression model selection and autoregressive (AR) model order estima...
AAAI
2012
13 years 1 days ago
2012
In large extensive form games with imperfect information, Counterfactual Regret Minimization (CFR) is a popular, iterative algorithm for computing approximate Nash equilibria. Whi...
ICC
2007
IEEE
15 years 4 months ago
2007
IEEE
In this paper, we present an analytical model for the approximate calculation of the throughput and end-toend delay performance in single hop and multihop IEEE 802.11 networks unde...