4513 search results - page 323 / 903 » Logic programming with satisfiability |
120
click to vote
ASPDAC
1999
ACM
15 years 8 months ago
1999
ACM
We present an algorithm for solving a general min-cut, twoway partitioning problem subject to timing constraints. The problem is formulated as a constrained programming problem an...
140
click to vote
UAI
2008
15 years 6 months ago
2008
Approximate linear programming (ALP) is an efficient approach to solving large factored Markov decision processes (MDPs). The main idea of the method is to approximate the optimal...
147
click to vote
MP
2006
15 years 4 months ago
2006
There are many applications related to singly linearly constrained quadratic programs subjected to upper and lower bounds. In this paper, a new algorithm based on secant approximat...
140
click to vote
TCS
2002
15 years 4 months ago
2002
We investigate the problem of producing symmetric tilings by programs in a uniform way. By this, we mean that the construction of a tiling should be parameterized by the geometric...
158
click to vote
ICFP
2003
ACM
2003
ACM
A formalization of an Ordered Logical Framework in Hybrid with applications to continuation machines
16 years 4 months ago
We report on work in progress devoted to the formalization of an Ordered Logical Framework (OLF) based on a two-level architecture [8] in the Hybrid system. OLF here is a second-or...