Sciweavers

6554 search results - page 840 / 1311
» Constraint Logic Programming
Sort
View
TACAS
2007
Springer
141views Algorithms» more  TACAS 2007»
16 years 29 days ago
JPF-SE: A Symbolic Execution Extension to Java PathFinder
We present JPF–SE, an extension to the Java PathFinder Model Checking framework (JPF) that enables the symbolic execution of Java programs. JPF–SE uses JPF to generate and expl...
Saswat Anand, Corina S. Pasareanu, Willem Visser
CP
2003
Springer
16 years 2 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
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 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