7092 search results - page 727 / 1419 » Parallelizing constraint programs |
192
click to vote
ESOP
2004
Springer
16 years 14 days ago
2004
Springer
t) Peter W. O’Hearn Queen Mary, University of London In the 1960s Dijkstra suggested that, in order to limit the complexity of potential process interactions, concurrent programs...
213
click to vote
PLDI
2012
ACM
13 years 9 months ago
2012
ACM
Modern architectures implement relaxed memory models which may reorder memory operations or execute them non-atomically. Special instructions called memory fences are provided, al...
329
click to vote
CP
2009
Springer
16 years 7 months ago
2009
Springer
This paper presents a new way of formalizing the Coalition Structure Generation problem (CSG), so that we can apply constraint optimization techniques to it. Forming effective coal...
179
click to vote
COR
2010
15 years 7 months ago
2010
In many real-life optimisation problems, there are multiple interacting components in a solution. For example, different components might specify assignments to different kinds of...
218
click to vote
BMCBI
2010
15 years 7 months ago
2010
Background: RNA structure prediction problem is a computationally complex task, especially with pseudo-knots. The problem is well-studied in existing literature and predominantly ...