5506 search results - page 634 / 1102 » Minimal Logic Programs |
180
click to vote
COLT
1992
Springer
15 years 11 months ago
1992
Springer
This paper deals with a class of Prolog programs, called context-free term transformations (CFT). We present a polynomial time algorithm to identify a subclass of CFT, whose progr...
168
click to vote
CORR
2007
Springer
15 years 6 months ago
2007
Springer
— This paper explores optimization of paging and registration policies in cellular networks. Motion is modeled as a discrete-time Markov process, and minimization of the discount...
231
click to vote
ISVC
2010
Springer
15 years 5 months ago
2010
Springer
Abstract. We propose an improved shape matching algorithm that extends the work of Felzenszwalb [3]. In this approach, we use triangular meshes to represent deformable objects and ...
147
click to vote
OL
2010
15 years 5 months ago
2010
In an important paper, Burer [2] recently showed how to reformulate general mixed-binary quadratic optimization problems (QPs) into copositive programs where a linear functional i...
144
click to vote
CORR
2010
Springer
15 years 4 months ago
2010
Springer
Abstract. Testing is one of the most indispensable tasks in software engineering. The role of testing in software development has grown significantly because testing is able to rev...