8109 search results - page 196 / 1622 » A Model of Component-Based Programming |
164
click to vote
JMLR
2006
15 years 6 months ago
2006
The problem of finding the most probable (MAP) configuration in graphical models comes up in a wide range of applications. In a general graphical model this problem is NP hard, bu...
148
click to vote
CONCUR
2005
Springer
15 years 11 months ago
2005
Springer
Abstract. In this paper we show how to compress efficiently the statespace of a concurrent system (here applied to a simple shared memory model, but this is no way limited to that ...
165
click to vote
GPEM
2008
15 years 6 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...
199
click to vote
CP
2010
Springer
15 years 4 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 ...
144
click to vote
CCGRID
2008
IEEE
16 years 19 days ago
2008
IEEE
—We formulate the service composition problem as a multi-objective stochastic program which simultaneously optimizes the following quality of service (QoS) parameters: workflow ...