46 search results - page 2 / 10 » Hybrid tractability of valued constraint problems |
CP
2009
Springer
14 years 8 months ago
2009
Springer
The Valued Constraint Satisfaction Problem (VCSP) is a general framework encompassing many optimisation problems. We discuss precisely what it means for a problem to be modelled in...
IJCAI
2003
13 years 8 months ago
2003
Many optimization problems can be expressed us ing some form of soft constraints, where different measures of desirability arc associated with differ ent combinations of domai...
ECAI
2004
Springer
14 years 22 days ago
2004
Springer
We present a new conceptual abstraction in symmetry breaking – the GE-tree. The construction and traversal of a GE-tree breaks all symmetries in any constraint satisfaction or si...
AAAI
2008
13 years 9 months ago
2008
Hybrid Scheduling Problems (HSPs) contain both temporal and finite-domain variables, as well as constraints between them. A hybrid constraint over temporal and finite-domain varia...
AIPS
2006
13 years 8 months ago
2006
In this paper we describe the problem of Optimal Competitive Scheduling, which consists of activities that compete for a shared resource. The objective is to choose a subset of ac...