3591 search results - page 108 / 719 » Typing linear constraints |
93
Voted
CTCS
1989
Springer
15 years 4 months ago
1989
Springer
We introduce the notion of a candidate for “multiple valued universal constructions” and define stable functors (which generalise functors with left adjoints) in terms of fac...
112
Voted
PARA
2004
Springer
15 years 6 months ago
2004
Springer
Large and sparse rational eigenproblems where the rational term is of low rank k arise in vibrations of fluid–solid structures and of plates with elastically attached loads. Exp...
WAN
1998
Springer
15 years 5 months ago
1998
Springer
We consider parallel algorithms for computing the Hermite normal form of matrices over Euclidean rings. We use standard types of reduction methods which are the basis of many algor...
78
Voted
CDC
2009
IEEE
15 years 1 months ago
2009
IEEE
We consider control systems of the type x = Ax+(t)bu, where u R, (A, b) is a controllable pair and is an unknown time-varying signal with values in [0, 1] satisfying a permanent...
98
Voted
IJCAI
2003
15 years 2 months ago
2003
In data-integration systems, information sources often have various constraints such as “all houses stored at a source have a unique address.” These constraints are very usefu...