2520 search results - page 200 / 504 » The complexity of approximating entropy |
156
click to vote
CHARME
1997
Springer
15 years 9 months ago
1997
Springer
Formal verification techniques need to deal with the complexity of the systems rified. Most often, this problem is solved by taking an abstract model of the system and aiming at a...
183
click to vote
ICALP
2011
Springer
14 years 9 months ago
2011
Springer
We are given an interval graph G = (V, E) where each interval I ∈ V has a weight wI ∈ R+. The goal is to color the intervals V with an arbitrary number of color classes C1, C2...
274
click to vote
GIS
2006
ACM
16 years 6 months ago
2006
ACM
Moving point object data can be analyzed through the discovery of patterns. We consider the computational efficiency of computing two of the most basic spatio-temporal patterns in...
181
Voted
STOC
2007
ACM
16 years 6 months ago
2007
ACM
We present a polynomial time approximation scheme (PTAS) for the minimum feedback arc set problem on tournaments. A simple weighted generalization gives a PTAS for KemenyYoung ran...
152
Voted
PKDD
2009
Springer
16 years 12 days ago
2009
Springer
Abstract. Innovations such as optimistic exploration, function approximation, and hierarchical decomposition have helped scale reinforcement learning to more complex environments, ...