502 search results - page 35 / 101 » Monotone Approximation of Decision Problems |
111
click to vote
SIGMOD
2001
ACM
15 years 9 months ago
2001
ACM
The ability to approximately answer aggregation queries accurately and efficiently is of great benefit for decision support and data mining tools. In contrast to previous sampling...
CCE
2005
14 years 9 months ago
2005
Process network problems can be formulated as Generalized Disjunctive Programs where a logicbased representation is used to deal with the discrete and continuous decisions. A new ...
111
click to vote
SIAMCOMP
1998
14 years 9 months ago
1998
Motivated by applications in computer graphics, visualization, and scienti c computation, we study the computational complexity of the following problem: Given a set S of n points...
60
Voted
HICSS
2009
IEEE
15 years 4 months ago
2009
IEEE
One knowledge discovery problem in the rapid response setting is the cost of learning which patterns are indicative of a threat. This typically involves a detailed follow-through,...
AAAI
2006
14 years 11 months ago
2006
Partially observable Markov decision processes (POMDPs) are an intuitive and general way to model sequential decision making problems under uncertainty. Unfortunately, even approx...