365 search results - page 21 / 73 » An Approach to Multiply Segmented Constraint Satisfaction Pr... |
82
Voted
CP
2003
Springer
15 years 5 months ago
2003
Springer
Abstract. The Quasigroup Completion Problem (QCP) is a very challenging benchmark among combinatorial problems, and the focus of much recent interest in the area of constraint prog...
98
Voted
ICCV
2011
IEEE
14 years 11 days ago
2011
IEEE
Convex relaxation techniques have become a popular approach to image segmentation as they allow to compute solutions independent of initialization to a variety of image segmentati...
97
Voted
PPDP
2009
Springer
15 years 7 months ago
2009
Springer
This paper describes the encoding of a telecommunications feature subscription configuration problem to propositional logic and its solution using a state-of-the-art Boolean sati...
88
Voted
EOR
2007
2007
Solving the short-term electrical generation scheduling problem by an adaptive evolutionary approach
15 years 9 days 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...
103
click to vote
EOR
2011
14 years 7 months ago
2011
We consider an inventory distribution system consisting of one warehouse and multiple retailers. The retailers face random demand and are supplied by the warehouse. The warehouse ...