Sciweavers

6554 search results - page 471 / 1311
» Constraint Logic Programming
Sort
View
170
Voted
CP
2005
Springer
16 years 11 days ago
From Linear Relaxations to Global Constraint Propagation
We present a method for propagating linear constraints. Our technique exploits the fact that the interior point method converges on a central point of the polytope. A variable assi...
Claude-Guy Quimper, Alejandro López-Ortiz
BIRTHDAY
2008
Springer
15 years 8 months ago
Semiring-Based Soft Constraints
The semiring-based formalism to model soft constraint has been introduced in 1995 by Ugo Montanari and the authors of this paper. The idea was to make constraint programming more f...
Stefano Bistarelli, Francesca Rossi
IPL
2007
94views more  IPL 2007»
15 years 6 months ago
The finite horizon investor problem with a budget constraint
We study a model that incorporates a budget constraint in a decision making problem. Our goal is to maximize the expected wealth, where in each time period we can either stop the ...
Asaf Levin
171
Voted
SIAMJO
2010
112views more  SIAMJO 2010»
15 years 1 months ago
A Semidefinite Relaxation Scheme for Multivariate Quartic Polynomial Optimization with Quadratic Constraints
We present a general semidefinite relaxation scheme for general n-variate quartic polynomial optimization under homogeneous quadratic constraints. Unlike the existing sum-of-squar...
Zhi-Quan Luo, Shuzhong Zhang
BIRTHDAY
2005
Springer
16 years 11 days ago
Planning in Answer Set Programming using Ordered Task Decomposition
abstract. In this paper we investigate a formalism for solving planning problems based on ordered task decomposition using Answer Set Programming (ASP). Our planning methodology is...
Jürgen Dix, Ugur Kuter, Dana S. Nau