131
click to vote
FPL
2004
Springer
15 years 7 months ago
2004
Springer
We describe algorithmic results for two crucial aspects of allocating resources on computational hardware devices with partial reconfigurability. By using methods from the field of...
133
click to vote
CP
2006
Springer
15 years 7 months ago
2006
Springer
The paper presents a method for generating solutions of a constraint satisfaction problem (CSP) uniformly at random. The main idea is to express the CSP as a factored probability d...
125
click to vote
CP
2006
Springer
15 years 7 months ago
2006
Springer
Efficient constraint propagation is crucial to any constraint solver. We show that watched literals, already a great success in the satisfiability community, can be used to provide...
CP
2006
Springer
15 years 7 months ago
2006
Springer
