Sciweavers

4451 search results - page 160 / 891
» On Random Ordering Constraints
Sort
View
134
Voted
CP
2004
Springer
15 years 10 months ago
Deriving Filtering Algorithms from Constraint Checkers
Abstract. This article deals with global constraints for which the set of solutions can be recognized by an extended finite automaton whose size is bounded by a polynomial in n, w...
Nicolas Beldiceanu, Mats Carlsson, Thierry Petit
CORR
2004
Springer
115views Education» more  CORR 2004»
15 years 4 months ago
Jartege: a Tool for Random Generation of Unit Tests for Java Classes
This paper presents Jartege, a tool which allows random generation of unit tests for Java classes specified in JML. JML (Java Modeling Language) is a specification language for Ja...
Catherine Oriat
120
Voted
CP
2003
Springer
15 years 10 months ago
Redundant Modeling for the QuasiGroup Completion Problem
Abstract. The Quasigroup Completion Problem (QCP) is a very challenging benchmark among combinatorial problems, and the focus of much recent interest in the area of constraint prog...
Iván Dotú, Alvaro del Val, Manuel Ce...
STOC
2010
ACM
220views Algorithms» more  STOC 2010»
15 years 8 months ago
Combinatorial approach to the interpolation method and scaling limits in sparse random graphs
We establish the existence of free energy limits for several sparse random hypergraph models corresponding to certain combinatorial models on Erd¨os-R´enyi graph G(N, c/N) and r...
Mohsen Bayati, David Gamarnik, Prasad Tetali
165
Voted
CP
2005
Springer
15 years 10 months ago
Solving Large-Scale Nonlinear Programming Problems by Constraint Partitioning
Abstract. In this paper, we present a constraint-partitioning approach for finding local optimal solutions of large-scale mixed-integer nonlinear programming problems (MINLPs). Ba...
Benjamin W. Wah, Yixin Chen