10072 search results - page 449 / 2015 » Composition of Model Programs |
197
click to vote
GPEM
2008
15 years 7 months ago
2008
In this work a cooperative, bid-based, model for problem decomposition is proposed with application to discrete action domains such as classification. This represents a significan...
215
click to vote
CP
2010
Springer
15 years 5 months ago
2010
Springer
The state-of-the-art global constraint for bin packing is due to Shaw. We compare two linear continuous relaxations of the bin packing problem, based on the DP-flow and Arc-flow ...
180
click to vote
FSTTCS
2008
Springer
15 years 8 months ago
2008
Springer
ABSTRACT. Multiset pushdown systems have been introduced by Sen and Viswanathan as an adequate model for asynchronous programs where some procedure calls can be stored as tasks to ...
193
click to vote
FOAL
2009
ACM
16 years 1 months ago
2009
ACM
We present a programming language model of the ideas behind Functional Adaptive Programming (AP-F) and our Java implementation, DemeterF. Computation in AP-F is encapsulated in se...
212
click to vote
ESOP
2010
Springer
16 years 4 months ago
2010
Springer
Formal reasoning about concurrent programs is usually done with the assumption that the underlying memory model is sequentially consistent, i.e. the execution outcome is equivalen...