Sciweavers

4081 search results - page 417 / 817
» The Impact of Constraint Programming
Sort
View
LICS
1995
IEEE
15 years 10 months ago
Structural Cut Elimination
We present new proofs of cut elimination for intuitionistic, classical, and linear sequent calculi. In all cases the proofs proceed by three nested structural inductions, avoiding...
Frank Pfenning
WSC
2001
15 years 8 months ago
Chessboard distributions
We review chessboard distributions for modeling partially specified finite-dimensional random vectors. Chessboard distributions can match a given set of marginals, a given covaria...
Soumyadip Ghosh, Shane G. Henderson
150
Voted
EOR
2006
97views more  EOR 2006»
15 years 6 months ago
A simulated annealing and hill-climbing algorithm for the traveling tournament problem
The Traveling Tournament Problem (TTP) [E. Easton, G. Nemhauser, M. Trick, The traveling tournament problem description and benchmarks, in: Proceedings of the 7th International Co...
Andrew Lim, Brian Rodrigues, X. Zhang
CORR
2002
Springer
133views Education» more  CORR 2002»
15 years 6 months ago
Sequential and Parallel Algorithms for Mixed Packing and Covering
We describe sequential and parallel algorithms that approximately solve linear programs with no negative coefficients (a.k.a. mixed packing and covering problems). For explicitly ...
Neal E. Young
158
Voted
DEBU
1999
85views more  DEBU 1999»
15 years 6 months ago
Specifying Database Transformations in WOL
WOL is a Horn-clause language for specifying transformations involving complex types and recursive data-structures. Its declarative syntax makes programs easy to modify in respons...
Susan B. Davidson, Anthony Kosky