2084 search results - page 229 / 417 » Set Constraints in Logic Programming |
139
click to vote
ESA
2006
Springer
15 years 8 months ago
2006
Springer
A popular approach in combinatorial optimization is to model problems as integer linear programs. Ideally, the relaxed linear program would have only integer solutions, which happ...
135
click to vote
SACMAT
2009
ACM
15 years 11 months ago
2009
ACM
A number of research systems have demonstrated the benefits of accompanying each request with a machine-checkable proof that the request complies with access-control policy — a...
120
click to vote
MP
2002
15 years 4 months ago
2002
In this paper we address a general Goal Programming problem with linear objectives, convex constraints, and an arbitrary componentwise nondecreasing norm to aggregate deviations w...
148
click to vote
GECCO
2004
Springer
15 years 9 months ago
2004
Springer
Abstract. We demonstrate a fully automated method for obtaining a closedform approximation of a recursive function. This method resulted from a realworld problem in which we had a ...
136
click to vote
EMMCVPR
2005
Springer
15 years 10 months ago
2005
Springer
Abstract. Reverse-convex programming (RCP) concerns global optimization of a specific class of non-convex optimization problems. We show that a recently proposed model for sparse ...