4451 search results - page 309 / 891 » On Random Ordering Constraints |
176
click to vote
IDA
2005
Springer
16 years 6 days ago
2005
Springer
In this paper we introduce a simple ant based algorithm for solving a copper mine planning problem. In the last 10 years this realworld problem has been tackled using linear intege...
188
click to vote
EUROPAR
2004
Springer
16 years 2 days ago
2004
Springer
Since embedded systems require ever more compute power, SMT processors are viable candidates for future high performance embedded processors. However, SMTs exhibit unpredictable pe...
169
click to vote
ICCAD
1997
IEEE
15 years 11 months ago
1997
IEEE
- Task preemption is a critical enabling mechanism in multi-task VLSI systems. On preemption, data in the register les must be preserved in order for the task to be resumed. This e...
166
click to vote
CP
2006
Springer
15 years 10 months ago
2006
Springer
We reconsider the idea of structural symmetry breaking (SSB) for constraint satisfaction problems (CSPs). We show that the dynamic dominance checks used in symmetry breaking by dom...
167
click to vote
CP
2006
Springer
15 years 10 months ago
2006
Springer
Abstract. Thanks to its extended expressiveness, the quantified constraint satisfaction problem (QCSP) can be used to model problems that are difficult to express in the standard C...