4117 search results - page 219 / 824 » On the Satisfiability of Complex Constraints |
216
click to vote
LICS
1997
IEEE
15 years 10 months ago
1997
IEEE
A subtyping 0 is entailed by a set of subtyping constraints C, written C j= 0, if every valuation (mapping of type variables to ground types) that satisfies C also satisfies 0. ...
246
click to vote
DATE
2004
IEEE
15 years 10 months ago
2004
IEEE
Emerging embedded system applications in multimedia and image processing are characterized by complex control flow consisting of deeply nested conditionals and loops. We present a...
171
click to vote
IJRR
2008
15 years 6 months ago
2008
This paper deals with minimum time trajectory optimization along a specified path subject to thermal constraints. We point out here that robots are often integrated in complex rob...
171
click to vote
CORR
2007
Springer
15 years 6 months ago
2007
Springer
— ”Extended Clifford algebras” are introduced as a means to obtain low ML decoding complexity space-time block codes. Using left regular matrix representations of two speci...
174
click to vote
FORMATS
2008
Springer
15 years 8 months ago
2008
Springer
Metric Temporal Logic (MTL) is a widely-studied real-time extension of Linear Temporal Logic. In this paper we survey results about the complexity of the satisfiability and model c...