2861 search results - page 353 / 573 » Constraint Programming |
175
click to vote
TCS
2008
15 years 6 months ago
2008
The problem of computing approximate GCDs of several polynomials with real or complex coefficients can be formulated as computing the minimal perturbation such that the perturbed ...
171
click to vote
HEURISTICS
2002
15 years 6 months ago
2002
Given a graph G, the Shortest Capacitated Paths Problem (SCPP) consists of determining a set of paths of least total length, linking given pairs of vertices in G, and satisfying c...
155
click to vote
ICSE
2007
IEEE-ACM
16 years 6 months ago
2007
IEEE-ACM
This paper describes the Korat tool for constraint-based generation of structurally complex test inputs for Java programs. Korat takes (1) an imperative predicate that specifies t...
146
click to vote
EPIA
2007
Springer
16 years 19 days ago
2007
Springer
This paper shows how moral decisions can be drawn computationally by using prospective logic programs. These are employed to model moral dilemmas, as they are able to prospectively...
110
click to vote
COLING
1994
15 years 7 months ago
1994
The standard HPSG analysis of Germanic verb clusters can not explain the observed narrowscope readings of adjuncts in such verb clusters. We present an extension of the HPSG analy...