580 search results - page 13 / 116 » Approximation Algorithms for Temporal Reasoning |
87
Voted
ICIP
2007
IEEE
15 years 6 months ago
2007
IEEE
Practical sparse approximation algorithms (particularly greedy algorithms) suffer two significant drawbacks: they are difficult to implement in hardware, and they are inefficie...
109
Voted
NIPS
1998
15 years 1 months ago
1998
Inference is a key component in learning probabilistic models from partially observable data. When learning temporal models, each of the many inference phases requires a complete ...
91
Voted
NIPS
2007
15 years 1 months ago
2007
We present four new reinforcement learning algorithms based on actor-critic and natural-gradient ideas, and provide their convergence proofs. Actor-critic reinforcement learning m...
112
click to vote
WAOA
2010
Springer
14 years 9 months ago
2010
Springer
The r-domination search game on graphs is a game-theoretical approach to several graph and hypergraph parameters including treewidth and hypertree width. The task is to identify t...
CONCUR
2010
Springer
15 years 23 days ago
2010
Springer
Optimistic concurrency algorithms provide good performance for parallel programs but they are extremely hard to reason about. Program logics such as concurrent separation logic and...