86 search results - page 7 / 18 » Polynomial Constraints for Sets with Cardinality Bounds |
109
click to vote
CP
2011
Springer
13 years 11 months ago
2011
Springer
We introduce tractable classes of VCSP instances based on convex cost functions. Firstly, we show that the class of VCSP instances satisfying the hierarchically nested convexity pr...
ECAI
2008
Springer
15 years 1 months ago
2008
Springer
At the "functional level", Semantic Web Services (SWS) are described akin to planning operators, with preconditions and effects relative to an ontology; the ontology prov...
85
Voted
ER
2007
Springer
15 years 5 months ago
2007
Springer
Abstract. We investigate the computational complexity of reasoning over various fragments of the Extended Entity-Relationship (EER) language, which includes a number of constructs:...
AUTOMATICA
2005
14 years 11 months ago
2005
This paper presents a new approach to shaping of the frequency response of the sensitivity function. In this approach, a desired frequency response is assumed to be specified at a...
109
click to vote
CDC
2008
IEEE
15 years 6 months ago
2008
IEEE
Abstract— We analyze reachability properties and local input/output gains of systems with polynomial vector fields. Upper bounds for the reachable set and nonlinear system gains...