986 search results - page 37 / 198 » Generalized Goal Programming: polynomial methods and applica... |
KR
2010
Springer
14 years 17 days ago
2010
Springer
Cardinality constraints or, more generally, weight constraints are well recognized as an important extension of answer-set programming. Clearly, all common algorithmic tasks relat...
ICTAC
2009
Springer
14 years 2 months ago
2009
Springer
“Classical” program development by refinement [12, 2, 3] is a technique for ensuring that source-level program code remains faithful to the semantic goals set out in its corre...
SODA
2004
ACM
13 years 9 months ago
2004
ACM
We design polynomial time approximation schemes (PTASs) for Metric BISECTION, i.e. dividing a given finite metric space into two halves so as to minimize or maximize the sum of di...
OOPSLA
2010
Springer
13 years 6 months ago
2010
Springer
Given a high-level specification and a low-level programming language, our goal is to automatically synthesize an efficient program that meets the specification. In this paper,...
MP
2002
13 years 7 months ago
2002
An iterative framework for solving generalized equations with nonisolated solutions is presented. For generalized equations with the structure 0 F(z) + T (z), where T is a multifu...