Sciweavers

2080 search results - page 116 / 416
» Measuring empirical computational complexity
Sort
View
AAAI
2008
15 years 6 months ago
Backdoor Trees
The surprisingly good performance of modern satisfiability (SAT) solvers is usually explained by the existence of a certain "hidden structure" in real-world instances. W...
Marko Samer, Stefan Szeider
IJCAI
2003
15 years 5 months ago
Incremental Utility Elicitation with the Minimax Regret Decision Criterion
Utility elicitation is a critical function of any automated decision aid, allowing decisions to be tailored to the preferences of a specific user. However, the size and complexit...
Tianhan Wang, Craig Boutilier
E2EMON
2006
IEEE
15 years 10 months ago
Tuning the Temporal Characteristics of a Kalman-Filter Method for End-to-End Bandwidth Estimation
—In this paper we present a way of tuning the temporal characteristics of a new available-bandwidth estimation method, BART. The estimation engine in this method is Kalman-filter...
Erik Hartikainen, Svante Ekelin
ACL
2009
15 years 2 months ago
Knowing the Unseen: Estimating Vocabulary Size over Unseen Samples
Empirical studies on corpora involve making measurements of several quantities for the purpose of comparing corpora, creating language models or to make generalizations about spec...
Suma Bhat, Richard Sproat
WIOPT
2011
IEEE
14 years 8 months ago
LIFO-Backpressure achieves near optimal utility-delay tradeoff
There has been considerable recent work developing a new stochastic network utility maximization framework using Backpressure algorithms, also known as MaxWeight. A key open probl...
Longbo Huang, Scott Moeller, Michael J. Neely, Bha...