Sciweavers

887 search results - page 6 / 178
» A Time for Choosing
Sort
View
IJIS
2006
44views more  IJIS 2006»
13 years 7 months ago
Optimal choice of granularity in commonsense estimation: Why half-orders of magnitude?
It has been observed that when people make crude estimates, they feel comfortable choosing between alternatives which differ by a half-order of magnitude (e.g., were there 100, 30...
Jerry R. Hobbs, Vladik Kreinovich
COLT
2004
Springer
13 years 11 months ago
The Budgeted Multi-armed Bandit Problem
straction of the following scenarios: choosing from among a set of alternative treatments after a fixed number of clinical trials, determining the best parameter settings for a pro...
Omid Madani, Daniel J. Lizotte, Russell Greiner
LISA
2000
13 years 9 months ago
Aberrant Behavior Detection in Time Series for Network Monitoring
The open-source software RRDtool and Cricket provide a solution to the problem of collecting, storing, and visualizing service network time series data for the real-time monitorin...
Jake D. Brutlag
SAS
2004
Springer
14 years 29 days ago
A Polynomial-Time Algorithm for Global Value Numbering
We describe a polynomial-time algorithm for global value numbering, which is the problem of discovering equivalences among program sub-expressions. We treat all conditionals as non...
Sumit Gulwani, George C. Necula
IPL
2000
96views more  IPL 2000»
13 years 7 months ago
On bounded occurrence constraint satisfaction
An approximation algorithm for a constraint satisfaction problem is said to be nontrivial if its performance ratio is strictly superior to the expected performance of the algorith...
Johan Håstad