Sciweavers

69 search results - page 2 / 14
» Modeling Expected Utility of Multi-session Information Disti...
Sort
View
JCST
2010
189views more  JCST 2010»
12 years 11 months ago
Formally Analyzing Expected Time Complexity of Algorithms Using Theorem Proving
Probabilistic techniques are widely used in the analysis of algorithms to estimate the computational complexity of algorithms or a computational problem. Traditionally, such analys...
Osman Hasan, Sofiène Tahar
CIKM
1998
Springer
13 years 9 months ago
Continual Computation Policies for Utility-Directed Prefetching
People accessing documents via the Internet typically experience latencies in retrieving content. We discuss continual-computation policies that dictate strategies for prefetching...
Eric Horvitz
JAIR
2007
120views more  JAIR 2007»
13 years 4 months ago
An Algebraic Graphical Model for Decision with Uncertainties, Feasibilities, and Utilities
Numerous formalisms and dedicated algorithms have been designed in the last decades to model and solve decision making problems. Some formalisms, such as constraint networks, can ...
Cédric Pralet, Gérard Verfaillie, Th...
IDA
1999
Springer
13 years 9 months ago
Reasoning about Input-Output Modeling of Dynamical Systems
The goal of input-output modeling is to apply a test input to a system, analyze the results, and learn something useful from the causeeffect pair. Any automated modeling tool that...
Matthew Easley, Elizabeth Bradley
PST
2004
13 years 6 months ago
Determining Internet Users' Values for Private Information
We examine the problem of determining a user's value for his/her private information. Web businesses often offer rewards, such as discounts, free downloads and website persona...
Scott Buffett, Nathan Scott, Bruce Spencer, Michae...