4810 search results - page 373 / 962 » Modeling Value Speculation |
171
click to vote
UAI
2008
15 years 8 months ago
2008
Deciding what to sense is a crucial task, made harder by dependencies and by a nonadditive utility function. We develop approximation algorithms for selecting an optimal set of me...
160
click to vote
WCET
2008
15 years 8 months ago
2008
Conditional branches connect the values of program variables with the execution paths and thus with the execution times, including the worstcase execution time (WCET). Flow analys...
189
click to vote
AAAI
2004
15 years 8 months ago
2004
A binary constraint network is tree convex if we can construct a tree for the domain of the variables so that for any constraint, no matter what value one variable takes, all the ...
191
Voted
AIPS
2009
15 years 8 months ago
2009
We propose an online algorithm for planning under uncertainty in multi-agent settings modeled as DEC-POMDPs. The algorithm helps overcome the high computational complexity of solv...
150
click to vote
FSTTCS
2008
Springer
15 years 7 months ago
2008
Springer
Abstract. We study the decision theory of a maximally risk-averse investor — one whose objective, in the face of stochastic uncertainties, is to minimize the probability of ever ...