1805 search results - page 128 / 361 » Functional programming with structured graphs |
108
click to vote
CORR
2008
Springer
15 years 1 months ago
2008
Springer
In the constraint programming framework, state-of-the-art static and dynamic decomposition techniques are hard to apply to problems with complete initial constraint graphs. For suc...
122
click to vote
PPOPP
2005
ACM
15 years 6 months ago
2005
ACM
We want to perform compile-time analysis of an SPMD program and place barriers in it to synchronize it correctly, minimizing the runtime cost of the synchronization. This is the b...
TLDI
2005
ACM
15 years 6 months ago
2005
ACM
Coordinated data structures are sets of (perhaps unbounded) data structures where the nodes of each structure may share types with the corresponding nodes of the other structures....
153
click to vote
ESOP
2000
Springer
15 years 4 months ago
2000
Springer
We exhibit a technique for automatically verifying the safety of simple C programs working on tree-shaped data structures. We do not consider the complete behavior of programs, but...
136
click to vote
AAAI
2010
15 years 2 months ago
2010
Forming effective coalitions is a major research challenge in AI and multi-agent systems (MAS). Coalition Structure Generation (CSG) involves partitioning a set of agents into coa...