3572 search results - page 238 / 715 » Nominal Logic Programming |
153
click to vote
GLOBECOM
2007
IEEE
16 years 29 days ago
2007
IEEE
Abstract—In Chebyshev finite-impulse response (FIR) equalization, we design an FIR filter that minimizes the Chebyshev equalization error, i.e., the maximum absolute deviation ...
172
click to vote
SIAMJO
2008
15 years 6 months ago
2008
We consider a rather general class of mathematical programming problems with data uncertainty, where the uncertainty set is represented by a system of convex inequalities. We prove...
191
Voted
CPAIOR
2010
Springer
15 years 11 months ago
2010
Springer
Abstract. Logic-based Benders decomposition can combine mixed integer programming and constraint programming to solve planning and scheduling problems much faster than either metho...
196
click to vote
SUM
2007
Springer
16 years 22 days ago
2007
Springer
Abstract. We present the Consistency Extractor System (ConsEx) that uses answer set programming to compute consistent answers to first-order queries posed to relational databases ...
182
click to vote
FSTTCS
1999
Springer
15 years 11 months ago
1999
Springer
The λ-calculus has been much used to study the theory of substitution in logical systems and programming languages. However, with explicit substitutions, it is possible to get fi...