Sciweavers

551 search results - page 49 / 111
» Continuous Search in Constraint Programming
Sort
View
CP
2008
Springer
13 years 10 months ago
Optimization of Simple Tabular Reduction for Table Constraints
Abstract. Table constraints play an important role within constraint programming. Recently, many schemes or algorithms have been proposed to propagate table constraints or/and to c...
Christophe Lecoutre
CORR
2011
Springer
115views Education» more  CORR 2011»
13 years 19 days ago
SAT-Based Termination Analysis Using Monotonicity Constraints over the Integers
ibe an algorithm for proving termination of programs abstracted to systems of monotonicity constraints in the integer domain. Monotonicity constraints are a non-trivial extension ...
Michael Codish, Igor Gonopolskiy, Amir M. Ben-Amra...
AIPS
2009
13 years 10 months ago
Dynamic Controllability of Temporally-flexible Reactive Programs
In this paper we extend dynamic controllability of temporally-flexible plans to temporally-flexible reactive programs. We consider three reactive programming language constructs w...
Robert T. Effinger, Brian C. Williams, Gerard Kell...
CSB
2005
IEEE
118views Bioinformatics» more  CSB 2005»
14 years 2 months ago
Gene Teams with Relaxed Proximity Constraint
Functionally related genes co-evolve, probably due to the strong selection pressure in evolution. Thus we expect that they are present in multiple genomes. Physical proximity amon...
Sun Kim, Jeong-Hyeon Choi, Jiong Yang
SAT
2004
Springer
95views Hardware» more  SAT 2004»
14 years 2 months ago
Local Search for Very Large SAT Problems
The Walksat local search algorithm has previously been extended to handle quantification over variables. This greatly reduces model sizes, but in order to guide greedy moves the a...
Steven David Prestwich, Colin Quirke