874 search results - page 86 / 175 » Computing Weighted Solutions in Answer Set Programming |
106
Voted
CPAIOR
2010
Springer
15 years 6 months ago
2010
Springer
In this paper, we present a constraint programming approach for the service consolidation problem that is being currently tackled by Neptuny, Milan. The problem is defined as: Giv...
126
Voted
ICML
2010
IEEE
15 years 2 months ago
2010
IEEE
Approximate dynamic programming has been used successfully in a large variety of domains, but it relies on a small set of provided approximation features to calculate solutions re...
105
click to vote
EMMCVPR
2005
Springer
15 years 6 months ago
2005
Springer
Abstract. In this paper, we present a novel successive relaxation linear programming scheme for solving the important class of consistent labeling problems for which an L1 metric i...
106
Voted
ICLP
1997
Springer
15 years 5 months ago
1997
Springer
We provide a method whereby, given mode and (upper approximation) type information, we can detect procedures and goals that can be guaranteed to not fail (i.e., to produce at leas...
107
Voted
CORR
2008
Springer
15 years 1 months ago
2008
Springer
Abstract. We introduce two min-max problems: the first problem is to minimize the supremum of finitely many rational functions over a compact basic semi-algebraic set whereas the s...