336 search results - page 3 / 68 » Permutation Problems and Channelling Constraints |
CP
2005
Springer
14 years 1 months ago
2005
Springer
When the search for a solution to a constraint satisfaction problem backtracks, it is not usually worthwhile to remember the assignment that failed, because the same assignment wil...
COR
2007
13 years 7 months ago
2007
This paper studies the two-machine permutation flowshop scheduling problem with anticipatory setup times and an availability constraint imposed only on the first machine. The obje...
MOBICOM
2010
ACM
13 years 7 months ago
2010
ACM
Collisions in overlapping channels are becoming an increasingly important problem in the deployment of high-speed wireless networks. In this paper, we present Remap, a simple, nov...
SARA
2009
Springer
14 years 2 months ago
2009
Springer
We study novel approaches for solving of hard combinatorial problems by translation to Boolean Satisfiability (SAT). Our focus is on combinatorial problems that can be represented...
ACSAC
2006
IEEE
14 years 1 months ago
2006
IEEE
Information leakage through covert channels and side channels is becoming a serious problem, especially when these are enhanced by modern processor architecture features. We show ...