Sciweavers

2974 search results - page 243 / 595
» Model-Driven Constraint Programming
Sort
View
IOR
2010
98views more  IOR 2010»
15 years 3 months ago
A Shadow Simplex Method for Infinite Linear Programs
We present a Simplex-type algorithm, that is, an algorithm that moves from one extreme point of the infinite-dimensional feasible region to another not necessarily adjacent extrem...
Archis Ghate, Dushyant Sharma, Robert L. Smith
AAAI
2012
13 years 9 months ago
Reformulating Temporal Action Logics in Answer Set Programming
Temporal Action Logics (TAL) is a class of temporal logics for reasoning about actions. We present a reformulation of TAL in Answer Set Programming (ASP), and discuss some synergi...
Joohyung Lee, Ravi Palla
ICIP
2003
IEEE
16 years 8 months ago
Graylevel alignment between two images using linear programming
A critical step in defect detection for semiconductorprocess is to align a test image against a reference. This includes both spatial alignment and grayscale alignment. For the la...
E. Y. Lam
ICIP
2001
IEEE
16 years 8 months ago
Optimal radial contour tracking by dynamic programming
A common problem in most active contour methods is that the recursive searching scheme can only return a local optimal solution. Furthermore, the internal energy of the snake is n...
Yunqiang Chen, Thomas S. Huang, Yong Rui
CADE
2001
Springer
16 years 6 months ago
Termination and Reduction Checking for Higher-Order Logic Programs
In this paper, we present a syntax-directed termination and reduction checker for higher-order logic programs. The reduction checker verifies parametric higher-order subterm orderi...
Brigitte Pientka