4117 search results - page 302 / 824 » On the Satisfiability of Complex Constraints |
190
click to vote
ICVS
2003
Springer
16 years 8 hour ago
2003
Springer
This paper presents a new scenario recognition algorithm for Video Interpretation. We represent a scenario model with the characters involved in the scenario, with its sub-scenario...
127
click to vote
CDC
2009
IEEE
15 years 11 months ago
2009
IEEE
— Recent results on the control of linear systems subject to time-domain constraints could only handle the case of closed-loop poles that are situated on the real axis. As most c...
170
click to vote
EACL
2003
ACL Anthology
15 years 8 months ago
2003
ACL Anthology
Syntactic constraints in Koskenniemi’s Finite-State Intersection Grammar (FSIG) are logically less complex than their formalism (Koskenniemi et al., 1992) would suggest: It turn...
191
click to vote
EOR
2008
15 years 6 months ago
2008
Our problem of interest consists of minimizing a separable, convex and differentiable function over a convex set, defined by bounds on the variables and an explicit constraint des...
175
click to vote
CEC
2007
IEEE
16 years 1 months ago
2007
IEEE
—Constraint satisfaction problems (CSPs) widely occur in artificial intelligence. In the last twenty years, many algorithms and heuristics were developed to solve CSP. Recently,...