351 search results - page 55 / 71 » Perfect Constraints Are Tractable |
CORR
2008
Springer
13 years 7 months ago
2008
Springer
A set of N independent Gaussian linear time invariant systems is observed by M sensors whose task is to provide the best possible steady-state causal minimum mean square estimate o...
CORR
2010
Springer
13 years 6 months ago
2010
Springer
The Dichotomy Conjecture for Constraint Satisfaction Problems has been verified for conservative problems (or, equivalently, for list homomorphism problems) by Andrei Bulatov. An ...
ACL
2010
13 years 5 months ago
2010
Open-ended spoken interactions are typically characterised by both structural complexity and high levels of uncertainty, making dialogue management in such settings a particularly...
CORR
2010
Springer
13 years 4 months ago
2010
Springer
The structural properties of graphs are usually characterized in terms of invariants, which are functions of graphs that do not depend on the labeling of the nodes. In this paper ...
CDC
2010
IEEE
13 years 2 months ago
2010
IEEE
Potential games are a special class of games that admit tractable static and dynamic analysis. Intuitively, games that are "close" to a potential game should enjoy somewh...