2109 search results - page 78 / 422 » Solving Necklace Constraint Problems |
146
click to vote
CONSTRAINTS
2006
15 years 4 months ago
2006
Abstract. The Still-Life problem is challenging for CP techniques because the basic constraints of the game of Life are loose and give poor propagation for Still-Life. In this pape...
115
click to vote
TIT
2008
15 years 4 months ago
2008
Abstract--In this paper, we study moments of soft bits of binary-input symmetric-output channels and solve some extremal problems of the moments. We use these results to solve the ...
161
click to vote
GECCO
2007
Springer
15 years 10 months ago
2007
Springer
The Unit Commitment Problem (UCP) is the task of finding an optimal turn on and turn off schedule for a group of power generation units over a given time horizon to minimize ope...
155
click to vote
MATES
2009
Springer
15 years 11 months ago
2009
Springer
In constraint satisfaction, decomposition is a common technique to split a problem in a number of parts in such a way that the global solution can be efficiently assembled from th...
164
Voted
CISS
2010
IEEE
14 years 8 months ago
2010
IEEE
— AHNs are wireless networks operating without the benefits of network infrastructure (basestations) or centralized control. AHNs working with limited spectrum perform best when...