1144 search results - page 33 / 229 » Logic programming for combinatorial problems |
118
click to vote
NETWORKS
2008
15 years 1 months ago
2008
Given a graph where increasing the weight of an edge has a nondecreasing convex piecewise linear cost, we study the problem of finding a minimum cost increase of the weights so tha...
120
click to vote
ICCV
2005
IEEE
16 years 3 months ago
2005
IEEE
A new framework is presented that uses tools from duality theory of linear programming to derive graph-cut based combinatorial algorithms for approximating NP-hard classification ...
100
click to vote
ECAI
2010
Springer
15 years 3 months ago
2010
Springer
The verification problem for action logic programs with non-terminating behaviour is in general undecidable. In this paper, we consider a restricted setting in which the problem be...
139
click to vote
JCO
2011
14 years 4 months ago
2011
This paper presents mathematical programming techniques for solving a class of multi-sensor scheduling problems. Robust optimization problems are formulated for both deterministic ...
130
click to vote
LPAR
1992
Springer
15 years 6 months ago
1992
Springer
We describe some of the techniques which have been used to implement METATEM, a programming language based on temporal logic, and address problems such as non-determinism and loopi...