10 search results - page 2 / 2 » cp 1999 |
CP
1999
Springer
13 years 9 months ago
1999
Springer
In this paper we present a Lagrange-multiplier formulation of discrete constrained optimization problems, the associated discrete-space first-order necessary and sufficient condit...
CP
1999
Springer
13 years 9 months ago
1999
Springer
Reformulating constraint satisfaction problems (CSPs) in lower arity is a common procedure when computing consistency. Lower arity CSPs are simpler to treat than high arity CSPs. ...
CP
1999
Springer
13 years 9 months ago
1999
Springer
The behaviour of many systems is naturally modelled by a set of ordinary differential equations (ODEs) which are parametric. Since decisions are often based on relations over these...
RE
1999
Springer
13 years 9 months ago
1999
Springer
One of the difficulties in requirements negotiation is to determine a feasible and mutually satisfactory set of requirements for the developer and the user, a problem related to C...
CJTCS
1999
13 years 4 months ago
1999
We show that thepermanent cannot be computed by uniform constantdepth threshold circuits of size Tn, for any function T such that for all k, Tk n = o2n. More generally, we show th...