346 search results - page 28 / 70 » Solving quantified constraint satisfaction problems |
70
Voted
EOR
2007
2007
Solving the short-term electrical generation scheduling problem by an adaptive evolutionary approach
14 years 9 months ago
In this paper, we introduce an adaptive evolutionary approach to solve the short-term electrical generation scheduling problem (STEGS). The STEGS is a hard constraint satisfaction...
CP
2006
Springer
15 years 1 months ago
2006
Springer
Abstract. The constraint satisfaction problem can be solved in polynomial time for instances where certain parameters (e.g., the treewidth of primal graphs) are bounded. However, t...
LICS
2010
IEEE
14 years 7 months ago
2010
IEEE
The universal-algebraic approach has proved a powerful tool in the study of the computational complexity of constraint satisfaction problems (CSPs). This approach has previously b...
71
Voted
IAT
2003
IEEE
15 years 2 months ago
2003
IEEE
With the increasing use of the internet, many problemsolving tasks such as resource allocation, scheduling, planning, and configuration pose themselves in an open setting involvi...
EAAI
2008
14 years 9 months ago
2008
Nowadays, many real problems can be formalized as Distributed CSPs. A distributed constraint satisfaction problem (DisCSP) is a CSP in which variables and constraints are distribu...