Sciweavers

349 search results - page 3 / 70
» Semiring-Based Soft Constraints
Sort
View
95
Voted
FLAIRS
2003
14 years 11 months ago
Soft CLP (FD)
Over-constrained problems can be solved with the help of soft constraints. Weighted constraints are a typical representation of soft constraints used to minimize weights of unsati...
Hana Rudová
77
Voted
CORR
2010
Springer
109views Education» more  CORR 2010»
14 years 9 months ago
Hybrid tractability of soft constraint problems
The constraint satisfaction problem (CSP) is a central generic problem in artificial intelligence. Considerable effort has been made in identifying properties which ensure tractabi...
Martin C. Cooper, Stanislav Zivný
ICCAD
2009
IEEE
131views Hardware» more  ICCAD 2009»
14 years 7 months ago
Scheduling with soft constraints
In a behavioral synthesis system, a typical approach used to guide the scheduler is to impose hard constraints on the relative timing between operations considering performance, a...
Jason Cong, Bin Liu, Zhiru Zhang
CP
2000
Springer
15 years 1 months ago
Constraint Propagation for Soft Constraints: Generalization and Termination Conditions
Soft constraints based on semirings are a generalization of classical constraints, where tuples of variables' values in each soft constraint are uniquely associated to element...
Stefano Bistarelli, Rosella Gennari, Francesca Ros...
AMAI
2010
Springer
14 years 7 months ago
Interval-valued soft constraint problems
Constraints and quantitative preferences, or costs, are very useful for modelling many real-life problems. However, in many settings, it is difficult to specify precise preference ...
Mirco Gelain, Maria Silvia Pini, Francesca Rossi, ...