Sciweavers

53 search results - page 4 / 11
» Generating Propagators for Finite Set Constraints
Sort
View
CPAIOR
2010
Springer
13 years 5 months ago
Lazy Clause Generation: Combining the Power of SAT and CP (and MIP?) Solving
Finite domain propagation solving, the basis of constraint programming (CP) solvers, allows building very high-level models of problems, and using highly specific inference encapsu...
Peter J. Stuckey
ISCIS
2009
Springer
14 years 2 months ago
Using a SAT solver to generate checking sequences
—Methods for software testing based on Finite State Machines (FSMs) have been researched since the early 60’s. Many of these methods are about generating a checking sequence fr...
Guy-Vincent Jourdan, Hasan Ural, Hüsnü Y...
CORR
1998
Springer
107views Education» more  CORR 1998»
13 years 7 months ago
Computing Declarative Prosodic Morphology
This paper describes a computational, declarative approach to prosodic morphology that uses inviolable constraints to denote small finite candidate sets which are filtered by a re...
Markus Walther
SAC
2010
ACM
14 years 2 months ago
Tracking random finite objects using 3D-LIDAR in marine environments
This paper presents a random finite set theoretic formulation for multi-object tracking as perceived by a 3D-LIDAR in a dynamic environment. It is mainly concerned with the joint...
Kwang Wee Lee, Bharath Kalyan, W. Sardha Wijesoma,...
SIAMAM
2000
119views more  SIAMAM 2000»
13 years 7 months ago
The "Linear" Limit of Thin Film Flows as an Obstacle-Type Free Boundary Problem
We study the limit as n 0 of the nonnegative, self-similar source-type solutions of the thin film equation ut + (unuxxx)x = 0. We obtain a unique limiting function u, which is a s...
Fernando Quirós, Francisco Bernis, Josephus...