2084 search results - page 368 / 417 » Set Constraints in Logic Programming |
102
Voted
ECAI
2004
Springer
15 years 8 months ago
2004
Springer
The purpose of this paper is to show that a well known machine learning technique based on Decision Trees can be effectively used to select the best approach (in terms of efficien...
138
Voted
CVPR
2003
IEEE
15 years 8 months ago
2003
IEEE
This paper brings a novel method for three-dimensional reconstruction of surfaces that takes advantage of the symmetry resulting from alternating the positions of a camera and a l...
125
Voted
CPAIOR
2010
Springer
15 years 6 months ago
2010
Springer
Cutting plane methods are widely used for solving convex optimization problems and are of fundamental importance, e.g., to provide tight bounds for Mixed-Integer Programs (MIPs). T...
114
Voted
ATMOS
2007
15 years 4 months ago
2007
In this paper we study a general formulation of the train platforming problem, which contains as special cases all the versions previously considered in the literature as well as a...
136
Voted
AIPS
2010
15 years 3 months ago
2010
Over the last few years there has been a revival of interest in the idea of least-commitment planning with a number of researchers returning to the partial-order planning approach...