1277 search results - page 238 / 256 » Terminating Decision Algorithms Optimally |
154
click to vote
PODS
2003
ACM
16 years 3 months ago
2003
ACM
We consider the view selection problem for XML content based routing: given a network, in which a stream of XML documents is routed and the routing decisions are taken based on re...
134
click to vote
SIGECOM
2010
ACM
15 years 7 months ago
2010
ACM
One of the fundamental problems in the theory of social choice is aggregating the rankings of a set of agents (or voters) into a consensus ranking. Rank aggregation has found appl...
114
click to vote
VLDB
1998
ACM
15 years 7 months ago
1998
ACM
To fulfill the requirement of fast interactive multidimensional data analysis, database systems precompute aggregate views on some subsets of dimensions and their corresponding hi...
132
click to vote
PLDI
1995
ACM
15 years 6 months ago
1995
ACM
Dynamic dispatching is a major source of run-time overhead in object-oriented languages, due both to the direct cost of method lookup and to the indirect effect of preventing othe...
133
click to vote
NIPS
1998
15 years 4 months ago
1998
In this paper, we consider Markov Decision Processes (MDPs) with error states. Error states are those states entering which is undesirable or dangerous. We define the risk with re...