580 search results - page 50 / 116 » Approximation Algorithms for Temporal Reasoning |
ECML
2004
Springer
15 years 8 months ago
2004
Springer
Reinforcement learning (RL) algorithms attempt to assign the credit for rewards to the actions that contributed to the reward. Thus far, credit assignment has been done in one of t...
146
click to vote
AAAI
2010
15 years 4 months ago
2010
Mini-Bucket Elimination (MBE) is a well-known approximation algorithm deriving lower and upper bounds on quantities of interest over graphical models. It relies on a procedure tha...
151
click to vote
TIME
2003
IEEE
15 years 7 months ago
2003
IEEE
We investigate expressivity and complexity of hybrid logics on linear structures. Hybrid logics are an enrichment of modal logics with certain first-order features which are algo...
106
Voted
DLOG
1998
15 years 3 months ago
1998
Abstract We address the problem of indexing broadcast audiovisual documents (such as films, news). Starting from a collection of so-called shots, we aim at building automatically h...
110
click to vote
CORR
2006
Springer
15 years 2 months ago
2006
Springer
We present a deterministic approximation algorithm to compute logarithm of the number of `good' truth assignments for a random k-satisfiability (k-SAT) formula in polynomial ...