Sciweavers

13841 search results - page 114 / 2769
» Algorithms and Constraint Programming
Sort
View
PPDP
2010
Springer
14 years 11 months ago
A declarative approach to robust weighted Max-SAT
The presence of uncertainty in the real world makes robustness to be a desired property of solutions to constraint satisfaction problems. Roughly speaking, a solution is robust if...
Miquel Bofill, Dídac Busquets, Mateu Villar...
KR
2004
Springer
15 years 6 months ago
An Improved Integer Local Search for Complex Scheduling Problems
We consider complex scheduling problems that can be captured as optimization under hard and soft constraints. The objective of such an optimization problem is to satisfy as many h...
Weixiong Zhang, Xiaotao Zhang
100
Voted
ISCAS
1994
IEEE
131views Hardware» more  ISCAS 1994»
15 years 4 months ago
An Efficient Design Method for Optimal Weighted Median Filtering
Earlier research has shown that the problem of optimal weighted median filtering with structural constraints can be formulated as a nonconvex nonlinear programming problem in gene...
Ruikang Yang, Moncef Gabbouj, Yrjö Neuvo
81
Voted
FSTTCS
2007
Springer
15 years 6 months ago
Closures and Modules Within Linear Logic Concurrent Constraint Programming
There are two somewhat contradictory ways of looking at modules in a given programming language. On the one hand, module systems are largely independent of the particulars of progr...
Rémy Haemmerlé, François Fage...
186
Voted
CP
2009
Springer
16 years 1 months ago
SOGgy Constraints: Soft Open Global Constraints
We investigate soft open constraints. We generalize and unify classes of soft constraints and adapt them to the open setting. We give sufficient conditions for generalized classes ...
Michael J. Maher