Sciweavers

7092 search results - page 729 / 1419
» Parallelizing constraint programs
Sort
View
VTS
2006
IEEE
101views Hardware» more  VTS 2006»
16 years 1 months ago
Design Optimization for Robustness to Single Event Upsets
Abstract: An optimization algorithm for the design of combinational circuits that are robust to single-event upsets (SEUs) is described. A simple, highly accurate model for the SEU...
Quming Zhou, Mihir R. Choudhury, Kartik Mohanram
CP
2003
Springer
16 years 10 days ago
Semi-independent Partitioning: A Method for Bounding the Solution to COP's
In this paper we introduce a new method for bounding the solution to constraint optimization problems called semi-independent partitioning. We show that our method is a strict gene...
David Larkin
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
EOR
2006
97views more  EOR 2006»
15 years 7 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