5105 search results - page 798 / 1021 » An algorithm to determine peer-reviewers |
162
click to vote
AAAI
2007
15 years 9 months ago
2007
We explore a means to both model and reason about partial observability within the scope of constraintbased temporal reasoning. Prior studies of uncertainty in Temporal CSPs have ...
161
click to vote
AAAI
2007
15 years 9 months ago
2007
We present a general framework for determining the number of solutions of constraint satisfaction problems (CSPs) with a high precision. Our first strategy uses additional binary...
168
click to vote
AAAI
2007
15 years 9 months ago
2007
Recent studies have shown that graph-based approaches are effective for semi-supervised learning. The key idea behind many graph-based approaches is to enforce the consistency bet...
198
click to vote
AAAI
2007
15 years 9 months ago
2007
In timed, zero-sum games, the goal is to maximize the probability of winning, which is not necessarily the same as maximizing our expected reward. We consider cumulative intermedi...
183
click to vote
AAAI
2008
15 years 9 months ago
2008
The study of random instances of NP complete and coNP complete problems has had much impact on our understanding of the nature of hard problems. In this work, we initiate an effor...